Back to Results
First PageMeta Content
Deltahedra / Platonic solids / Polyhedra / Elementary geometry / Polyhedron / Circumscribed sphere / Tetrahedron / Delaunay triangulation / Icosahedron / Geometry / Euclidean geometry / Convex geometry


CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 The Strange Complexity of Constrained Delaunay Triangulation Jonathan Richard Shewchuk Computer Science Division University of California at Berkeley
Add to Reading List

Document Date: 2004-01-08 18:44:34

Open Document

File Size: 110,66 KB

Share Result on Facebook

City

Halifax / New York / /

Company

SIAM Journal / Sandia National Laboratories / /

Country

France / /

/

Event

Person Communication and Meetings / /

Facility

Constrained Delaunay Triangulation Jonathan Richard Shewchuk Computer Science Division University of California at Berkeley Berkeley / University of California at Berkeley / /

IndustryTerm

polynomial-time algorithm / refinement algorithms / polynomial-time solution / /

Organization

University of California / Ecole Normale Sup´erieure de Lyon Lyon / Okawa Foundation / National Science Foundation / Association for Computing Machinery / /

Person

Nicolas Grislain / Jonathan Richard Shewchuk / Raimund Seidel / Jim Ruppert / Ernst Peter / Herbert Edelsbrunner / Shayne Waldron / /

/

Position

first author / /

ProvinceOrState

Nova Scotia / California / New York / /

PublishedMedium

Mathematische Annalen / ACM Transactions on Graphics / /

Technology

Sweep Algorithms / Simulation / Delaunay refinement algorithms / polynomial-time algorithm / /

SocialTag