Box-trees and R-trees with near-optimal query time

doi:10.1145/378583.378645

Box-trees and R-trees with near-optimal query time

Full Text:

PDF

Buy this Article

Authors:	Pankaj K. Agarwal	Center for Geometric Computing, Department of Computer Science, Box 90129 Duke University, Durham, NC
	Mark de Berg	Institute of Information, and Computing Sciences, Utrecht University, PO Box 80089, 3508 TB Utrecht, The Netherlands
	Joachim Gudmundsson	Institute of Information, and Computing Sciences, Utrecht University, POBox 80089, 3508 TB Utrecht, The Netherlands
	Mikael Hammar	Department of Computer Science, Lund University, Box 118, 221 00 Lund, Sweden
	Herman J. Haverkort	Institute of Information, and Computing Sciences, Utrecht University, PO Box 80089, 3508 TB Utrecht, The Netherlands

	2001 Article
Bibliometrics
· Downloads (6 Weeks): 3 · Downloads (12 Months): 37 · Downloads (cumulative): 546 · Citation Count: 12

Published in:

	· Proceeding
	SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
	Pages 124-133 ACM New York, NY, USA ©2001 table of contents ISBN:1-58113-357-X doi>10.1145/378583.378645

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref
Upcoming Conference:
- SoCG '13

Tags: general nonnumerical algorithms and problems theory verification

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player