On arrangements of Jordan arcs with three intersections per pair
- 40 Downloads
Motivated by a number of motion-planning questions, we investigate in this paper some general topological and combinatorial properties of the boundary of the union ofn regions bounded by Jordan curves in the plane. We show that, under some fairly weak conditions, a simply connected surface can be constructed that exactly covers this union and whose boundary has combinatorial complexity that is nearly linear, even though the covered region can have quadratic complexity. In the case where our regions are delimited by Jordan acrs in the upper halfplane starting and ending on thex-axis such that any pair of arcs intersect in at most three points, we prove that the total number of subarcs that appear on the boundary of the union is only Θ(nα(n)), whereα(n) is the extremely slowly growing functional inverse of Ackermann's function.
KeywordsJordan Curve Simple Connectivity Boundary Patch Jordan Region Functional Inverse
- [GSS]Guibas, L., Sharir, M., and Sifrony, S.: On the general motion-planning problem with two degrees of freedom.Proceedings of the Fourth ACM Symposium on Computational Geometry (1988).Google Scholar
- [M]Massey, W. S.:Algebraic Topology: An Introduction. Springer-Verlag, New York (1977).Google Scholar