{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T06:39:11Z","timestamp":1717483151897},"reference-count":23,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3766,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0925-7721(02)00129-3","type":"journal-article","created":{"date-parts":[[2003,2,28]],"date-time":"2003-02-28T14:00:13Z","timestamp":1046440813000},"page":"35-49","source":"Crossref","is-referenced-by-count":3,"title":["Optimal and suboptimal robust algorithms for proximity graphs"],"prefix":"10.1016","volume":"25","author":[{"given":"Ferran","family":"Hurtado","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henk","family":"Meijer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(02)00129-3_BIB001","series-title":"ACM Symposium on Computational Geometry","first-page":"96","article-title":"Implementations of the LMT heuristic for minimum weight triangulation","author":"Beirouti","year":"1998"},{"issue":"5","key":"10.1016\/S0925-7721(02)00129-3_BIB002","doi-asserted-by":"crossref","first-page":"1401","DOI":"10.1137\/S0097539797329373","article-title":"Robust plane sweep for intersecting segments","volume":"29","author":"Boissonnat","year":"2000","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/S0925-7721(02)00129-3_BIB003","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0925-7721(99)00057-7","article-title":"Efficient algorithms for line and curve segment intersection using restricted predicates","volume":"16","author":"Boissonnat","year":"2000","journal-title":"Computational Geometry"},{"issue":"4","key":"10.1016\/S0925-7721(02)00129-3_BIB004","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0925-7721(00)00012-2","article-title":"Reporting curve segment intersections using restricted predicates","volume":"16","author":"Chan","year":"2000","journal-title":"Computational Geometry"},{"key":"10.1016\/S0925-7721(02)00129-3_BIB005","series-title":"Algorithms-ESA '98","first-page":"175","article-title":"A robust region approach to the computation of geometric graphs","volume":"1461","author":"D'Amore","year":"1998"},{"key":"10.1016\/S0925-7721(02)00129-3_BIB006","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0022-0000(89)90038-X","article-title":"Topologically sweeping an arrangement","volume":"38","author":"Edelsbrunner","year":"1989","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/S0925-7721(02)00129-3_BIB007","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1109\/TIT.1983.1056714","article-title":"On the shape of a set of points in the plane","volume":"IT-29","author":"Edelsbrunner","year":"1983","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0925-7721(02)00129-3_BIB008","doi-asserted-by":"crossref","first-page":"259","DOI":"10.2307\/2412323","article-title":"A new statistical approach to geographic variation analysis","volume":"18","author":"Gabriel","year":"1969","journal-title":"Systematic Zoology"},{"issue":"2","key":"10.1016\/S0925-7721(02)00129-3_BIB009","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/282918.282923","article-title":"Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams","volume":"4","author":"Guibas","year":"1985","journal-title":"ACM Trans. Graph."},{"issue":"9","key":"10.1016\/S0925-7721(02)00129-3_BIB010","doi-asserted-by":"crossref","first-page":"1502","DOI":"10.1109\/5.163414","article-title":"Relative neighborhood graphs and their relatives","volume":"80","author":"Jaromczyk","year":"1992","journal-title":"Proc. IEEE"},{"key":"10.1016\/S0925-7721(02)00129-3_BIB011","unstructured":"J.W. Jaromczyk, M. Kowaluk, F. Yao, An optimal algorithm for constructing \u03b2-skeletons in lp metric, Manuscript, 1989"},{"issue":"1","key":"10.1016\/S0925-7721(02)00129-3_BIB012","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1145\/99902.99905","article-title":"Efficient Delaunay triangulations using rational arithmetic","volume":"10","author":"Karasick","year":"1991","journal-title":"ACM Trans. Graph."},{"key":"10.1016\/S0925-7721(02)00129-3_BIB013","series-title":"Computational Geometry","first-page":"217","article-title":"A framework for computational morphology","author":"Kirkpatrick","year":"1985"},{"key":"10.1016\/S0925-7721(02)00129-3_BIB014","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0925-7721(94)90018-3","article-title":"A linear-time construction of the relative neighborhood graph from the Delaunay triangulation","volume":"4","author":"Lingas","year":"1994","journal-title":"Computational Geometry"},{"key":"10.1016\/S0925-7721(02)00129-3_BIB015","series-title":"Proceeding 10th Canadian Conference on Computational Geometry","first-page":"106","article-title":"A note on checking proximity graphs","author":"Liotta","year":"1998"},{"issue":"3","key":"10.1016\/S0925-7721(02)00129-3_BIB016","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1137\/S0097539796305365","article-title":"Robust proximity queries: An illustration of degree-driven algorithm design","volume":"28","author":"Liotta","year":"1998","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/S0925-7721(02)00129-3_BIB017","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1111\/j.1538-4632.1980.tb00031.x","article-title":"Properties of Gabriel graphs relevant to geographic variation research and clustering of points in the plane","volume":"12","author":"Matula","year":"1980","journal-title":"Geogr. Anal."},{"key":"10.1016\/S0925-7721(02)00129-3_BIB018","series-title":"Proc. 4th Annu. ACM Sympos. Comput. Geom.","first-page":"164","article-title":"New methods for computing visibility graphs","author":"Overmars","year":"1988"},{"key":"10.1016\/S0925-7721(02)00129-3_BIB019","series-title":"Computational Morphology","first-page":"105","article-title":"On the shape of a set of points","author":"Radke","year":"1988"},{"key":"10.1016\/S0925-7721(02)00129-3_BIB020","series-title":"Proc. 8th Annu. Int. Symp. on Algorithms and Computation","first-page":"374","article-title":"Fast algorithm for computing \u03b2-skeletons and their relatives","volume":"1350","author":"Rao","year":"1997"},{"key":"10.1016\/S0925-7721(02)00129-3_BIB021","series-title":"Proc. 12th Canad. Conf. Comput. Geom.","first-page":"91","article-title":"Efficient algorithms for computing the \u03b2-spectrum","author":"Rao","year":"2000"},{"issue":"3","key":"10.1016\/S0925-7721(02)00129-3_BIB022","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1145\/2402.322386","article-title":"The relative neighborhood graph with an application to minimum spanning trees","volume":"30","author":"Supowit","year":"1983","journal-title":"J. ACM"},{"issue":"4","key":"10.1016\/S0925-7721(02)00129-3_BIB023","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0925-7721(92)90003-B","article-title":"The \u03b3-neighborhood graph","volume":"1","author":"Veltkamp","year":"1992","journal-title":"Computational Geometry"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772102001293?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772102001293?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T11:52:49Z","timestamp":1553687569000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772102001293"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0925772102001293"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(02)00129-3","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}