Acute Triangulations of Polygons

13 years 10 months ago

Download web.mit.edu

In this paper, we prove the existence of acute triangulations for general polyhedral surfaces. We also show how to obtain nonobtuse subtriangulations of triangulated polyhedral surfaces.

Hiroshi Maehara

Real-time Traffic

Acute Triangulations | EJC 2002 | General Polyhedral | Information Technology | Surfaces |

claim paper

Related Content

» Computing Acute and Nonobtuse Triangulations

» An almost fourapproximation algorithm for maximum weight triangulation

» An algorithm for the MaxMin area triangulation of a convex polygon

» Tiling space and slabs with acute tetrahedra

» PolynomialSize Nonobtuse Triangulation of Polygons

» An efficient upper bound of the rotation distance of binary trees

» Decomposing a Simple Polygon into Trapezoids

» All triangulations are reachable via sequences of edgeflips an elementary proof

» Polygon Decomposition for Efficient Construction of Minkowski Sums

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2002
Where	EJC
Authors	Hiroshi Maehara

Comments (0)

Sciweavers

Acute Triangulations of Polygons

Acute Triangulations | EJC 2002 | General Polyhedral | Information Technology | Surfaces |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers