ScholarLens Back to search
2006•Journal of Engineering GraphicsRequires access

Surface Delaunay Triangulation Made from Delaunay Tetrahedralization

Qiming Chen

Open publisher page 1 citations

Abstract

A direct Delaunay triangulation algorithm is presented to meshing the surface.The approach,which is base on boundary recursive method and incremental conforming Delaunay tetrahedralization,uses the Delaunay tetrahedralization of adaptive sample point set on surface to help to build the surface Delaunay triangular mesh with the application of property of minimal minimum circumsphere.The outputted mesh satisfy the 3D Delaunay Circumsphere Claim,which guarantee the meshes quality,and is very useful for Delaunay tetrahedralization conformed to surfaces.

About this research paper

What this paper is about

A direct Delaunay triangulation algorithm is presented to meshing the surface.The approach,which is base on boundary recursive method and incremental conforming Delaunay tetrahedralization,uses the Delaunay tetrahedralization of adaptive sample point set on surface to help to build the surface Delaunay triangular mesh with the application of property of minimal minimum circumsphere.The outputted mesh satisfy the 3D Delaunay Circumsphere Claim,which guarantee the meshes quality,and is very useful for Delaunay tetrahedralization conformed to surfaces.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A direct Delaunay triangulation algorithm is presented to meshing the surface.The approach,which is base on boundary recursive method and incremental conforming Delaunay tetrahedralization,uses the Delaunay tetrahedralization of adaptive sample point set on surface to help to build the surface Delaunay triangular mesh with the application of property of minimal minimum circumsphere.The outputted mesh satisfy the 3D Delaunay Circumsphere Claim,which guarantee the meshes quality,and is very useful for Delaunay tetrahedralization conformed to surfaces.

Key concepts: Delaunay triangulation, Bowyer–Watson algorithm, Chew's second algorithm, Constrained Delaunay triangulation, Pitteway triangulation, Ruppert's algorithm, Surface triangulation, Mathematics

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Surface Delaunay Triangulation Made from Delaunay Tetrahedralization — Research Paper | ScholarLens