Polynomial-size nonobtuse triangulation of polygons

Authors:
Marshall Bern;David Eppstein
Affiliations:
Xerox Palo Alto Research Center, 3333 Coyote Hill Rd., Palo Alto, CA;Department of Information and Computer Science, University of California, Irvine, CA
Venue:
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Year:
1991

Constrained Delaunay triangulations

SCG '87 Proceedings of the third annual symposium on Computational geometry
Nonobtuse triangulation of polygons

Discrete & Computational Geometry
Globally-Equiangular triangulations of co-circular points in 0(n log n) time

SCG '88 Proceedings of the fourth annual symposium on Computational geometry
An O(n2log n) time algorithm for the MinMax angle triangulation

SCG '90 Proceedings of the sixth annual symposium on Computational geometry

An upper bound for conforming Delaunay triangulations

SCG '92 Proceedings of the eighth annual symposium on Computational geometry
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
Provably good mesh generation

Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Best-Case Results for Nearest-Neighbor Learning

IEEE Transactions on Pattern Analysis and Machine Intelligence

Hi-index	0.00