Please use this identifier to cite or link to this item:
|Title:||An upper bound for conforming Delaunay triangulations||Authors:||Edelsbrunner, H.
|Issue Date:||Dec-1993||Citation:||Edelsbrunner, H., Tan, T.S. (1993-12). An upper bound for conforming Delaunay triangulations. Discrete & Computational Geometry 10 (1) : 197-213. ScholarBank@NUS Repository. https://doi.org/10.1007/BF02573974||Abstract:||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(m 2 n) points that conforms to G. The algorithm that constructs the points is also described. © 1993 Springer-Verlag New York Inc.||Source Title:||Discrete & Computational Geometry||URI:||http://scholarbank.nus.edu.sg/handle/10635/99187||ISSN:||01795376||DOI:||10.1007/BF02573974|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.