Temporally coherent conservative visibility (extended abstract)

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Temporally coherent conservative visibility (extended abstract)

Full text

Pdf (1.37 MB)

Source

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

Philadelphia, Pennsylvania, United States

Pages: 78 - 87

Year of Publication: 1996

ISBN:0-89791-804-5

Authors

Satyan Coorg	Synthetic Imagery Group, MIT Laboratory for Computer Science, Cambridge, MA
Seth Teller	Synthetic Imagery Group, MIT Laboratory for Computer Science, Cambridge, MA

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): 17, Citation Count: 16

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	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/237218.237242 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	John M. Airey , John H. Rohlf , Frederick P. Brooks, Jr., Towards image realism with interactive update rates in complex virtual building environments, Proceedings of the 1990 symposium on Interactive 3D graphics, p.41-50, February 1990, Snowbird, Utah, United States
	2	Kurt Akeley, Reality Engine graphics, Proceedings of the 20th annual conference on Computer graphics and interactive techniques, p.109-116, September 1993 [doi>10.1145/166117.166131]
	3	BAUMGART, B. G. A Polyhedron Representation for Computer Vision. In Proc. AFIPS Natl. Comput. Conf. (1975), vol. 44, pp. 589-596.
	4	Jon Louis Bentley, Multidimensional binary search trees used for associative searching, Communications of the ACM, v.18 n.9, p.509-517, Sept. 1975 [doi>10.1145/361002.361007]
	5	BERN, M., DOBKIN, D., EPPSTEIN, D., AND GROSS- MAN, R. Visibility with a Moving Point of View. Algorithmica 11 (1994), 360-378.
	6	K. L. Clarkson , P. W. Shor, Applications of random sampling in computational geometry, II, Discrete & Computational Geometry, v.4 n.5, p.387-421, 1989
	7	S. Coorg , S. Teller, A Spacially and Temporally Coherent Object Space Visibility Algorithm, Massachusetts Institute of Technology, Cambridge, MA, 1996
	8	Franklin C. Crow, Shadow algorithms for computer graphics, Proceedings of the 4th annual conference on Computer graphics and interactive techniques, p.242-248, July 20-22, 1977, San Jose, California
	9	Herbert Edelsbrunner, Algorithms in combinatorial geometry, Springer-Verlag New York, Inc., New York, NY, 1987
	10	Thomas A. Funkhouser , Carlo H. Séquin , Seth J. Teller, Management of large amounts of data in interactive building walkthroughs, Proceedings of the 1992 symposium on Interactive 3D graphics, p.11-20, June 1992, Cambridge, Massachusetts, United States [doi>10.1145/147156.147158]
	11	Ziv Gigus , John Canny , Raimund Seidel, Efficiently Computing and Representing Aspect Graphs of Polyhedral Objects, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.13 n.6, p.542-551, June 1991 [doi>10.1109/34.87341 ]
	12	Z. Gigus , J. Malik, Computing the Aspect Graph for Line Drawings of Polyhedral Objects, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.12 n.2, p.113-122, February 1990 [doi>10.1109/34.44399 ]
	13	Ned Greene , Michael Kass , Gavin Miller, Hierarchical Z-buffer visibility, Proceedings of the 20th annual conference on Computer graphics and interactive techniques, p.231-238, September 1993 [doi>10.1145/166117.166147]
	14	GROVE, E., MURALI, T. M., AND VITTER, J. The Object Complexity Model for Hidden-Surface Elimination. In Proc. 7th Canad. Conf. Comput. Geom. (Quebec City, Canada, 1995), pp. 273-278.
	15	H. Hubschman , S. W. Zucker, Frame-to-frame coherence and the hidden surface computation: constraints for a convex world, ACM Transactions on Graphics (TOG), v.1 n.2, p.129-162, April 1982 [doi>10.1145/357299.357302]
	16	Michael McKenna, Worst-case optimal hidden-surface removal, ACM Transactions on Graphics (TOG), v.6 n.1, p.19-28, Jan. 1987 [doi>10.1145/27625.27627]
	17	K. Mulmuley, An efficient algorithm for hidden surface removal, ACM SIGGRAPH Computer Graphics, v.23 n.3, p.379-388, July 1989
	18	Ketan Mulmuley, Hidden surface removal with respect to a moving view point, Proceedings of the twenty-third annual ACM symposium on Theory of computing, p.512-522, May 05-08, 1991, New Orleans, Louisiana, United States [doi>10.1145/103418.103471]
	19	Harry Plantinga , Charles R. Dyer, Visibility, occlusion, and the aspect graph, International Journal of Computer Vision, v.5 n.2, p.137-160, Nov. 1990 [doi>10.1007/BF00054919]
	20	Franco P. Preparata , Michael I. Shamos, Computational geometry: an introduction, Springer-Verlag New York, Inc., New York, NY, 1985
	21	Hanan Samet, Applications of spatial data structures: Computer graphics, image processing, and GIS, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1990
	22	Ivan E. Sutherland , Robert F. Sproull , Robert A. Schumacker, A Characterization of Ten Hidden-Surface Algorithms, ACM Computing Surveys (CSUR), v.6 n.1, p.1-55, March 1974 [doi>10.1145/356625.356626]
	23	Seth J. Teller , Carlo H. Séquin, Visibility preprocessing for interactive walkthroughs, ACM SIGGRAPH Computer Graphics, v.25 n.4, p.61-70, July 1991

