{"date_published":"1993-12-01T00:00:00Z","publisher":"Springer","article_type":"original","year":"1993","day":"01","intvolume":"        10","language":[{"iso":"eng"}],"publist_id":"2084","issue":"1","oa_version":"None","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF02573974"}],"title":"An upper bound for conforming Delaunay triangulations","quality_controlled":"1","citation":{"apa":"Edelsbrunner, H., &#38; Tan, T. (1993). An upper bound for conforming Delaunay triangulations. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/BF02573974\">https://doi.org/10.1007/BF02573974</a>","ista":"Edelsbrunner H, Tan T. 1993. An upper bound for conforming Delaunay triangulations. Discrete &#38; Computational Geometry. 10(1), 197–213.","chicago":"Edelsbrunner, Herbert, and Tiow Tan. “An Upper Bound for Conforming Delaunay Triangulations.” <i>Discrete &#38; Computational Geometry</i>. Springer, 1993. <a href=\"https://doi.org/10.1007/BF02573974\">https://doi.org/10.1007/BF02573974</a>.","ieee":"H. Edelsbrunner and T. Tan, “An upper bound for conforming Delaunay triangulations,” <i>Discrete &#38; Computational Geometry</i>, vol. 10, no. 1. Springer, pp. 197–213, 1993.","ama":"Edelsbrunner H, Tan T. An upper bound for conforming Delaunay triangulations. <i>Discrete &#38; Computational Geometry</i>. 1993;10(1):197-213. doi:<a href=\"https://doi.org/10.1007/BF02573974\">10.1007/BF02573974</a>","mla":"Edelsbrunner, Herbert, and Tiow Tan. “An Upper Bound for Conforming Delaunay Triangulations.” <i>Discrete &#38; Computational Geometry</i>, vol. 10, no. 1, Springer, 1993, pp. 197–213, doi:<a href=\"https://doi.org/10.1007/BF02573974\">10.1007/BF02573974</a>.","short":"H. Edelsbrunner, T. Tan, Discrete &#38; Computational Geometry 10 (1993) 197–213."},"date_created":"2018-12-11T12:06:35Z","month":"12","article_processing_charge":"No","acknowledgement":"Research of the first author is supported by the National Science Foundation under Grant CCR-8921421 and under the Alan T. Waterman award, Grant CCR-9118874. Any opinions, findings, and conclusions or recommendations expressed in this publication are those of the authors and do not necessarily reflect the view of the National Science Foundation. Work of the second author was conducted while he was on study leave at the University of Illinois. ","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","page":"197 - 213","status":"public","publication_identifier":{"issn":["0179-5376"]},"volume":10,"date_updated":"2022-03-28T14:58:16Z","type":"journal_article","extern":"1","publication_status":"published","publication":"Discrete & Computational Geometry","abstract":[{"text":"A plane geometric graph C in ℝ2 conforms to another such graph G if each edge of G is the union of some edges of C. It is proved that, for every G with n vertices and m edges, there is a completion of a Delaunay triangulation of O(m2 n) points that conforms to G. The algorithm that constructs the points is also described.","lang":"eng"}],"author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert","full_name":"Edelsbrunner, Herbert"},{"last_name":"Tan","first_name":"Tiow","full_name":"Tan, Tiow"}],"doi":"10.1007/BF02573974","_id":"4040"}