Almost Regular Triangulations of Trimmend NURBS-Solids

An algorithm for constructing triangulations of three-dimensional trimmed NURBS-solids is described. Ideally, such triangulations consist entirely of congruent tetrahedra with nearly equal edges. The new feature of this method is that the position of the vertices is adjusted before any connecting edges are assigned. This leads to grids with very few irregular vertices, i.e. most interior vertices are shared by 24 tetrahedra, as for regular tessellations of R 3 with congruent tetrahedra.

Similar content being viewed by others

On nontriangulable polyhedra

Article 29 May 2015

Hamiltonian tetrahedralizations with Steiner points

Article 25 November 2015

Delaunay and Regular Triangulations as Lexicographic Optimal Chains

Article 16 May 2023

Author information

Authors and Affiliations

1. Department of Mathematics A, University of Stuttgart, Stuttgart, Germany, , , , , , DE

   Alexander Fuchs

Authors

1. Alexander Fuchs
   View author publications

   You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fuchs, A. Almost Regular Triangulations of Trimmend NURBS-Solids. EWC 17, 55–65 (2001). https://doi.org/10.1007/PL00007195

Download citation

• Issue Date: May 2001

• DOI: https://doi.org/10.1007/PL00007195

• Keywords:Almost regularity; Delaunay tetrahedra; NURBS-Solids; Tessellation of R 3