Delpsc: a delaunay mesher for piecewise smooth complexes

Authors:
Tamal K. Dey;Joshua A. Levine
Affiliations:
The Ohio State University, Columbus, OH, USA;The Ohio State University, Columbus, OH, USA
Venue:
Proceedings of the twenty-fourth annual symposium on Computational geometry
Year:
2008

Citing 5
Cited 1

A Delaunay refinement algorithm for quality 2-dimensional mesh generation

SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
Tetrahedral mesh generation by Delaunay refinement

Proceedings of the fourteenth annual symposium on Computational geometry
Sampling and meshing a surface with guaranteed topology and geometry

SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Provably good sampling and meshing of surfaces

Graphical Models - Solid modeling theory and applications
Delaunay refinement for piecewise smooth complexes

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms

Technical Section: Variational implicit surface meshing

Computers and Graphics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This video presents the working of a new algorithm/software called DelPSC that meshes piecewise smooth complexes in three dimensions with Delaunay simplices. Piecewise smooth complexes admit a large class of geometric domains including polyhedra, smooth and piecewise smooth surfaces with or without boundary, and non-manifolds. The algorithm and its proof of correctness are described in the paper [7].