Back to Results
First PageMeta Content
Topology / Pseudotriangle / Binary space partitioning / Convex hull / Collision detection / Steiner tree problem / Orientability / Leonidas J. Guibas / Delaunay triangulation / Geometry / Triangulation / Mathematics


Lower Bounds For Kinetic Planar Subdivisions Pankaj K. Agarwaly Julien Baschz Mark de Bergx John Hershbergerk
Add to Reading List

Document Date: 2011-12-02 14:30:54

Open Document

File Size: 210,14 KB

Share Result on Facebook

City

Boca Raton / Providence / Bern / Durham / Wilsonville / /

Company

CRC Press LLC / AMS Press / Mentor Graphics Corp. / /

Country

Netherlands / /

/

Facility

Duke University / Utrecht University / Stanford University / University of London / Air Force Human Resources Laboratory / /

IndustryTerm

worst case processing time / kinetic solutions / static algorithm / worst-case processing cost / binary search trees / binary space partition algorithm / high processing cost / coherence-sensitive algorithms / /

Organization

Duke University / U.S. Air Force Human Resources Laboratory / Center for Geometric Computing / National Science Foundation / Department of Computer Science / United States Army / Stanford University / U.S.Israeli Binational Science Foundation / Utrecht University / Computer Science Department / University of London / /

Person

Addison Wesley / Leonidas J. Guibas / Mark de Bergx John / Julien Baschz Mark de Bergx / Pankaj K. Agarwaly Julien Baschz / Mary / /

/

Position

Queen / /

ProvinceOrState

Rhode Island / Florida / North Carolina / California / Oregon / /

SportsLeague

Stanford University / /

Technology

static algorithm / virtual reality / binary space partition algorithm / simulation / Animation / /

SocialTag