Bucket-like space partitioning data structures with applications to ray-tracing

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Bucket-like space partitioning data structures with applications to ray-tracing

Full text

Pdf (1.43 MB)

Source

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

Nice, France

Pages: 11 - 20

Year of Publication: 1997

ISBN:0-89791-878-9

Authors

F. Cazals	iMAGIS/GRAVIR-IMAG, BP 53 - 38041 Grenoble cedex 09, France
C. Puech	iMAGIS/GRAVIR-IMAG, BP 53 - 38041 Grenoble cedex 09, France

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): 12, Downloads (12 Months): 36, Citation Count: 6

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.262851 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.

	A+94	D.S. Andrews et al. Further comparison algorithms for geometric intersection problems. In 6th International Symposium on Spatial Data Handling, 1994.
	AEII85	T. Asano, M. Edahiro, H. Imai, and M. Iri. Practical use of bucketing techniques in computational geometry. In G.T. Toussaint, editor, Computational Geometry. Elsevier, 1985.
	Caz97	F. Cazals. Combinatorial properties of onedimensional arrangements. Experimental Mathematics, 6(1), 1997.
	CDP95	F. Cazals, G. Drettakis, and C. Puech. Filtering, clustering and hierarchy construction: a new solution for ray-tracing complex scenes. In EG'95, Maastricht, 1995.
	CS97	F. Cazals and M. Sbert. Some integral geometry tools to estimate the complexity of 3d scenes. In preparation, 1997.
	dB+96	M. de Berg et al. Computational geometry by example. Stanford University Press, draft version, 1996.
	Dev86	Luc Devroye, Lecture Notes on Bucket Algorithms, Birkhauser Boston, 1986
	Dev88	O. Devillers. Mdthodes d'optimisation du tracd de rayon. PhD Thesis- Universit# Paris Sud, 1988.
	GLM96	S. Gottschalk , M. C. Lin , D. Manocha, OBBTree: a hierarchical structure for rapid interference detection, Proceedings of the 23rd annual conference on Computer graphics and interactive techniques, p.171-180, August 1996 [doi>10.1145/237170.237244]
	Hai96	E. Haines. Personal communication. 1996.
	JdL92	Erik Jansen and Win de Leeuw. Recursive ray traversal. Ray Tracing News (available at nic.funet.fi:/pub/graphics/misc/RTNews), 5(1), 1992.
	KS97	Krzysztof S. Klimaszewski , Thomas W. Sederberg, Faster Ray Tracing Using Adaptive Grids, IEEE Computer Graphics and Applications, v.17 n.1, p.42-51, January 1997 [doi>10.1109/38.576857]
	IBWY80	Jon Louis Bentley , Bruce W. Weide , Andrew C. Yao, Optimal Expected-Time Algorithms for Closest Point Problems, ACM Transactions on Mathematical Software (TOMS), v.6 n.4, p.563-580, Dec. 1980 [doi>10.1145/355921.355927]
	MMS94	Joseph S. B. Mitchell , David M. Mount , Subhash Suri, Query-sensitive ray shooting, Proceedings of the tenth annual symposium on Computational geometry, p.359-368, June 06-08, 1994, Stony Brook, New York, United States [doi>10.1145/177424.178094]
	NH84	J. Nievergelt , Hans Hinterberger , Kenneth C. Sevcik, The Grid File: An Adaptable, Symmetric Multikey File Structure, ACM Transactions on Database Systems (TODS), v.9 n.1, p.38-71, March 1984 [doi>10.1145/348.318586]
	O'R94	Joseph O'Rourke, Computational geometry in C, Cambridge University Press, New York, NY, 1994
	PS85	Franco P. Preparata , Michael I. Shamos, Computational geometry: an introduction, Springer-Verlag New York, Inc., New York, NY, 1985
	S76	L. S~ntalo. Integral geometry and geometric probability. Addison-Wesley, 1976.
	Sbe93	M. Sbert. An integral geometry based method for fast form-factor computation. Computer Graphics Forum - Eurographics'93, 12(3), 1993.
	SD95a	Fraņois Sillion , George Drettakis, Feature-based control of visibility error: a multi-resolution clustering algorithm for global illumination, Proceedings of the 22nd annual conference on Computer graphics and interactive techniques, p.145-152, September 1995 [doi>10.1145/218380.218434]
	SD95b	Peter Su , Robert L. Scot Drysdale, A comparison of sequential Delaunay triangulation algorithms, Proceedings of the eleventh annual symposium on Computational geometry, p.61-70, June 05-07, 1995, Vancouver, British Columbia, Canada [doi>10.1145/220279.220286]
	Wu92	Xiaolin Wu, A linear-time simple bounding volume algorithm, Graphics Gems III, Academic Press Professional, Inc., San Diego, CA, 1992

CITED BY 6

	F. Cazals, Effective nearest neighbors searching on the hyper-cube, with applications to molecular clustering, Proceedings of the fourteenth annual symposium on Computational geometry, p.222-230, June 07-10, 1998, Minneapolis, Minnesota, United States
	Boris Aronov , Hervé Brönnimann , Allen Y. Chang , Yi-Jen Chiang, Cost prediction for ray shooting, Proceedings of the eighteenth annual symposium on Computational geometry, p.293-302, June 05-07, 2002, Barcelona, Spain
	Eric Ferley , Marie-Paule Cani , Jean-Dominique Gascuel, Resolution adaptive volume sculpting, Graphical Models, v.63 n.6, p.459-478, November 2001
	Boris Aronov , Hervé Brönnimann , Allen Y. Chang , Yi-Jen Chiang, Cost prediction for ray shooting in octrees, Computational Geometry: Theory and Applications, v.34 n.3, p.159-181, July 2006
	Hervé Brönnimann , Marc Glisse, Octrees with near optimal cost for ray-shooting, Computational Geometry: Theory and Applications, v.34 n.3, p.182-194, July 2006
	Nir Goldschmidt , Dan Gordon, The BOXEL framework for 2.5D data with applications to virtual drivethroughs and ray tracing, Computational Geometry: Theory and Applications, v.41 n.3, p.167-187, November, 2008