An optimal bound for conforming quality triangulations: (extended abstract)

Authors:
Tiow-Seng Tan
Affiliations:
Department of Information Systems & Computer Science, National University of Singapore, Lower Kent Ridge, Singapore 0511
Venue:
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Year:
1994

Citing 9
Cited 0

Shape reconstruction from planar cross sections

Computer Vision, Graphics, and Image Processing
An O(n2logn) time algorithm for the minmax angle triangulation

SIAM Journal on Scientific and Statistical Computing
Coping with inconsistencies: a new approach to produce quality triangulations of polygonal domains with holes

SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Triangulating polygons without large angles

SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Decompositions of polyhedra in three dimensions

Decompositions of polyhedra in three dimensions
Mesh generation with provable quality bounds

Mesh generation with provable quality bounds
Optimal two-dimensional triangulations

Optimal two-dimensional triangulations
Linear-size nonobtuse triangulation of polygons

SCG '94 Proceedings of the tenth annual symposium on Computational geometry
A new and simple algorithm for quality 2-dimensional mesh generation

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms

Quantified Score

Hi-index	0.00

Visualization

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)&pgr;. Additionally, T can be computed in O(n2logn) time. The quadratic bound on the size of its vertex set is within a constant factor of worst case optimal.