A data modeling abstraction for describing triangular mesh algorithms

DOI10.1007/BF02510177MaRDI QIDQ678220zbMATH OpenFDO

Authors R. Bruce Simpson

Publication date 16 April 1997

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02510177

zbMATH Keywords

algorithmsDelaunay triangulationunstructured meshesplanar triangular meshes

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• An algorithm oriented mesh database
• Delaunay refinement algorithms for triangular mesh generation
• scientific article; zbMATH DE number 437532

Cites work

• scientific article; zbMATH DE number 3854346 (Why is no real title available?)
• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 3963224 (Why is no real title available?)
• scientific article; zbMATH DE number 53893 (Why is no real title available?)
• scientific article; zbMATH DE number 3513332 (Why is no real title available?)
• scientific article; zbMATH DE number 3584897 (Why is no real title available?)
• scientific article; zbMATH DE number 3633698 (Why is no real title available?)
• A Constrained Two-Dimensional Triangulation and the Solution of Closest Node Problems in the Presence of Barriers
• A Two-Dimensional Mesh Verification Algorithm
• A dynamic hierarchical subdivision algorithm for computing Delaunay triangulations and other closest-point problems
• A framework for advancing front techniques of finite element mesh generation
• A storage-efficient method for construction of a Thiessen triangulation
• Automatic generation of triangular grid: I—subdivision of a general polygon into convex subregions. II—triangulation of convex polygons
• Automatic three-dimensional mesh generation by the modified-octree technique
• Automatic triangulation of arbitrary planar domains for the finite element method
• Corrections to Lee's visibility polygon algorithm
• Delaunay Triangular Meshes in Convex Polygons
• Design of an Adaptive, Parallel Finite-Element System
• Extracting adjacency relationships from a modular boundary model
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• Three-Dimensional Triangulations from Local Transformations
• Triangulation of planar regions with applications
• Two algorithms for constructing a Delaunay triangulation

Cited in

(4)

• scientific article; zbMATH DE number 36761 (Why is no real title available?)
• An algorithm oriented mesh database
• An auto-partition algorithm for the triangular mesh model
• 2D and 3D finite element meshing and remeshing. A bibliography (1990-2001)

This page was built for publication: A data modeling abstraction for describing triangular mesh algorithms

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