Acute and nonobtuse triangulations of polyhedral surfaces
نویسنده
چکیده
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. © 2008 Elsevier Ltd. All rights reserved.
منابع مشابه
Nonrealizable Minimal Vertex Triangulations of Surfaces: Showing Nonrealizability Using Oriented Matroids and Satisfiability Solvers
We show that no minimal vertex triangulation of a closed, connected, orientable 2-manifold of genus 6 admits a polyhedral embedding in R. We also provide examples of minimal vertex triangulations of closed, connected, orientable 2-manifolds of genus 5 that do not admit any polyhedral embeddings. We construct a new infinite family of non-realizable triangulations of surfaces. These results were ...
متن کاملNonobtuse Triangulations of PSLGs
We show that any planar PSLG with n vertices has a conforming triangulation by O(n) nonobtuse triangles, answering the question of whether a polynomial bound exists. The triangles may be chosen to be all acute or all right. A nonobtuse triangulation is Delaunay, so this result improves a previous O(n) bound of Eldesbrunner and Tan for conforming Delaunay triangulations. In the special case that...
متن کاملAutomatic construction of quality nonobtuse boundary Delaunay triangulations
In this paper we discuss the automatic construction of quality nonobtuse boundary Delaunay triangulations of polygons such as needed for control volume or nite element method applications. These are Delaunay triangulations whose smallest angles are bounded and, in addition, whose boundary triangles do not have obtuse angles opposite to any boundary or interface edge. The method we propose in th...
متن کاملStrategies for Nonobtuse Boundary Delaunay Triangulations
Delaunay Triangulations with nonobtuse triangles at the boundaries satisfy a minimal requirement for Control Volume meshes. We motivate this quality requirement, discuss it in context with others that have been proposed, and give point placement strategies that generate the fewest or close to the fewest number of Steiner points needed to satisfy it for a particular problem instance. The advanta...
متن کاملTiling space and slabs with acute tetrahedra
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 all dihedral angles are less than 77.08◦, and another which tiles a slab in space. 1 Problem definition Triangulations of two and three-dimensional domains find numerious applications in scientific computing, computer g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Eur. J. Comb.
دوره 30 شماره
صفحات -
تاریخ انتشار 2009