{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T22:20:50Z","timestamp":1766269250488},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1988,3,1]],"date-time":"1988-03-01T00:00:00Z","timestamp":573177600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[1988,3]]},"DOI":"10.1007\/bf02187898","type":"journal-article","created":{"date-parts":[[2005,10,29]],"date-time":"2005-10-29T04:11:50Z","timestamp":1130559110000},"page":"77-87","source":"Crossref","is-referenced-by-count":11,"title":["Polygonizations of point sets in the plane"],"prefix":"10.1007","volume":"3","author":[{"given":"Linda","family":"Deneen","sequence":"first","affiliation":[]},{"given":"Gary","family":"Shute","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1988,3,1]]},"reference":[{"key":"BF02187898_CR1","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1109\/TPAMI.1982.4767255","volume":"4","author":"N. Ahuja","year":"1982","unstructured":"N. Ahuja, Dot pattern processing using Voronoi neighborhoods,IEEE Trans. PAMI 4 (1982), 336\u2013343.","journal-title":"IEEE Trans. PAMI"},{"key":"BF02187898_CR2","doi-asserted-by":"crossref","unstructured":"B. M. Chazelle, Filtering search: a new approach to query-answering,Proceedings of the 24th IEEE Annual Symposium on Foundations of Computer Science, 217\u2013225, 1983.","DOI":"10.1109\/SFCS.1983.17"},{"key":"BF02187898_CR3","doi-asserted-by":"crossref","unstructured":"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\u2013225, 1983.","DOI":"10.1109\/SFCS.1983.75"},{"key":"BF02187898_CR4","doi-asserted-by":"crossref","unstructured":"F. D\u00e9vai, Quadratic bounds for hidden-line elimination,Proceedings of the Second Symposium on Computational Geometry, 269\u2013275, 1986.","DOI":"10.1145\/10515.10544"},{"key":"BF02187898_CR5","doi-asserted-by":"crossref","unstructured":"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\u201391, 1983.","DOI":"10.1109\/SFCS.1983.11"},{"key":"BF02187898_CR6","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0020-0190(72)90045-2","volume":"1","author":"R. L. Graham","year":"1972","unstructured":"R. L. Graham, An efficient algorithm for determining the convex hull of a finite planar set,Inform. Process. Lett. 1 (1972), 132\u2013133.","journal-title":"Inform. Process. Lett."},{"key":"BF02187898_CR7","volume-title":"Convex Polytopes","author":"B. Gr\u00fcnbaum","year":"1967","unstructured":"B. Gr\u00fcnbaum,Convex Polytopes, Interscience, London, 1967."},{"key":"BF02187898_CR8","doi-asserted-by":"crossref","unstructured":"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\u2013234, 1983.","DOI":"10.1145\/800061.808751"},{"key":"BF02187898_CR9","doi-asserted-by":"crossref","unstructured":"R. B. Hayward, A lower bound for the optimal crossing-free Hamiltonian cycle problem,Discrete Comput. Geom., to appear.","DOI":"10.1007\/BF02187887"},{"key":"BF02187898_CR10","volume-title":"The Art of Computer Programming, Vol. 1","author":"D. E. Knuth","year":"1973","unstructured":"D. E. Knuth,The Art of Computer Programming, Vol. 1, Addison-Wesley, Reading, MA, 1973."},{"key":"BF02187898_CR11","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(78)90051-8","volume":"7","author":"D. E. Muller","year":"1978","unstructured":"D. E. Muller and F. P. Preparata, Finding the intersection of two convex polyhedra,Theoret. Compute. Sci. 7 (1978), 217\u2013236.","journal-title":"Theoret. Compute. Sci."},{"key":"BF02187898_CR12","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1145\/358656.358681","volume":"25","author":"J. Nievergelt","year":"1982","unstructured":"J. Nievergelt and F. P. Preparata, Plane-sweep algorithms for intersecting geometric figures,Comm. ACM,25 (1982), 739\u2013747.","journal-title":"Comm. ACM"},{"key":"BF02187898_CR13","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0146-664X(74)80004-3","volume":"3","author":"J. F. O'Callaghan","year":"1974","unstructured":"J. F. O'Callaghan, Computing the perceptual boundaries of dot patterns,Comput. Graphics Image Process 3 (1974), 141\u2013162.","journal-title":"Comput. Graphics Image Process"},{"key":"BF02187898_CR14","series-title":"Technical Report","volume-title":"Reconstruction of Orthogonal Polygons from Vertices","author":"J. O'Rourke","year":"1985","unstructured":"J. O'Rourke, Reconstruction of Orthogonal Polygons from Vertices, Technical Report JHU\/EECS-85\/13, Johns Hopkins University, Baltimore, MD, 1985."},{"key":"BF02187898_CR15","series-title":"Technical Report","volume-title":"Connect-the-Dots: A New Heuristic","author":"J. O'Rourke","year":"1984","unstructured":"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."},{"key":"BF02187898_CR16","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0146-664X(78)90115-6","volume":"17","author":"T. Pavlidis","year":"1978","unstructured":"T. Pavlidis, Survey: a review of algorithms for shape analysis,Comput. Graphics Image Process.17 (1978), 243\u2013258.","journal-title":"Comput. Graphics Image Process"},{"key":"BF02187898_CR17","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1145\/359423.359430","volume":"20","author":"F. P. Preparata","year":"1977","unstructured":"F. P. Preparata and S. J. Hong, Convex hulls of finite sets in two and three dimensions,Commun. ACM 20 (1977), 87\u201393.","journal-title":"Commun. ACM"},{"key":"BF02187898_CR18","series-title":"Technical Report","volume-title":"On the Complexity of Computing Orthogonal Polygons from a Set of Points","author":"D. Rappaport","year":"1986","unstructured":"D. Rappaport, On the Complexity of Computing Orthogonal Polygons from a Set of Points, Technical Report SOCS-86.9, McGill University, Montreal, 1986."},{"key":"BF02187898_CR19","series-title":"Technical Report","volume-title":"Computing Simple Circuits on a Set of Line Segments is NP-Complete","author":"D. Rappaport","year":"1986","unstructured":"D. Rappaport, Computing Simple Circuits on a Set of Line Segments is NP-Complete, Technical Report SOCS-86.6, McGill University, Montreal, 1986."},{"key":"BF02187898_CR20","doi-asserted-by":"crossref","unstructured":"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\u201360, 1986.","DOI":"10.1145\/10515.10521"},{"key":"BF02187898_CR21","doi-asserted-by":"crossref","unstructured":"M. I. Shamos, Geometric complexity,Proceedings of the Seventh ACM Annual Symposium on Theory of Computing, 224\u2013233, 1975.","DOI":"10.1145\/800116.803772"},{"key":"BF02187898_CR22","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/T-C.1971.223083","volume":"20","author":"C. T. Zahn","year":"1971","unstructured":"C. T. Zahn, Graph-theoretical methods for detecting and describing gestalt clusters,IEEE Trans. Comput. 20 (1971), 68\u201386.","journal-title":"IEEE Trans. Comput."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02187898.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02187898\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02187898","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T13:22:36Z","timestamp":1557840156000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02187898"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,3]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,3]]}},"alternative-id":["BF02187898"],"URL":"https:\/\/doi.org\/10.1007\/bf02187898","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,3]]}}}