{"volume":10,"date_updated":"2022-03-28T14:10:59Z","type":"journal_article","extern":"1","publication_identifier":{"issn":["0179-5376"]},"doi":"10.1007/BF02573962","author":[{"last_name":"Bern","full_name":"Bern, Marshall","first_name":"Marshall"},{"first_name":"Herbert","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Eppstein","full_name":"Eppstein, David","first_name":"David"},{"full_name":"Mitchell, Stephen","first_name":"Stephen","last_name":"Mitchell"},{"full_name":"Tan, Tiow","first_name":"Tiow","last_name":"Tan"}],"_id":"4044","publication":"Discrete & Computational Geometry","publication_status":"published","abstract":[{"text":"Edge insertion iteratively improves a triangulation of a finite point set in ℜ2 by adding a new edge, deleting old edges crossing the new edge, and retriangulating the polygonal regions on either side of the new edge. This paper presents an abstract view of the edge insertion paradigm, and then shows that it gives polynomial-time algorithms for several types of optimal triangulations, including minimizing the maximum slope of a piecewise-linear interpolating surface.","lang":"eng"}],"article_processing_charge":"No","acknowledgement":"The authors thank two anonymous referees for suggestions on improving the style of this paper. The research of the second' author was supported by the National Science Foundation under Grant No. CCR-8921421 and under the Alan T. Waterman award, Grant No. 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. Part of the work was done while the second, third, and fourth authors visited the Xerox Palo Alto Research Center,\r\nand while the fifth author was on study leave at the University of Illinois. ","citation":{"chicago":"Bern, Marshall, Herbert Edelsbrunner, David Eppstein, Stephen Mitchell, and Tiow Tan. “Edge Insertion for Optimal Triangulations.” <i>Discrete &#38; Computational Geometry</i>. Springer, 1993. <a href=\"https://doi.org/10.1007/BF02573962\">https://doi.org/10.1007/BF02573962</a>.","ista":"Bern M, Edelsbrunner H, Eppstein D, Mitchell S, Tan T. 1993. Edge insertion for optimal triangulations. Discrete &#38; Computational Geometry. 10(1), 47–65.","apa":"Bern, M., Edelsbrunner, H., Eppstein, D., Mitchell, S., &#38; Tan, T. (1993). Edge insertion for optimal triangulations. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/BF02573962\">https://doi.org/10.1007/BF02573962</a>","short":"M. Bern, H. Edelsbrunner, D. Eppstein, S. Mitchell, T. Tan, Discrete &#38; Computational Geometry 10 (1993) 47–65.","mla":"Bern, Marshall, et al. “Edge Insertion for Optimal Triangulations.” <i>Discrete &#38; Computational Geometry</i>, vol. 10, no. 1, Springer, 1993, pp. 47–65, doi:<a href=\"https://doi.org/10.1007/BF02573962\">10.1007/BF02573962</a>.","ama":"Bern M, Edelsbrunner H, Eppstein D, Mitchell S, Tan T. Edge insertion for optimal triangulations. <i>Discrete &#38; Computational Geometry</i>. 1993;10(1):47-65. doi:<a href=\"https://doi.org/10.1007/BF02573962\">10.1007/BF02573962</a>","ieee":"M. Bern, H. Edelsbrunner, D. Eppstein, S. Mitchell, and T. Tan, “Edge insertion for optimal triangulations,” <i>Discrete &#38; Computational Geometry</i>, vol. 10, no. 1. Springer, pp. 47–65, 1993."},"date_created":"2018-12-11T12:06:36Z","month":"12","page":"47 - 65","status":"public","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publist_id":"2082","intvolume":"        10","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF02573962"}],"title":"Edge insertion for optimal triangulations","scopus_import":"1","quality_controlled":"1","issue":"1","oa_version":"None","year":"1993","article_type":"original","publisher":"Springer","day":"01","date_published":"1993-12-01T00:00:00Z"}