Delaunay meshing of piecewise smooth complexes without expensive predicates

Tamal K. Dey; Joshua A. Levine

doi:10.3390/a2041327

Delaunay meshing of piecewise smooth complexes without expensive predicates

Tamal K. Dey
, Joshua A. Levine

Research output: Contribution to journal › Article › peer-review

34 Scopus citations

Abstract

Recently a Delaunay refinement algorithm has been proposed that can mesh piecewise smooth complexes which include polyhedra, smooth and piecewise smooth surfaces, and non-manifolds. However, this algorithm employs domain dependent numerical predicates, some of which could be computationally expensive and hard to implement. In this paper we develop a refinement strategy that eliminates these complicated domain dependent predicates. As a result we obtain a meshing algorithm that is practical and implementation-friendly.

Original language	English (US)
Pages (from-to)	1327-1349
Number of pages	23
Journal	Algorithms
Volume	2
Issue number	4
DOIs	https://doi.org/10.3390/a2041327
State	Published - Dec 2009
Externally published	Yes

Keywords

Delaunay refinement
Mesh generation
Non-manifoldness
Non-smoothness
Piecewise-smooth complexes

ASJC Scopus subject areas

Theoretical Computer Science
Numerical Analysis
Computational Theory and Mathematics
Computational Mathematics

Access to Document

10.3390/a2041327

Cite this

@article{5aecaa8db3fd43fb8a2915853b4bce43,

title = "Delaunay meshing of piecewise smooth complexes without expensive predicates",

abstract = "Recently a Delaunay refinement algorithm has been proposed that can mesh piecewise smooth complexes which include polyhedra, smooth and piecewise smooth surfaces, and non-manifolds. However, this algorithm employs domain dependent numerical predicates, some of which could be computationally expensive and hard to implement. In this paper we develop a refinement strategy that eliminates these complicated domain dependent predicates. As a result we obtain a meshing algorithm that is practical and implementation-friendly.",

keywords = "Delaunay refinement, Mesh generation, Non-manifoldness, Non-smoothness, Piecewise-smooth complexes",

author = "Dey, \{Tamal K.\} and Levine, \{Joshua A.\}",

year = "2009",

month = dec,

doi = "10.3390/a2041327",

language = "English (US)",

volume = "2",

pages = "1327--1349",

journal = "Algorithms",

issn = "1999-4893",

publisher = "Multidisciplinary Digital Publishing Institute (MDPI)",

number = "4",

}

TY - JOUR

T1 - Delaunay meshing of piecewise smooth complexes without expensive predicates

AU - Dey, Tamal K.

AU - Levine, Joshua A.

PY - 2009/12

Y1 - 2009/12

N2 - Recently a Delaunay refinement algorithm has been proposed that can mesh piecewise smooth complexes which include polyhedra, smooth and piecewise smooth surfaces, and non-manifolds. However, this algorithm employs domain dependent numerical predicates, some of which could be computationally expensive and hard to implement. In this paper we develop a refinement strategy that eliminates these complicated domain dependent predicates. As a result we obtain a meshing algorithm that is practical and implementation-friendly.

AB - Recently a Delaunay refinement algorithm has been proposed that can mesh piecewise smooth complexes which include polyhedra, smooth and piecewise smooth surfaces, and non-manifolds. However, this algorithm employs domain dependent numerical predicates, some of which could be computationally expensive and hard to implement. In this paper we develop a refinement strategy that eliminates these complicated domain dependent predicates. As a result we obtain a meshing algorithm that is practical and implementation-friendly.

KW - Delaunay refinement

KW - Mesh generation

KW - Non-manifoldness

KW - Non-smoothness

KW - Piecewise-smooth complexes

UR - https://www.scopus.com/pages/publications/77956375993

UR - https://www.scopus.com/pages/publications/77956375993#tab=citedBy

U2 - 10.3390/a2041327

DO - 10.3390/a2041327

M3 - Article

AN - SCOPUS:77956375993

SN - 1999-4893

VL - 2

SP - 1327

EP - 1349

JO - Algorithms

JF - Algorithms

IS - 4

ER -

Delaunay meshing of piecewise smooth complexes without expensive predicates

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this