scientific article; zbMATH DE number 853640

MaRDI QIDQ4868906zbMATH OpenFDO

Authors Yongxiang Ding

Publication date 10 March 1996

zbMATH Keywords

fast algorithmDelaunay triangulationWatson algorithm

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computer science aspects of computer-aided design (68U07)

Recommendations

• A fast algorithm for generating constrained delaunay triangulations
• Delaunay triangulation of arbitrarily shaped planar domains
• Aspects of three‐dimensional constrained Delaunay meshing

Cited in

(7)

• Delaunay triangulation of arbitrarily shaped planar domains
• Variational Delaunay approach to the generation of tetrahedral finite element meshes
• Fast centroidal Voronoi Delaunay triangulation for unstructured mesh generation
• A new mesh generation scheme for arbitrary planar domains
• Algorithms for automatic generating interior nodal points and Delaunay triangulation using advancing front technique
• Aspects of three‐dimensional constrained Delaunay meshing
• A fast algorithm for generating constrained delaunay triangulations

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4868906)