TY - GEN

T1 - On the number of regular vertices of the union of Jordan Regions

AU - Aronov, Boris

AU - Efrat, Alon

AU - Halperin, Dan

AU - Sharir, Micha

N1 - Publisher Copyright:
© 1998, Springer-Verlag. All rights reserved.

PY - 1998

Y1 - 1998

N2 - Let C be a collection of n Jordan regions in the plane in general position, such that each pair of their boundaries intersect in at most s points, where s is a constant. If the boundaries of two sets in C cross exactly twice, then their intersection points are called regular vertices of the arrangement A(C). Let R(C) denote the set of regular vertices on the boundary of the union of C. We present several bounds on |R(C)|, determined by the type of the sets of C. (i) If each set of C is convex, then [R(C)[ = O(n1.5+ε) for any ε > 0.4 (ii) If C consists of two collections C1 and C2 where C1 is a collection of n convex pseudo-disks in the plane (closed Jordan regions with the property that the boundaries of any two of them intersect at most twice), and C2 is a collection of polygons with a total of n sides, then |R(C)| = O(n4/3), and this bound is tight in the worst case. (iii) If no further assumptions are made on the sets of C, then we show that there is a positive integer t that depends only on s such that |R(C)| = O(n2-1/t).

AB - Let C be a collection of n Jordan regions in the plane in general position, such that each pair of their boundaries intersect in at most s points, where s is a constant. If the boundaries of two sets in C cross exactly twice, then their intersection points are called regular vertices of the arrangement A(C). Let R(C) denote the set of regular vertices on the boundary of the union of C. We present several bounds on |R(C)|, determined by the type of the sets of C. (i) If each set of C is convex, then [R(C)[ = O(n1.5+ε) for any ε > 0.4 (ii) If C consists of two collections C1 and C2 where C1 is a collection of n convex pseudo-disks in the plane (closed Jordan regions with the property that the boundaries of any two of them intersect at most twice), and C2 is a collection of polygons with a total of n sides, then |R(C)| = O(n4/3), and this bound is tight in the worst case. (iii) If no further assumptions are made on the sets of C, then we show that there is a positive integer t that depends only on s such that |R(C)| = O(n2-1/t).

UR - http://www.scopus.com/inward/record.url?scp=84957696038&partnerID=8YFLogxK

U2 - 10.1007/BFb0054379

DO - 10.1007/BFb0054379

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84957696038

SN - 3540646825

SN - 9783540646822

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 322

EP - 334

BT - Algorithm Theory — SWAT 1998 - 6th Scandinavian Workshop on Algorithm Theory, Proceedings

A2 - Arnborg, Stefan

A2 - Ivansson, Lars

PB - Springer Verlag

T2 - 6th Scandinavian Workshop on Algorithm Theory, SWAT 1998

Y2 - 8 July 1998 through 10 July 1998

ER -