CITED BY 16

	Gernot Schaufler , Julie Dorsey , Xavier Decoret , François X. Sillion, Conservative volumetric visibility with occluder fusion, Proceedings of the 27th annual conference on Computer graphics and interactive techniques, p.229-238, July 2000
	Frédo Durand , George Drettakis , Claude Puech, The 3D visibility complex, ACM Transactions on Graphics (TOG), v.21 n.2, p.176-206, April 2002
	Yiorgos Chrysanthou , Daniel Cohen-Or , Eyal Zadicario, Viewspace partitioning of densely occluded scenes, Proceedings of the fourteenth annual symposium on Computational geometry, p.413-414, June 07-10, 1998, Minneapolis, Minnesota, United States
	Satyan Coorg , Seth Teller, Real-time occlusion culling for models with large occluders, Proceedings of the 1997 symposium on Interactive 3D graphics, p.83-ff., April 27-30, 1997, Providence, Rhode Island, United States
	Karsten Bormann, Occlusion Culling in Large Virtual Environments, Presence: Teleoperators and Virtual Environments, v.10 n.5, p.477-494, October 2001
	Dirk Staneker , Dirk Bartz , Wolfgang Straßer, Occlusion-driven scene sorting for efficient culling, Proceedings of the 4th international conference on Computer graphics, virtual reality, visualisation and interaction in Africa, January 25-27, 2006, Cape Town, South Africa
	Dirk Staneker , Dirk Bartz , Michael Meissner, Improving Occlusion Query Efficiency with Occupancy Maps, Proceedings of the 2003 IEEE Symposium on Parallel and Large-Data Visualization and Graphics, p.15, October 20-21, 2003
	Tommer Leyvand , Olga Sorkine , Daniel Cohen-Or, Ray space factorization for from-region visibility, ACM Transactions on Graphics (TOG), v.22 n.3, July 2003
	James T. Klosowski , Cláudio T. Silva, The Prioritized-Layered Projection Algorithm for Visible Set Estimation, IEEE Transactions on Visualization and Computer Graphics, v.6 n.2, p.108-123, April 2000
	James T. Klosowski , Cláudio T. Silva, Rendering on a budget: a framework for time-critical rendering, Proceedings of the conference on Visualization '99: celebrating ten years, p.115-122, October 1999, San Francisco, California, United States
	Samuel Madden , Thomas E. von Wiegand, TOADS: A Two-Dimensional Open-Ended Architectural Database System, Presence: Teleoperators and Virtual Environments, v.10 n.2, p.175-192, April 2001
	Vlastimil Havran , Jiří Bittner , Hans-Peter Seidel, Exploiting temporal coherence in ray casted walkthroughs, Proceedings of the 19th spring conference on Computer graphics, April 24-26, 2003, Budmerice, Slovakia
	T. Hudson , D. Manocha , J. Cohen , M. Lin , K. Hoff , H. Zhang, Accelerated occlusion culling using shadow frusta, Proceedings of the thirteenth annual symposium on Computational geometry, p.1-10, June 04-06, 1997, Nice, France
	Türker Yilmaz , Uğur Güdükbay , Varol Akman, Modeling and visualization of complex geometric environments, Geometric modeling: techniques, applications, systems and tools, Kluwer Academic Publishers, Norwell, MA, 2004
	Ioannis Pantazopoulos , Spyros Tzafestas, Occlusion Culling Algorithms: A Comprehensive Survey, Journal of Intelligent and Robotic Systems, v.35 n.2, p.123-156, October 2002
	George Baciu , Ki-Wan Kwok, Visibility culling for interactive dynamic scenes, Integrated image and graphics technologies, Kluwer Academic Publishers, Norwell, MA, 2004