Abstract
We examine the different ways a set ofn points in the plane can be connected to form a simple polygon. Such a connection is called apolygonization of the points. For some point sets the number of polygonizations is exponential in the number of points. For this reason we restrict our attention to star-shaped polygons whose kernels have nonempty interiors; these are callednondegenerate star-shaped polygons.
We develop an algorithm and data structure for determining the nondegenerate star-shaped polygonizations of a set ofn points in the plane. We do this by first constructing an arrangement of line segments from the point set. The regions in the arrangement correspond to the kernels of the nondegenerate star-shaped polygons whose vertices are the originaln points. To obtain the data structure representing this arrangement, we show how to modify data structures for arrangements of lines in the plane. This data structure can be computed inO(n 4) time and space. By visiting the regions in this data structure in a carefully chosen order, we can compute the polygon associated with each region inO(n) time, yielding a total computation time ofO(n 5) to compute a complete list ofO(n 4) nondegenerate star-shaped polygonizations of the set ofn points.
Article PDF
Similar content being viewed by others
References
N. Ahuja, Dot pattern processing using Voronoi neighborhoods,IEEE Trans. PAMI 4 (1982), 336–343.
B. M. Chazelle, Filtering search: a new approach to query-answering,Proceedings of the 24th IEEE Annual Symposium on Foundations of Computer Science, 217–225, 1983.
B. M. Chazelle, L. J. Guibas, and D. T. Lee, The power of geometric duality,Proceedings of the 24th IEEE Annual Symposium on Foundations of Computer Science, 217–225, 1983.
F. Dévai, Quadratic bounds for hidden-line elimination,Proceedings of the Second Symposium on Computational Geometry, 269–275, 1986.
H. Edelsbrunner, J. O'Rourke, and R. Seidel, Constructing arrangements of lines and hyperplanes with applications,Proceedings of the 24th IEEE Annual Symposium on Foundations of Computer Science, 83–91, 1983.
R. L. Graham, An efficient algorithm for determining the convex hull of a finite planar set,Inform. Process. Lett. 1 (1972), 132–133.
B. Grünbaum,Convex Polytopes, Interscience, London, 1967.
L. J. Guibas and J. Stolfi, Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams,Proceedings of the 15th ACM Annual Symposium on the Theory of Computing, 221–234, 1983.
R. B. Hayward, A lower bound for the optimal crossing-free Hamiltonian cycle problem,Discrete Comput. Geom., to appear.
D. E. Knuth,The Art of Computer Programming, Vol. 1, Addison-Wesley, Reading, MA, 1973.
D. E. Muller and F. P. Preparata, Finding the intersection of two convex polyhedra,Theoret. Compute. Sci. 7 (1978), 217–236.
J. Nievergelt and F. P. Preparata, Plane-sweep algorithms for intersecting geometric figures,Comm. ACM,25 (1982), 739–747.
J. F. O'Callaghan, Computing the perceptual boundaries of dot patterns,Comput. Graphics Image Process 3 (1974), 141–162.
J. O'Rourke, Reconstruction of Orthogonal Polygons from Vertices, Technical Report JHU/EECS-85/13, Johns Hopkins University, Baltimore, MD, 1985.
J. O'Rourke, H. Booth, and R. Washington, Connect-the-Dots: A New Heuristic, Technical Report JHU/EECS-84/11, Johns Hopkins University, Baltimore, MD, 1984.
T. Pavlidis, Survey: a review of algorithms for shape analysis,Comput. Graphics Image Process.17 (1978), 243–258.
F. P. Preparata and S. J. Hong, Convex hulls of finite sets in two and three dimensions,Commun. ACM 20 (1977), 87–93.
D. Rappaport, On the Complexity of Computing Orthogonal Polygons from a Set of Points, Technical Report SOCS-86.9, McGill University, Montreal, 1986.
D. Rappaport, Computing Simple Circuits on a Set of Line Segments is NP-Complete, Technical Report SOCS-86.6, McGill University, Montreal, 1986.
D. Rappaport, H. Imai, and G. Toussaint, On computing simple circuits on a set of line segments,Proceedings of the Second ACM Symposium on Computational Geometry, 52–60, 1986.
M. I. Shamos, Geometric complexity,Proceedings of the Seventh ACM Annual Symposium on Theory of Computing, 224–233, 1975.
C. T. Zahn, Graph-theoretical methods for detecting and describing gestalt clusters,IEEE Trans. Comput. 20 (1971), 68–86.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Deneen, L., Shute, G. Polygonizations of point sets in the plane. Discrete Comput Geom 3, 77–87 (1988). https://doi.org/10.1007/BF02187898
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02187898