DelPSC: A delaunay mesher for piecewlse smooth complexes

Tamal K. Dey, Joshua A. Levine

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Scopus citations

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].

Original languageEnglish (US)
Title of host publicationProceedings of the 24th Annual Symposium on Computational Geometry 2008, SCG'08
Pages220-221
Number of pages2
DOIs
StatePublished - 2008
Externally publishedYes
Event24th Annual Symposium on Computational Geometry, SCG'08 - College Park, MD, United States
Duration: Jun 9 2008Jun 11 2008

Publication series

NameProceedings of the Annual Symposium on Computational Geometry

Conference

Conference24th Annual Symposium on Computational Geometry, SCG'08
Country/TerritoryUnited States
CityCollege Park, MD
Period6/9/086/11/08

Keywords

  • Delaunay refinement
  • Mesh generation
  • Non-manifolds
  • Non-smoothness
  • Piecewise-smooth complexes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Computational Mathematics

Fingerprint

Dive into the research topics of 'DelPSC: A delaunay mesher for piecewlse smooth complexes'. Together they form a unique fingerprint.

Cite this