Back to Results
First PageMeta Content
Mathematics / Delaunay triangulation / Tetrahedron / Simplex / Simplicial complex / Convex hull / Planar straight-line graph / Triangulated irregular network / Point location / Geometry / Triangulation / Topology


CCCG 2004, Montreal, Quebec, August 9–11, 2004 Using Bistellar Flips for Rotations in Point Location Structures 
Add to Reading List

Document Date: 2004-08-23 15:27:23

Open Document

File Size: 86,79 KB

Share Result on Facebook

City

Montreal / /

Company

VERTEX / Goodrich / /

Currency

USD / /

/

Facility

ıt Hudson Gary Miller Carnegie Mellon University / /

IndustryTerm

machinery / mesh refinement algorithms / search tree / rotation algorithm / binary search tree / balanced binary search trees / elegant solution / balanced binary search tree / search data / /

MarketIndex

case 45 / /

Organization

Benoˆıt Hudson Gary Miller Carnegie Mellon University Pittsburgh / National Science Foundation / American Mathematical Society / Aladdin Center / /

Person

Gary Miller Carnegie / /

ProvinceOrState

Quebec / /

PublishedMedium

Journal of the American Mathematical Society / /

Technology

3 The algorithm / rotation algorithm / Delaunay mesh refinement algorithms / rotation-based algorithm / /

URL

www.cs.cmu.edu / www.cccg.ca / www.aladdin.cmu.edu / /

SocialTag