A point-placement strategy for conforming Delaunay tetrahedralization

Authors:
Michael Murphy;David M. Mount;Carl W. Gable
Affiliations:
Department of Computer Science, University of Maryland, College Park and Los Alamos National Laboratory;Department of Computer Science and Inst. for Advanced Computer Studies, University of Maryland, College Park;Geoanalysis Group, Earth and Environmental Science Division, Los Alamos National Laboratory
Venue:
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Year:
2000

Citing 6
Cited 12

Computational geometry: an introduction

Computational geometry: an introduction
A Delaunay refinement algorithm for quality 2-dimensional mesh generation

SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
A condition guaranteeing the existence of higher-dimensional constrained Delaunay triangulations

Proceedings of the fourteenth annual symposium on Computational geometry
Tetrahedral mesh generation by Delaunay refinement

Proceedings of the fourteenth annual symposium on Computational geometry
Sliver exudation

SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Delaunay refinement mesh generation

Delaunay refinement mesh generation

Conforming Delaunay triangulations in 3D

Proceedings of the eighteenth annual symposium on Computational geometry
Efficient strategies for adaptive 3-D mesh generation over complex orography

Neural, Parallel & Scientific Computations
Graded conforming Delaunay tetrahedralization with bounded radius-edge ratio

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Tetrahedral Mesh Generation for Environmental Problems over Complex Terrains

ICCS '02 Proceedings of the International Conference on Computational Science-Part I
Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains

Computational Geometry: Theory and Applications - Special issue on the 18th annual symposium on computational geometry—SoCG2002
Validation and Storage of Polyhedra through Constrained Delaunay Tetrahedralization

GIScience '08 Proceedings of the 5th international conference on Geographic Information Science
Techincal section: An algorithm for tetrahedral mesh generation based on conforming constrained Delaunay tetrahedralization

Computers and Graphics
Boundary recovery for Delaunay tetrahedral meshes using local topological transformations

Finite Elements in Analysis and Design
Constrained Delaunay tetrahedral mesh generation and refinement

Finite Elements in Analysis and Design
Subdividing alpha complex

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Triangulations in CGAL

Computational Geometry: Theory and Applications
Simplification of unstructured tetrahedral meshes by point sampling

VG'05 Proceedings of the Fourth Eurographics / IEEE VGTC conference on Volume Graphics

Quantified Score

Hi-index	0.00

A point-placement strategy for conforming Delaunay tetrahedralization

Quantified Score

Visualization

Abstract