{"page":"507 - 519","acknowledgement":"The research of the second author is partially supported by NSF under grant DBI-0820624 and by DARPA under grants HR011-05-1-0057 and HR0011-09-006\r\n","department":[{"_id":"HeEd"}],"issue":"7","doi":"10.1016/j.comgeo.2015.04.001","author":[{"last_name":"Cao","full_name":"Cao, Thanhtung","first_name":"Thanhtung"},{"first_name":"Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner"},{"last_name":"Tan","full_name":"Tan, Tiowseng","first_name":"Tiowseng"}],"publist_id":"5593","citation":{"chicago":"Cao, Thanhtung, Herbert Edelsbrunner, and Tiowseng Tan. “Triangulations from Topologically Correct Digital Voronoi Diagrams.” Computational Geometry. Elsevier, 2015. https://doi.org/10.1016/j.comgeo.2015.04.001.","ieee":"T. Cao, H. Edelsbrunner, and T. Tan, “Triangulations from topologically correct digital Voronoi diagrams,” Computational Geometry, vol. 48, no. 7. Elsevier, pp. 507–519, 2015.","apa":"Cao, T., Edelsbrunner, H., & Tan, T. (2015). Triangulations from topologically correct digital Voronoi diagrams. Computational Geometry. Elsevier. https://doi.org/10.1016/j.comgeo.2015.04.001","mla":"Cao, Thanhtung, et al. “Triangulations from Topologically Correct Digital Voronoi Diagrams.” Computational Geometry, vol. 48, no. 7, Elsevier, 2015, pp. 507–19, doi:10.1016/j.comgeo.2015.04.001.","ista":"Cao T, Edelsbrunner H, Tan T. 2015. Triangulations from topologically correct digital Voronoi diagrams. Computational Geometry. 48(7), 507–519.","short":"T. Cao, H. Edelsbrunner, T. Tan, Computational Geometry 48 (2015) 507–519.","ama":"Cao T, Edelsbrunner H, Tan T. Triangulations from topologically correct digital Voronoi diagrams. Computational Geometry. 2015;48(7):507-519. doi:10.1016/j.comgeo.2015.04.001"},"intvolume":" 48","_id":"1578","publication":"Computational Geometry","abstract":[{"text":"We prove that the dual of the digital Voronoi diagram constructed by flooding the plane from the data points gives a geometrically and topologically correct dual triangulation. This provides the proof of correctness for recently developed GPU algorithms that outperform traditional CPU algorithms for constructing two-dimensional Delaunay triangulations.","lang":"eng"}],"quality_controlled":"1","scopus_import":1,"date_updated":"2021-01-12T06:51:43Z","oa_version":"None","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:52:49Z","date_published":"2015-08-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","type":"journal_article","volume":48,"publisher":"Elsevier","day":"01","month":"08","status":"public","title":"Triangulations from topologically correct digital Voronoi diagrams","publication_status":"published"}