---
res:
bibo_abstract:
- "Two or more geometrical objects (solids) are said to be connected whenever their
union is a connected point set in the usual sense. Sets of geometrical objects
are naturally divided into connected components, which are maximal connected subsets.
We show that the connected components of a given collection of n horizontal and
vertical line segments in the plane can be computed in O (n log n) time and O
(n) space and prove that this is essentially optimal. The result is generalized
to compute the connected components of a set of n rectilinearly-oriented rectangles\r\nin
the plane with the same time and space bounds. Several extensions of the results
to higher dimensions and to dynamic sets of objects are discussed.@eng"
bibo_authorlist:
- foaf_Person:
foaf_givenName: Herbert
foaf_name: Edelsbrunner, Herbert
foaf_surname: Edelsbrunner
foaf_workInfoHomepage: http://www.librecat.org/personId=3FB178DA-F248-11E8-B48F-1D18A9856A87
orcid: 0000-0002-9823-6833
- foaf_Person:
foaf_givenName: Jan
foaf_name: Van Leeuwen, Jan
foaf_surname: Van Leeuwen
- foaf_Person:
foaf_givenName: Thomas
foaf_name: Ottmann, Thomas
foaf_surname: Ottmann
- foaf_Person:
foaf_givenName: Derick
foaf_name: Wood, Derick
foaf_surname: Wood
bibo_doi: 10.1051/ita/1984180201711
bibo_issue: '2'
bibo_volume: 18
dct_date: 1984^xs_gYear
dct_isPartOf:
- http://id.crossref.org/issn/0397-9326
- http://id.crossref.org/issn/1290-385X
dct_language: eng
dct_publisher: EDP Sciences@
dct_title: Computing the connected components of simple rectilinear geometrical
objects in D-Space@
...