A data modeling abstraction for describing triangular mesh algorithms

DOI10.1007/BF02510177zbMath0939.65025MaRDI QIDQ678220

R. Bruce Simpson

Publication date: 16 April 1997

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

algorithmsunstructured meshesDelaunay triangulationplanar triangular meshes

Mathematics Subject Classification ID

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

Related Items (1)

2D and 3D finite element meshing and remeshing

Cites Work

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

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