Back to Results
First PageMeta Content
Binary trees / Segment tree / Collision detection / K-d tree / R-tree / Algorithm / Range tree / Selection algorithm / Interval tree / Graph theory / Computational geometry / Computing


Document Date: 2011-09-25 11:32:07

Open Document

File Size: 546,93 KB

Share Result on Facebook

City

Durham / /

Company

World Scientific / /

Country

United States / /

Facility

Duke University / University of Illinois / /

IndustryTerm

faster algorithm / surface modification algorithms / approximate median finding algorithm / all-pairs algorithm / divide-and-conquer algorithm / binary search / natural algorithm / axis-aligned bounding box algorithms / balanced binary search tree / surface modeling software product / hybrid algorithm / search paths / above algorithm / excellent testing tool / binary search tree / volume algorithms / /

Organization

Duke University / FAST SOFTWARE FOR BOX INTERSECTIONS∗ AFRA ZOMORODIAN Department of Computer Science / University of Illinois / Center for Simulation of Advanced Rockets / U.S. Department of Energy / National Science Foundation / HERBERT EDELSBRUNNER Department of Computer Science / /

Person

HERBERT EDELSBRUNNER / AFRA ZOMORODIAN / /

Position

Editor / second author / /

Product

ApproxMedian / /

ProvinceOrState

Illinois / North Carolina / /

Technology

faster algorithm / above algorithm / ApproxMedian algorithm / Enclosing volume algorithms / median-of-three algorithm / hybrid algorithm / hybridization / The algorithm / Simulation / all-pairs algorithm / axis-aligned bounding box algorithms / surface modification algorithms / approximate median finding algorithm / divide-and-conquer algorithm / /

SocialTag