83 search results - page 1 / 17 » Acute Triangulations of Polygons |
EJC
2002
13 years 10 months ago
2002
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 sur...
CCCG
2007
14 years 10 days ago
2007
We propose a method for computing acute (non-obtuse) triangulations. That is, for a given two dimensional domain (a set of points or a planar straight line graph), we compute a tr...
JCO
2010
13 years 9 months ago
2010
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in tria...
CCCG
2003
14 years 8 days ago
2003
Given a convex polygon in the plane, we are interested in triangulations of its interior, i.e. maximal sets of nonintersecting diagonals that subdivide the interior of the polygon...
COMGEO
2004
ACM
13 years 10 months ago
2004
ACM
We show it is possible to tile three-dimensional space using only tetrahedra with acute dihedral angles. We present several constructions to achieve this, including one in which a...