Back to Results
First PageMeta Content
Computing / 3D computer graphics / Binary space partitioning / Arrangement of hyperplanes / K-d tree / Space partitioning / Hyperplane / Binary search tree / Collision detection / Geometry / Mathematics / Binary trees


Constructing Good Partitioning Trees Bruce Naylor AT&T Bell Laboratories Murray Hill, NJ ABSTRACT
Add to Reading List

Document Date: 2008-11-05 15:24:04

Open Document

File Size: 153,50 KB

Share Result on Facebook

Company

SIAM Journal / AT&T / /

Facility

Georgia Institute of Technology / University of Texas / U.S. Air Force Human Resources Laboratory / /

IndustryTerm

geometric search structure / recursive algorithm / ordered search / spatial search operations / binary search trees / tree algorithms / search structures / real-time graphics systems / spatial search structure / search structure / /

Organization

School of Information and Computer Science / U.S. Air Force Human Resources Laboratory / Georgia Institute of Technology / Atlanta / University of Texas at Dallas / /

Person

Ivan Sutherland / Eric Torres / Rabin / Jeffery Goldsmith / Greg Turk / Franco P. Preparata / John L. Bentley / Insung Ihm / Murray Hill / John Salmon / Michael Ian Shamos / Ray Tracing / John Amanatides / William C. Thibault / Timothy L. Kay / Bruce F. Naylor / James T. Kajiya / /

Position

model the segment / Traveling Salesman / General / /

ProgrammingLanguage

R / /

ProvinceOrState

Texas / Indiana / Georgia / /

PublishedMedium

SIAM Journal on Computing / /

Technology

partitioning tree algorithms / Binary Space Partition Algorithm / machine learning / Simulation / CAT / /

SocialTag