{"year":"2000","quality_controlled":"1","volume":9,"extern":"1","intvolume":"         9","date_published":"2000-03-21T00:00:00Z","oa_version":"None","acknowledgement":"Research is partially supported by the Army Research Office under grant DAAG55-98-1-0177 and by the National Science Foundation under grants CCR-96-19542 and CCR-97-12088.","publist_id":"2802","citation":{"short":"H. Edelsbrunner, Acta Numerica 9 (2000) 133–213.","mla":"Edelsbrunner, Herbert. “Triangulations and Meshes in Computational Geometry.” <i>Acta Numerica</i>, vol. 9, Cambridge University Press, 2000, pp. 133–213, doi:<a href=\"https://doi.org/10.1017/S0962492900001331\">10.1017/S0962492900001331</a>.","ieee":"H. Edelsbrunner, “Triangulations and meshes in computational geometry,” <i>Acta Numerica</i>, vol. 9. Cambridge University Press, pp. 133–213, 2000.","ista":"Edelsbrunner H. 2000. Triangulations and meshes in computational geometry. Acta Numerica. 9, 133–213.","ama":"Edelsbrunner H. Triangulations and meshes in computational geometry. <i>Acta Numerica</i>. 2000;9:133-213. doi:<a href=\"https://doi.org/10.1017/S0962492900001331\">10.1017/S0962492900001331</a>","chicago":"Edelsbrunner, Herbert. “Triangulations and Meshes in Computational Geometry.” <i>Acta Numerica</i>. Cambridge University Press, 2000. <a href=\"https://doi.org/10.1017/S0962492900001331\">https://doi.org/10.1017/S0962492900001331</a>.","apa":"Edelsbrunner, H. (2000). Triangulations and meshes in computational geometry. <i>Acta Numerica</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/S0962492900001331\">https://doi.org/10.1017/S0962492900001331</a>"},"author":[{"orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","first_name":"Herbert"}],"abstract":[{"text":"The Delaunay triangulation of a finite point set is a central theme in computational geometry. It finds its major application in the generation of meshes used in the simulation of physical processes. This paper connects the predominantly combinatorial work in classical computational geometry with the numerical interest in mesh generation. It focuses on the two- and three-dimensional case and covers results obtained during the twentieth century.","lang":"eng"}],"type":"journal_article","language":[{"iso":"eng"}],"_id":"3583","scopus_import":"1","date_created":"2018-12-11T12:04:05Z","publication":"Acta Numerica","date_updated":"2023-05-02T12:20:27Z","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","month":"03","title":"Triangulations and meshes in computational geometry","publisher":"Cambridge University Press","article_processing_charge":"No","page":"133 - 213","doi":"10.1017/S0962492900001331","status":"public","publication_status":"published","day":"21"}