Delaunay triangulation of arbitrarily shaped planar domains

DOI10.1016/0167-8396(91)90028-AzbMath0743.65110OpenAlexW1979362696MaRDI QIDQ1183535

Renato Perucchio, Nickolas S. Sapidis

Publication date: 28 June 1992

Published in: Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8396(91)90028-a

zbMATH Keywords

discretizationtriangulationcomparison of methodsdiscrete modelscomputational geometrysolid modelingcurved boundariesVoronoi neighborhooddomain Delaunay triangulationfinite element meshingnode insertionnonmanifold domains

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)

Related Items

Point placement algorithms for Delaunay triangulation of polygonal domains ⋮ Combining recursive spatial decompositions and domain Delaunay tetrahedrizations for meshing arbitrarily shaped curved solid models ⋮ A novel model of conforming Delaunay triangulation for sensor network configuration ⋮ Automatic triangular mesh generation of trimmed parametric surfaces for finite element analysis ⋮ Automatic generation of transitional meshes ⋮ An upper bound for conforming Delaunay triangulations ⋮ Approximating constrained tetrahedrizations ⋮ 2D and 3D finite element meshing and remeshing

Cites Work

• Unnamed Item
• Unnamed Item
• Properties of \(n\)-dimensional triangulations
• Finite element mesh generation methods: A review and classification
• Advanced techniques for automatic finite element meshing from solid models
• Delaunay-based representation of surfaces defined over arbitrarily shaped domains
• Automatic mesh generation from solid models based on recursive spatial decompositions
• An apporach to automatic three-dimensional finite element mesh generation
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• Selective refinement: A new strategy for automatic node placement in graded triangular meshes
• Geometry-based fully automatic mesh generation and the delaunay triangulation
• A Two-Dimensional Mesh Verification Algorithm
• A generic Delaunay triangulation algorithm for finite element meshes