{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T09:07:08Z","timestamp":1751879228009},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424239"},{"type":"electronic","value":"9783540446347"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44634-6_18","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T10:20:48Z","timestamp":1186741248000},"page":"192-204","source":"Crossref","is-referenced-by-count":2,"title":["On the Reflexivity of Point Sets"],"prefix":"10.1007","author":[{"given":"Esther M.","family":"Arkin","sequence":"first","affiliation":[]},{"given":"S\u00e1ndor P.","family":"Fekete","sequence":"additional","affiliation":[]},{"given":"Ferran","family":"Hurtado","sequence":"additional","affiliation":[]},{"given":"Joseph S. B.","family":"Mitchell","sequence":"additional","affiliation":[]},{"given":"Marc","family":"Noy","sequence":"additional","affiliation":[]},{"given":"Vera","family":"Sacrist\u00e1n","sequence":"additional","affiliation":[]},{"given":"Saurabh","family":"Sethia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1137\/0221035","volume":"21","author":"P. K. Agarwal","year":"1992","unstructured":"P. K. Agarwal. Ray shooting and other applications of spanning trees with low stabbing number. SIAM J. Comput., 21, 540\u2013570, 1992.","journal-title":"SIAM J. Comput."},{"key":"18_CR2","unstructured":"A. Aggarwal, D. Coppersmith, S. Khanna, R. Motwani, and B. Schieber. The angular-metric traveling salesman problem. In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 221\u2013229, Jan. 1997."},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1006\/gmip.1998.0465","volume":"60","author":"N. Amenta","year":"1998","unstructured":"N. Amenta, M. Bern, and D. Eppstein. The crust and the \u03b2-skeleton: Combinatorial curve reconstruction. Graphical Models and Image Processing, 60, 125\u2013135, 1998.","journal-title":"Graphical Models and Image Processing"},{"key":"18_CR4","series-title":"Ph.D. thesis","volume-title":"Computational geometry and convexity","author":"B. Chazelle","year":"1979","unstructured":"B. Chazelle. Computational geometry and convexity. Ph.D. thesis, Dept. Comput. Sci., Yale Univ., New Haven, CT, 1979. Carnegie-Mellon Univ. Report CS-80-150."},{"key":"18_CR5","unstructured":"T. K. Dey and P. Kumar. A simple provable algorithm for curve reconstruction. In Proc. 10th ACM-SIAM Sympos. Discrete Algorithms, pages 893\u2013894, Jan. 1999."},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"T. K. Dey, K. Mehlhorn, and E. A. Ramos. Curve reconstruction: Connecting dots with good reason. In Proc. 15th Annu. ACM Sympos. Comput. Geom., pages 197\u2013206, 1999.","DOI":"10.1145\/304893.304972"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/BF01840404","volume":"5","author":"D. P. Dobkin","year":"1990","unstructured":"D. P. Dobkin, H. Edelsbrunner, and M. H. Overmars. Searching for empty convex polygons. Algorithmica, 5, 561\u2013571, 1990.","journal-title":"Algorithmica"},{"key":"18_CR8","first-page":"463","volume":"2","author":"P. Erd\u0151s","year":"1935","unstructured":"P. Erd\u0151s and G. Szekeres. A combinatorial problem in geometry. Compositio Math., 2, 463\u2013470, 1935.","journal-title":"Compositio Math."},{"key":"18_CR9","first-page":"53","volume":"3\u20134","author":"P. Erd\u0151s","year":"1960","unstructured":"P. Erd\u0151s and G. Szekeres. On some extremum problem in geometry. Ann. Univ. Sci. Budapest, 3\u20134, 53\u201362, 1960.","journal-title":"Ann. Univ. Sci. Budapest"},{"key":"18_CR10","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0925-7721(96)00012-0","volume":"8","author":"S. P. Fekete","year":"1997","unstructured":"S. P. Fekete and G. J. Woeginger. Angle-restricted tours in the plane. Comp. Geom. Theory Appl., 8, 195\u2013218, 1997.","journal-title":"Comp. Geom. Theory Appl."},{"key":"18_CR11","unstructured":"A. Garc\u00fda, M. Noy, and J. Tejel. Lower bounds for the number of crossing-free subgraphs of K n. In Proc. 7th Canad. Conf. Comput. Geom., pages 97\u2013102, 1995."},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1006\/jagm.1995.1017","volume":"18","author":"J. Hershberger","year":"1995","unstructured":"J. Hershberger and S. Suri. A pedestrian approach to ray shooting: Shoot a ray, take a walk. J. Algorithms, 18, 403\u2013431, 1995.","journal-title":"J. Algorithms"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/S0019-9958(85)80044-9","volume":"64","author":"S. Hertel","year":"1985","unstructured":"S. Hertel and K. Mehlhorn. Fast triangulation of the plane with respect to simple polygons. Inf. Control, 64, 52\u201376, 1985.","journal-title":"Inf. Control"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01994880","volume":"32","author":"J. Hershberger","year":"1992","unstructured":"J. Hershberger and S. Suri. Applications of a semi-dynamic convex hull algorithm. BIT, 32, 249\u2013267, 1992.","journal-title":"BIT"},{"key":"18_CR15","doi-asserted-by":"crossref","first-page":"482","DOI":"10.4153\/CMB-1983-077-8","volume":"26","author":"J. Horton","year":"1983","unstructured":"J. Horton. Sets with no empty convex 7-gons. Canad. Math. Bull., 26, 482\u2013484, 1983.","journal-title":"Canad. Math. Bull."},{"key":"18_CR16","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/0925-7721(95)00027-5","volume":"6","author":"F. Hurtado","year":"1996","unstructured":"F. Hurtado and M. Noy. Triangulations, visibility graph and reflex vertices of a simple polygon. Comput. Geom. Theory Appl., 6, 355\u2013369, 1996.","journal-title":"Comput. Geom. Theory Appl."},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/B978-044482537-7\/50012-7","volume-title":"Handbook of Computational Geometry","author":"J. M. Keil","year":"2000","unstructured":"J. M. Keil. Polygon decomposition. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 491\u2013518. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 2000."},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D. Lichtenstein","year":"1982","unstructured":"D. Lichtenstein. Planar formulae and their uses. SIAM J. Comput., 11, 329\u2013343, 1982.","journal-title":"SIAM J. Comput."},{"key":"18_CR19","volume-title":"Technical report","author":"J. S. B. Mitchell","year":"1993","unstructured":"J. S. B. Mitchell. Approximation algorithms for geometric separation problems. Technical report, Department of Applied Mathematics, SUNY Stony Brook, NY, July 1993."},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0020-0190(95)00130-5","volume":"56","author":"J. S. B. Mitchell","year":"1995","unstructured":"J. S. B. Mitchell, G. Rote, G. Sundaram, and G. Woeginger. Counting convex polygons in planar point sets. Inform. Process. Lett., 56, 191\u2013194, 1995.","journal-title":"Inform. Process. Lett."},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"J. Pach (ed.). Discrete and Computational Geometry, 19, Special issue dedicated to Paul Erd\u00f6s, 1998.","DOI":"10.1007\/PL00009361"},{"key":"18_CR22","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0166-218X(94)00120-3","volume":"64","author":"M. Urabe","year":"1996","unstructured":"M. Urabe. On a partition into convex polygons. Discrete Appl. Math., 64, 179\u2013191, 1996.","journal-title":"Discrete Appl. Math."},{"key":"18_CR23","unstructured":"M. Urabe. On a partition of point sets into convex polygons. In Proc. 9th Canad. Conf. Comp. Geom., pages 21\u201324, 1997."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44634-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T22:12:16Z","timestamp":1556748736000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44634-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424239","9783540446347"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-44634-6_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}