An O(n2log n) time algorithm for the MinMax angle triangulation

Authors:
Herbert Edelsbrunner;Tiow Seng Tan;Roman Waupotitsch
Affiliations:
Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, Illinois;Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, Illnois;Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, Illnois
Venue:
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Year:
1990

Citing 6
Cited 8

Computational geometry: an introduction

Computational geometry: an introduction
Algorithms in combinatorial geometry

Algorithms in combinatorial geometry
A heuristic triangulation algorithm

Journal of Algorithms
Primitives for the manipulation of general subdivisions and the computation of Voronoi

ACM Transactions on Graphics (TOG)
Piecewise Quadratic Approximations on Triangles

ACM Transactions on Mathematical Software (TOMS)
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms

Polynomial-size nonobtuse triangulation of polygons

SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Approximating the minimum weight triangulation

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
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
Solid Modeling and Beyond

IEEE Computer Graphics and Applications
The NP-completeness column

ACM Transactions on Algorithms (TALG)
Eliminating contour line artefacts by using constrained edges

Computers & Geosciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that a triangulation of a set of n points in the plane that minimizes the maximum angle can be computed in time O(n2 log n) and space O(n). In the same amount of time and space we can also handle the constrained case where edges are prescribed. The algorithm iteratively improves an arbitrary initial triangulation and is fairly easy to implement.