Computing simple circuits from a set of line segments
- 59 Downloads
We address the problem of connecting line segments to form the boundary of a simple polygon—a simple circuit. However, not every set of segments can be so connected. We present anO(n logn)-time algorithm to determine whether a set of segments, constrained so that each segment has at least one endpoint on the boundary of the convex hull of the segments, admits a simple circuit. Furthermore, this technique can also be used to compute a simple circuit of minimum perimeter, or a simple circuit that bounds the minimum area, with no increase in computational complexity.
KeywordsLine Segment Convex Hull Discrete Comput Geom Weighted Graph Simple Polygon
Unable to display preview. Download preview PDF.
- 1.D. Avis and D. Rappaport, Computing monotone simple circuits in the plane, inComputational Morphology (G. Toussaint, ed.), 13–23, North-Holland, Amsterdam (1988).Google Scholar
- 3.N. Friedman, Some results on the effect of arithmetics on comparison problems,Proc. 13th IEEE Symp. Switching Automata Theory (1972), 139–142.Google Scholar
- 10.D. Rappaport, The Complexity of Computing Simple Circuits in the Plane, Ph.D. thesis, McGill University (1986).Google Scholar
- 11.D. Rappaport, Computing simple circuits from a set of line segments is NP-complete,Proc. 3rd ACM Symp. Comput. Geom. (1987), 322–330.Google Scholar
- 12.M. I. Shamos, Geometric complexity,Proc. 7th ACM Annu. Symp. Theory Comput. (1975), 224–233.Google Scholar
- 13.M. I. Shamos and D. Hoey, Geometric intersection problems,Proc. 17th IEEE Annu. Symp. Found. Comput. Sci. (1976), 208–215.Google Scholar
- 14.S. Suri, Personal communication (1986).Google Scholar