Computing Acute and Non-obtuse Triangulations

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 triangulation of the domain such that all angles are less than (or less than or equal to) π/2. This leads to the first software to compute such triangulations.

• Type: Conference
• Year: 2007
• Where: CCCG
• Authors: Hale Erten, Alper Üngör
• Keywords: CCCG 2007, Computational Geometry, Compute, Dimensional Domain, Planar Straight Line