{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:59:52Z","timestamp":1725494392285},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540423065"},{"type":"electronic","value":"9783540477389"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-47738-1_19","type":"book-chapter","created":{"date-parts":[[2007,11,6]],"date-time":"2007-11-06T17:52:49Z","timestamp":1194371569000},"page":"205-216","source":"Crossref","is-referenced-by-count":0,"title":["The construction of Delaunay diagrams by lob reduction"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Kauffmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Claude","family":"Spehner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,9,20]]},"reference":[{"key":"19_CR1","unstructured":"B. Adam, M. Elbaz, and J.-C. Spehner. Construction du diagramme de Delaunay dans le plan en utilisant les m\u00e9langes de tris. In Actes 4\u00e8me Journ\u00e9es AFIG, pages 215\u2013223, 1996."},{"issue":"6","key":"19_CR2","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/BF02187749","volume":"4","author":"A. Aggarwal","year":"1989","unstructured":"A. Aggarwal, Leonidas J. Guibas, J. Saxe, and P. W. Shor. A linear-time algorithm for computing the Voronoi diagram of a convex polygon. Discrete Comput. Geom., 4(6):591\u2013604, 1989.","journal-title":"Discrete Comput. Geom."},{"key":"19_CR3","volume-title":"Report TR 3270","author":"J.-D. Boissonnat","year":"1997","unstructured":"J.-D. Boissonnat and F. P. Preparata. Robust plane sweep for interesting segments. Report TR 3270, INRIA, Sophia Antipolis, September 1997."},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01553881","volume":"4","author":"L. P. Chew","year":"1989","unstructured":"L. P. Chew. Constrained Delaunay triangulations. Algorithmica, 4:97\u2013108, 1989.","journal-title":"Algorithmica"},{"key":"19_CR5","first-page":"793","volume":"7","author":"B. Delaunay","year":"1934","unstructured":"B. Delaunay, Sur la sph\u00e8re vide. Bull. Acad. Sci. USSR: Class. Sci. Math. Nat., 7:793\u2013800, 1934.","journal-title":"Bull. Acad. Sci. USSR: Class. Sci. Math. Nat."},{"key":"19_CR6","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in Combinatorial Geometry","author":"H. Edelsbrunner","year":"1987","unstructured":"H. Edelsbrunner. Algorithms in Combinatorial Geometry, volume 10 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Heidelberg, West Germany, 1987."},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF01840357","volume":"2","author":"S. J. Fortune","year":"1987","unstructured":"S. J. Fortune. A sweepline algorithm for Voronoi diagrams. Algorithmica, 2:153\u2013174, 1987.","journal-title":"Algorithmica"},{"key":"19_CR8","series-title":"Lecture Notes Series on Computing","first-page":"225","volume-title":"Computing in Euclidean Geometry","author":"S. Fortune","year":"1992","unstructured":"S. Fortune. Voronoi diagrams and Delaunay triangulations. In D.-Z. Du and F. K. Hwang, editors, Computing in Euclidean Geometry, volume 4 of Lecture Notes Series on Computing, pages 225\u2013265. World Scientific, Singapore, 2nd edition, 1992.","edition":"2nd edition"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/PL00009464","volume":"22","author":"F. Hurtado","year":"1999","unstructured":"F. Hurtado, M. Noy, and J. Urrutia. Flipping edges in triangulations. Discrete Comput Geom, 22:333\u2013346, 1999.","journal-title":"Discrete Comput Geom"},{"key":"19_CR10","volume-title":"La construction du diagramme de Delaunay par balayage dans le plan et ses applications","author":"P. Kauffmann","year":"1999","unstructured":"P. Kauffmann. La construction du diagramme de Delaunay par balayage dans le plan et ses applications. Ph.D. thesis, Universit\u00e9 de Haute-Alsace, Mulhouse, France, 1999."},{"key":"19_CR11","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/B978-0-12-587260-7.50011-X","volume-title":"Math. Software III","author":"C. L. Lawson","year":"1977","unstructured":"C. L. Lawson. Software for C\n                           1 surface interpolation. In J. R. Rice, editor, Math. Software III, pages 161\u2013194. Academic Press, New York, NY, 1977."},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF02187695","volume":"1","author":"D. T. Lee","year":"1986","unstructured":"D. T. Lee and A. K. Lin. Generalized Delaunay triangulation for planar graphs. Discrete Comput. Geom., 1:201\u2013217, 1986.","journal-title":"Discrete Comput. Geom."},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"M. I. Shamos and D. Hoey. Closest-point problems. In Proc. 16th Annu. IEEE Sympos. Found. Comput. Sci., pages 151\u2013162, 1975.","DOI":"10.1109\/SFCS.1975.8"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/PL00009407","volume":"5","author":"D. Schmitt","year":"1999","unstructured":"D. Schmitt and J.-C. Spehner. Angular properties of Delaunay diagrams in any dimension. Discrete Comput. Geom., 5:17\u201336, 1999.","journal-title":"Discrete Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Discrete and Computational Geometry"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47738-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T21:07:58Z","timestamp":1551042478000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47738-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540423065","9783540477389"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-47738-1_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}