Search Sciweavers | Sciweavers

3 search results - page 1 / 1

» The Strange Complexity of Constrained Delaunay Triangulation

click to vote

CCCG
2003

126views Computational Geometry» more CCCG 2003»

The Strange Complexity of Constrained Delaunay Triangulation

13 years 5 months ago

Download www.cs.berkeley.edu

The problem of determining whether a polyhedron has a constrained Delaunay tetrahedralization is NP-complete. However, if no ﬁve vertices of the polyhedron lie on a common spher...

Nicolas Grislain, Jonathan Richard Shewchuk

claim paper

Read More »

click to vote

DCG
2008

118views more DCG 2008»

General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties

13 years 4 months ago

Download www.cs.berkeley.edu

Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for interpolation and mesh generation because they respect the shapes of planar domai...

Jonathan Richard Shewchuk

claim paper

Read More »

click to vote

COMPGEOM
2003
ACM

106views Discrete Geometry» more COMPGEOM 2003»

Updating and constructing constrained delaunay and constrained regular triangulations by flips

13 years 9 months ago

Download www.cs.berkeley.edu

I discuss algorithms based on bistellar ﬂips for inserting and deleting constraining (d − 1)-facets in d-dimensional constrained Delaunay triangulations (CDTs) and weighted CD...

Jonathan Richard Shewchuk

claim paper

Read More »

« Prev « First page 1 / 1 Last » Next »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers