Back to Results
First PageMeta Content
Computer programming / 3D computer graphics / Bin / K-d tree / Bounding volume hierarchy / Bounding volume / Interval tree / Decision tree model / Spatial database / R-tree / Computing / Data management


Box-Trees and R-trees with Near-Optimal Query Time P. K. Agarwaly , M. de Bergz , J. Gudmundssonz, M. Hammarx , H. J. Haverkortz y Dept. of Computer Science, Box 90129, Duke University, Durham, NC, USA, panka
Add to Reading List

Document Date: 2006-04-25 01:39:06

Open Document

File Size: 186,74 KB

Share Result on Facebook

Country

Sweden / United States / Netherlands / /

/

Facility

Duke University / Institute of Information / Lund University / Utrecht University / /

IndustryTerm

database applications / priority search tree / box-tree construction algorithms / conversion algorithms / /

Organization

National Science Foundation / Utrecht University / Institute of Information and Computing Sciences / Lund University / Organization for Scientific Research / U.S.-Israeli Binational Science Foundation / Duke University / Durham / /

Position

representative / /

ProgrammingLanguage

R / /

ProvinceOrState

North Carolina / /

Technology

box-tree construction algorithms / conversion algorithms / /

SocialTag