Practical techniques for constructing binary space partitions for orthogonal rectangles

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Practical techniques for constructing binary space partitions for orthogonal rectangles

Full text

Pdf (718 KB)

Source

Annual Symposium on Computational Geometry archive
Proceedings of the thirteenth annual symposium on Computational geometry table of contents

Nice, France

Pages: 382 - 384

Year of Publication: 1997

ISBN:0-89791-878-9

Authors

Pankaj K. Agarwal	Center for Geometric Computing, Department of Computer Science, Duke University, Box 90129, Durham, NC
T. M. Murali	Brown University and Center for Geometric Computing, Department of Computer Science, Duke University, Box 90129, Durham, NC
Jeffrey Scott Vitter	Center for Geometric Computing, Department of Computer Science, Duke University, Box 90129, Durham, NC

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 14, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/262839.263011 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	P. K. Agarwal , E. F. Grove , T. M. Murali , J. S. Vitter, Binary space partitions for fat rectangles, Proceedings of the 37th Annual Symposium on Foundations of Computer Science, p.482, October 14-16, 1996
	2	John Milligan Airey , Frederick P. Brooks, Jr., Increasing update rates in the building walkthrough system with automatic model-space subdivision and potentially visible set calculations, 1990
	3	Henry Fuchs , Zvi M. Kedem , Bruce F. Naylor, On visible surface generation by a priori tree structures, Proceedings of the 7th annual conference on Computer graphics and interactive techniques, p.124-133, July 14-18, 1980, Seattle, Washington, United States
	4	Michael S. Paterson , F. Frances Yao, Optimal binary space partitions for orthogonal objects, Journal of Algorithms, v.13 n.1, p.99-113, March 1992 [doi>10.1016/0196-6774(92)90007-Y]
	5	R. A. Shumacker, R. Brand, M. Gilliland, and W. Sharp, Study for applying computer-generated images to visual simulation, Report AFHRL-TR-69-14, U.S. Air Force Human Resources Lab., 1969.
	6	Seth Jared Teller, Visibility computations in densely occluded polyhedral environments, University of California at Berkeley, Berkeley, CA, 1992
	7	William C. Thibault , Bruce F. Naylor, Set operations on polyhedra using binary space partitioning trees, ACM SIGGRAPH Computer Graphics, v.21 n.4, p.153-162, July 1987

CITED BY 2

	Mark de Berg , Micha Streppel, Approximate range searching using binary space partitions, Computational Geometry: Theory and Applications, v.33 n.3, p.139-151, February 2006
	Shinichi Fukushige , Hiromasa Suzuki, Voronoi diagram depth sorting for polygon visibility ordering, Proceedings of the 4th international conference on Computer graphics and interactive techniques in Australasia and Southeast Asia, November 29-December 02, 2006, Kuala Lumpur, Malaysia