Please use this identifier to cite or link to this item:
|Title:||Optimal bound for conforming quality triangulations|
|Citation:||Tan, Tiow-Seng (1994). Optimal bound for conforming quality triangulations. Proceedings of the Annual Symposium on Computational Geometry : 240-249. ScholarBank@NUS Repository.|
|Abstract:||This paper shows that for any plane geometric graph G with n vertices, there exists a triangulation T conforms to G, i.e. each edge of G is the union of some edges of T, where T has O(n2) vertices with angles of its triangles measuring no more than 11/15 π. Additionally, T can be computed in O(n2 log n) time. The quadratic bound on the size of its vertex set is within a constant factor of worst case optimal.|
|Source Title:||Proceedings of the Annual Symposium on 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 Nov 9, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.