Please use this identifier to cite or link to this item:
|Title:||An optimal bound for high-quality conforming triangulations|
|Citation:||Tan, T.-S. (1996-03). An optimal bound for high-quality conforming triangulations. Discrete and Computational Geometry 15 (2) : 169-193. ScholarBank@NUS Repository.|
|Abstract:||This paper shows that, for any plane geometric graph with G n vertices, there is a triangulation τ that conforms to G, i.e., each edge of G is the union of some edges of τ, where τ has O(n2) vertices with each angle of its triangles measuring no more than 11/15π. Additionally, τ can be computed in O(n2 log n) time.|
|Source Title:||Discrete and Computational Geometry|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 18, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.