H. Edelsbrunner, J. van Leeuwen, T. Ottmann and D. Wood, Computing connected components of simple rectilinear geometrical objects in d-space, RAIRO Theoretical Informatics, 18:2 (1984), pp. 171-183. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Scanline Algorithms on a Grid - Karlsson, Overmars (1986) (5 citations) (Correct)
....Problem Known bound New bound 3 dim maximal elements maximal layers orthogonal convex hull closure boundary intersection true intersection connected components line segment intersection .log. 12] nlog n nlog n [e.g. 5] los n [18] k nlog n [3,13] k nlog n [a,la] nlog n [4] k nlog2n loglog n [2] or (k I n)1os n [1] nloglog u nloglog u nloglog,u nloglog u k I nloglog u k nlog u loglog u nlog u loglog u k u nlog n or (k n)loglog u nlog n To solve some of these problems a new dynamic 1 dimensional structure for the stabbing problem (for a set ....
....First, a cluster trie, storing the connected components; secondly, an endpoint trie, storing the endpoints of the active rectangles (rectangles intersected by the scanline) and finally, an interval trie, storing the y intervais of active rectangles. This set up is somewhat similar to the one in [4], but the new data structures provide a more efficient solution. 9 active interval Figure 3. Scanning for connected components (active intervals are shaded) Theorem .1: Given r orthogonal rectangles on U 2 we can compute the con nected components in time O(rlog 1oglog u) using O(r ....
H. Edelsbrunner, J. van Leeuwen, T. Ottmann and D. Wood, Computing the Connected Components of Simple Rectilinear Geometrical Objects in d-space, R.A.LR.O. Theoretical Informat/cs 18, 2 (1984), 171-183
On Computing Connected Components of Line Segments - Lopez, Thurimella (1995) (1 citation) (Correct)
....components of two sets S and T of line segments in the plane, where no two segments in S (similarly, T ) intersect. The special case of computing connected components when the objects are orthogonal has been shown to be solvable with O(n) space in O(n log n) time, where n is the size of the input [ELOW84, GS83]. When the number of orientations of the input segments is c, it is known that the connected components can be found in O(cn log n) time with O(n) space [LJS91] The number orientations can be arbitrary in today s technology, and hence many practical net extraction algorithms compute all ....
H. Edelsbrunner, J. van Leeuwen, T. Ottmann and D. Wood, Computing connected components of simple rectilinear geometrical objects in d-space, RAIRO Theoretical Informatics, 18:2 (1984), pp. 171-183.
On Computing Connected Components of Line Segments - Mario Alberto Lopez (1995) (1 citation) (Correct)
No context found.
H. Edelsbrunner, J. van Leeuwen, T. Ottmann and D. Wood, Computing connected components of simple rectilinear geometrical objects in d-space, RAIRO Theoretical Informatics, 18:2 (1984), pp. 171-183.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC