{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:21:48Z","timestamp":1725488508539},"publisher-location":"Berlin, Heidelberg","reference-count":18,"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_2","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T06:20:48Z","timestamp":1186726848000},"page":"2-13","source":"Crossref","is-referenced-by-count":0,"title":["Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs"],"prefix":"10.1007","author":[{"given":"Ferran","family":"Hurtado","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Henk","family":"Meijer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Robust proximity queries: An illustration of degree-driven algo rithm design. SI AM J. Comput., 28(3):864\u2013889, 1998.","DOI":"10.1137\/S0097539796305365"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"R. Beirouti and J. Snoeyink. Implementations of the LMT heuristic for minimum weight triangulation. In ACM Symposium on Computational Geometry, pages 96\u2013105, 1998.","DOI":"10.1145\/276884.276895"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"J.-D. Boissonnat and F. P. Preparata. Robust plane sweep for intersecting segments. SIAM J. Comput., (5):1401\u20131421, 2000.","DOI":"10.1137\/S0097539797329373"},{"issue":"1","key":"2_CR4","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0925-7721(99)00057-7","volume":"16","author":"J.-D. Boissonnat","year":"2000","unstructured":"J.-D. Boissonnat and J. Snoeyink. Efficient algorithms for line and curve segment intersection using restricted predicates. Comput. Geom. Theory Appl., 16(1):35\u201352, 2000.","journal-title":"Comput. Geom. Theory Appl."},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"T. Chan. Reporting curve segment intersections using restricted predicates. Comput. Geom. Theory Appl., 16(4), 2000.","DOI":"10.1016\/S0925-7721(00)00012-2"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"F. D\u00c1more, P. Franciosa, and G. Liotta. A robust region approach to the computation of geometric graphs. In Algortihms-ESA\u2019 98, volume 1461 of Lecture Notes Comput. Sci., pages 175\u2013186, 1998.","DOI":"10.1007\/3-540-68530-8_15"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0022-0000(89)90038-X","volume":"38","author":"H. Edelsbrunner","year":"1989","unstructured":"H. Edelsbrunner and L. J. Guibas. Topologically sweeping an arrangement. J. Comput. Syst. Sci., 38:165\u2013194, 1989. Corrigendum in 42 1991, 249\u2013251.","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"259","DOI":"10.2307\/2412323","volume":"18","author":"K. R. Gabriel","year":"1969","unstructured":"K. R. Gabriel and R. R. Sokal. A new statistical approach to geographic variation analysis. Systematic Zoology, 18:259\u2013278, 1969.","journal-title":"Systematic Zoology"},{"issue":"9","key":"2_CR9","doi-asserted-by":"crossref","first-page":"1502","DOI":"10.1109\/5.163414","volume":"80","author":"J. W. Jaromczyk","year":"1992","unstructured":"J. W. Jaromczyk and G. T. Toussaint. Relative neighborhood graphs and their relatives. Proc. IEEE, 80(9):1502\u20131517, Sept. 1992.","journal-title":"Proc. IEEE"},{"key":"2_CR10","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/B978-0-444-87806-9.50013-X","volume-title":"Computational Geometry","author":"D. G. Kirkpatrick","year":"1985","unstructured":"D. G. Kirkpatrick and J. D. Radke. A framework for computational morphology. In G. T. Toussaint, editor, Computational Geometry, pages 217\u2013248. North-Holland, Amsterdam, Netherlands, 1985."},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"A. Lingas. A linear-time construction of the relative neighborhood graph f rom the Delaunay triangulation. Comput. Geom. Theory Appl., pages 199\u2013208, 1994.","DOI":"10.1016\/0925-7721(94)90018-3"},{"issue":"3","key":"2_CR12","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1111\/j.1538-4632.1980.tb00031.x","volume":"12","author":"D. W. Matula","year":"1980","unstructured":"D. W. Matula and R. R. Sokal. Properties of Gabriel graphs relevant to geographic variation research and clustering of points in the plane. Geogr. Anal., 12(3):205\u2013222, 1980.","journal-title":"Geogr. Anal."},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"M. H. Overmars and E. Welzl. New methods for computing visibility graphs. In Proc. 4th Annu. ACM Sympos. Comput. Geom., pages 164\u2013171, 1988.","DOI":"10.1145\/73393.73410"},{"key":"2_CR14","first-page":"105","volume-title":"Computational Morphology","author":"J. D. Radke","year":"1988","unstructured":"J. D. Radke. On the shape of a set of points. In G. T. Toussaint, editor, Computational Morphology, pages 105\u2013136. North-Holland, Amsterdam, Netherlands, 1988."},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"S. V. Rao and A. Mukhopadhyay. Fast algortihm for computing \u03b2-skeletons and their relatives. In Proc. 8th Annual Int. Symp. on Algorithms and Computation, volume 1350 of Lecture Notes Comput. Sci., pages 374\u2013383, 1997.","DOI":"10.1007\/3-540-63890-3_40"},{"key":"2_CR16","unstructured":"S. V. Rao and A. Mukhopadhyay. Efficient algortihms for computing the \u03b2-spectrum. In Proc. 12th Canad. Conf. Comput. Geom., pages 91\u201397, 2000."},{"issue":"3","key":"2_CR17","first-page":"428","volume":"30","author":"K. J. Supowit","year":"1983","unstructured":"K. J. Supowit. The relative neighborhood graph with an application to minimum spanning trees. J. A CM, 30(3):428\u2013448, 1983.","journal-title":"J. A CM"},{"issue":"4","key":"2_CR18","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0925-7721(92)90003-B","volume":"1","author":"R. C. Veltkamp","year":"1992","unstructured":"R. C. Veltkamp. The \u03b3-neighborhood graph. Comput.Geom.Theory Appl., 1(4):227\u2013246, 1992.","journal-title":"Comput.Geom.Theory Appl."}],"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_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T18:12:14Z","timestamp":1556734334000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44634-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424239","9783540446347"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-44634-6_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}