{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T17:21:18Z","timestamp":1705944078042},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1993,2,1]],"date-time":"1993-02-01T00:00:00Z","timestamp":728524800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1993,2]]},"DOI":"10.1007\/bf01188709","type":"journal-article","created":{"date-parts":[[2005,2,17]],"date-time":"2005-02-17T17:39:58Z","timestamp":1108661998000},"page":"142-155","source":"Crossref","is-referenced-by-count":8,"title":["Duality of constrained Voronoi diagrams and Delaunay triangulations"],"prefix":"10.1007","volume":"9","author":[{"given":"Barry","family":"Joe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cao An","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J. A. Bondy","year":"1976","unstructured":"J. A. Bondy and U. S. R. Murty (1976),Graph Theory with Applications, MacMillan, London."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01553881","volume":"4","author":"L. P. Chew","year":"1989","unstructured":"L. P. Chew (1989), Constrained Delaunay triangulations,Algorithmica,4, 97?108.","journal-title":"Algorithmica"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01840357","volume":"2","author":"S. Fortune","year":"1987","unstructured":"S. Fortune (1987), A sweepline algorithm for Voronoi diagrams,Algorithmica,2, 153?174.","journal-title":"Algorithmica"},{"key":"CR4","unstructured":"B. Joe and C. A. Wang (1988), Duality and construction of constrained Voronoi diagrams and Delaunay triangulations, manuscript."},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"D. G. Kirkpatrick (1979), Efficient computation of continuous skeletons,Proc. 20th Annual Symp. on Foundations of Computer Science, pp. 18?27.","DOI":"10.1109\/SFCS.1979.15"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1137\/0210006","volume":"10","author":"D. T. Lee","year":"1981","unstructured":"D. T. Lee and R. L. Drysdale (1981), Generalization of Voronoi diagrams in the plane,SIAM J. Comput.,10, 73?87.","journal-title":"SIAM J. Comput."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF02187695","volume":"1","author":"D. T. Lee","year":"1986","unstructured":"D. T. Lee and A. K. Lin (1986), Generalized Delaunay triangulation for planar graphs,Discrete Comput. Geom.,1, 201?217.","journal-title":"Discrete Comput. Geom."},{"key":"CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry, An Introduction","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata and M. I. Shamos (1985),Computational Geometry, An Introduction, Springer-Verlag, New York."},{"key":"CR9","unstructured":"R. Seidel (1988), Constrained Delaunay triangulations and Voronoi diagrams with obstacles (extended abstract), Rep. 260, IIG TU, Graz, pp. 178?191."},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"C. A. Wang and L. K. Schubert (1987), An optimal algorithm for constructing the Delaunay triangulation of a set of line segments,Proc. 3rd ACM Symp. on Computational Geometry, pp. 223?232.","DOI":"10.1145\/41958.41982"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02187890","volume":"2","author":"C. K. Yap","year":"1987","unstructured":"C. K. Yap (1987), AnO(n logn) algorithm for the Voronoi diagram of a set of simple curve segments,Discrete Comput. Geom.,2, 365?393.","journal-title":"Discrete Comput. Geom."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01188709.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01188709\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01188709","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T12:41:47Z","timestamp":1556714507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01188709"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,2]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,2]]}},"alternative-id":["BF01188709"],"URL":"https:\/\/doi.org\/10.1007\/bf01188709","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,2]]}}}