Article

Interactive visibility ordering and transparency computations among geometric primitives in complex environments

Authors:

Naga K. Govindaraju,

Michael Henson,

Dinesh ManochaAuthors Info & Claims

I3D '05: Proceedings of the 2005 symposium on Interactive 3D graphics and games

Pages 49 - 56

https://doi.org/10.1145/1053427.1053435

Published: 03 April 2005 Publication History

Abstract

We describe a novel algorithm for visibility ordering among non-overlapping geometric objects in complex and dynamic environments. Our algorithm rearranges the objects in a back-to-front or a front-to-back order from a given viewpoint. We perform comparisons between the primitives by using occlusion queries on the GPUs and exploit frame to frame coherence to reduce the number of occlusion queries. Our visibility ordering algorithm requires no preprocessing and is applicable to all kind of models, including polygon soups and deformable models. We have used our algorithm for order-independent transparency computations in high-depth complexity environments and performing N-body collision culling in dynamic environments. We have implemented our algorithm on a PC with a 3.4 GHz Pentium IV CPU with a NVIDIA GeForce FX 6800 Ultra GPU and applied it to complex environments with tens or hundreds of thousands of polygons. Our algorithm can compute a visibility ordering among the objects and triangles at interactive frame rates.

References

[1]

Aila, T., Miettinen, V., and Nordlund, P. 2003. Delay streams for graphics hardware. ACM Trans. on Graphics 22, 792--800.

Digital Library

[2]

Callahan, S. P., Ikits, M., Comba, J., and Silva, C. 2005. Hardware-assisted visibility sorting for unstructured volume rendering. IEEE Trans. on Visualization and Computer Graphics. to appear.

Digital Library

[3]

Carpenter, L. 1984. The A-buffer, an antialiased hidden surface method. In Computer Graphics (SIGGRAPH '84 Proceedings), H. Christiansen, Ed., vol. 18, 103--108.

Digital Library

[4]

Cignoni, P., C. Montani, and Scopigno, R. 1998. Tetrahedra based volume visualization. In Mathematical Visualization - Algorithms, Applications and Numerics, 3--18.

[5]

Cohen, J., Lin, M., Manocha, D., and Ponamgi, M. 1995. I-COLLIDE: An interactive and exact collision detection system for large-scale environments. In Proc. of ACM Interactive 3D Graphics Conference, 189--196.

Digital Library

[6]

Cohen-Or, D., Chrysanthou, Y., Durand, F., Greene, N., Koltun, V., and Silva, C. 2001. Visibility, problems, techniques and applications. SIGGRAPH Course Notes # 30.

[7]

Cook, R., Max, N., Silva, C., and Williams, P. 2004. Image-space visibility ordering for cell projection volume rendering of unstructured data. IEEE Trans. on Visualization and Computer Graphics.

Digital Library

[8]

De Berg, M., Overmars, M., and Schwarzkopf, O. 1994. Computing and verifying depth orders. In sicomp, 437--446.

Digital Library

[9]

Diefenbach, P. 1996. Multi-pass pipeline rendering: Interaction and realism through hardware provisions. PhD thesis, University of Pennsylvania.

Digital Library

[10]

Estivill-Castro, V., and Wood, D. 1992. A survey of adaptive sorting agorithms. ACM Computing Surveys.

Digital Library

[11]

Everitt, C. 2001. Interactive order-independent transparency. Technical report, NVIDIA. http://developer.nvidia.com/object/Interactive_Order_Transparency.html.

[12]

Fuchs, H., Kedem, Z., and Naylor, B. 1980. On visible surface generation by a priori tree structures. Proc. of ACM SIGGRAPH 14, 3, 124--133.

Digital Library

[13]

Govindaraju, N., Redon, S., Lin, M., and Manocha, D. 2003. CULLIDE: Interactive collision detection between complex models in large environments using graphics hardware. Proc. of ACM SIGGRAPH/Eurographics Workshop on Graphics Hardware, 25--32.

Digital Library

[14]

Govindaraju, N., Lin, M., and Manocha, D. 2004. Fast and reliable collision detection using graphics hardware. Proc. of ACM VRST.

Digital Library

[15]

Govindaraju, N., Lin, M., and Manocha, D. 2004. Vis-sort: Fast visibility ordering of 3-d geometric primitives. Tech. rep., Department of Computer Science, University of North Carolina.

[16]

Govindaraju, N., Raghuvanshi, N., and Manocha, D. 2004. Fast and approximate stream mining of quantiles and frequencies using graphics processors. Tech. rep., University of North Carolina at Chapel Hill.

[17]

Jouppe, N. P., and Chang, C. F. 1999. An economical hardware technique for high-quality antialiasing and transparency. ACM SIGGRAPH/Eurographics Workshop on Graphics Hardware, 85--93.

Digital Library

[18]

Knuth, D. E. 1973. Sorting and Searching, vol. 3 of The Art of Computer Programming. Addison-Wesley, Reading, MA.

Digital Library

[19]

Krishnan, S., Silva, C., and Wei, B. 2001. A Hardware-Assisted Visibility-Ordering algorithm with applications to volume rendering. In Proc. of Data Visualization, 233--242.

Digital Library

[20]

Mammen, A. 1989. Transparency and antialiasing algorithms implemented with the virtual pixel maps technique. IEEE Computer Graphics and Applications 9, 4 (July), 43--55.

Digital Library

[21]

Max, N. L., and Lerner, D. M. 1985. A two-and-a-half-D motion-blur algorithm. In Computer Graphics (SIGGRAPH '85 Proceedings), vol. 19, 85--93.

Digital Library

[22]

Max, N. L. 1993. Sorting for polyhedron compositing. Focus on Scientific Visualization, 259--268.

Digital Library

[23]

Molnar, S., Eyles, J., and Poulton, J. 1992. PixelFlow: High-speed rendering using image composition. In Computer Graphics (SIGGRAPH '92 Proceedings), E. E. Catmull, Ed., vol. 26, 231--240.

Digital Library

[24]

Newell, M. E., Newell, R. G., and Sancha, T. L. 1972. A solution to the hidden surface problem. In Proc. ACM Nat. Mtg.

Digital Library

[25]

Przemyslaw, R. 1993. Fast genration of depth of field effects in computer graphics. Computer and Graphics 17, 5, 593--595.

[26]

Purcell, T., Donner, C., Cammarano, M., Jensen, H., and Hanrahan, P. 2003. Photon mapping on programmable graphics hardware. ACM SIGGRAPH/Eurographics Conference on Graphics Hardware, 41--50.

Digital Library

[27]

Schumacker, R., Brand, B., Gilliland, M., and Sharp, W. 1969. Study for applying computer-generated images to visual generation. Tech. rep., AFHRL-TR-69-74, US Air Force Human Resources Lab.

[28]

Silva, C. T., Mitchell, J. S. B., and Williams, P. L. 1998. An exact interactive time visibility ordering algorithm for polyhedral cell complexes. In IEEE Symposium on Volume Visualization, 87--94.

Digital Library

[29]

Snyder, J., and Lengyel, J. 1998. Visibility sorting and compositing without splitting for image layer decompositions. Proc. of ACM SIGGRAPH.

Digital Library

[30]

Sudarsky, O., and Gotsman, C. 1996. Output sensitive visibility algorithms for dynamic scenes with applications to virtual reality. Computer Graphics Forum 15, 3, 249--58. Proc. of Eurographics '96.

[31]

Sutherland, I. E., Sproull, R. F., and Schumacker, R. A. 1973. Sorting and the hidden-surface problem. In Conf. Proc. Natl. Computer Conf.

[32]

Torres, E. 1990. Optimization of the binary space partition algorithm (BSP) for the visualization of dynamic scenes. In Eurographics '90, North-Holland, C. E. Vandoni and D. A. Duce, Eds., 507--518.

[33]

Williams, P. L. 1992. Visibility-ordering meshed polyhedra. ACM Trans. on Graphics 11, 2, 103--126.

Digital Library

[34]

Wittenbrink, C. 2001. R-buffer: A pointerless a-buffer hardware architecture. ACM SIGGRAPH/Eurographics Workshop on Graphics Hardware, 73--80.

Digital Library

Cited By

Trapp MDumke FDöllner J(2019)Occlusion Management Techniques for the Visualization of Transportation Networks in Virtual 3D City ModelsProceedings of the 12th International Symposium on Visual Information Communication and Interaction10.1145/3356422.3356445(1-8)Online publication date: 20-Sep-2019
https://dl.acm.org/doi/10.1145/3356422.3356445
de Lucas EMarcuello PParcerisa JGonzalez A(2019)Visibility Rendering OrderIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2018.286624630:2(473-485)Online publication date: 1-Feb-2019
https://dl.acm.org/doi/10.1109/TPDS.2018.2866246
Anglada Mde Lucas EParcerisa JAragon JGonzalez A(2019)Early Visibility Resolution for Removing Ineffectual Computations in the Graphics Pipeline2019 IEEE International Symposium on High Performance Computer Architecture (HPCA)10.1109/HPCA.2019.00015(635-646)Online publication date: Mar-2019
https://doi.org/10.1109/HPCA.2019.00015
Show More Cited By

Index Terms

Interactive visibility ordering and transparency computations among geometric primitives in complex environments
1. Computing methodologies
  1. Computer graphics
2. Theory of computation
  1. Randomness, geometry and discrete structures

Recommendations

Multi-fragment effects on the GPU using the k-buffer
I3D '07: Proceedings of the 2007 symposium on Interactive 3D graphics and games

Many interactive rendering algorithms require operations on multiple fragments (i.e., ray intersections) at the same pixel location: however, current Graphics Processing Units (GPUs) capture only a single fragment per pixel. Example effects include ...
Interactive visibility ordering and transparency computations among geometric primitives in complex environments
SIGGRAPH '05: ACM SIGGRAPH 2005 Courses

We describe a novel algorithm for visibility ordering among non-overlapping geometric objects in complex and dynamic environments. Our algorithm rearranges the objects in a back-to-front or a front-to-back order from a given viewpoint. We perform ...
Real-time high-quality View-Dependent Texture Mapping using per-pixel visibility
GRAPHITE '05: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia

We present an extension of View-Dependent Texture Mapping (VDTM) allowing rendering of complex geometric meshes at high frame rates without usual blurring or skinning artifacts. We combine a hybrid geometric and image-based representation of a given 3D ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

I3D '05: Proceedings of the 2005 symposium on Interactive 3D graphics and games

April 2005

231 pages

ISBN:1595930132

DOI:10.1145/1053427

Conference Chairs:
Anselmo Lastra
University of North Carolina at Chapel Hill, USA
,
Marc Olano
University of Maryland Baltimore County, USA
,
Program Chairs:
David Luebke
University of Virginia, USA
,
Hanspeter Pfister
Mitsubishi Electric Research Laboratories, USA

Copyright © 2005 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 April 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

I3D05

Sponsor:

SIGGRAPH

I3D05: Symposium on Interactive 3D Graphics and Games 2005

April 3 - 6, 2005

District of Columbia, Washington

Acceptance Rates

Overall Acceptance Rate 148 of 485 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

26
Total Citations
View Citations
749
Total Downloads

Downloads (Last 12 months)11
Downloads (Last 6 weeks)0

Reflects downloads up to 26 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Trapp MDumke FDöllner J(2019)Occlusion Management Techniques for the Visualization of Transportation Networks in Virtual 3D City ModelsProceedings of the 12th International Symposium on Visual Information Communication and Interaction10.1145/3356422.3356445(1-8)Online publication date: 20-Sep-2019
https://dl.acm.org/doi/10.1145/3356422.3356445
de Lucas EMarcuello PParcerisa JGonzalez A(2019)Visibility Rendering OrderIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2018.286624630:2(473-485)Online publication date: 1-Feb-2019
https://dl.acm.org/doi/10.1109/TPDS.2018.2866246
Anglada Mde Lucas EParcerisa JAragon JGonzalez A(2019)Early Visibility Resolution for Removing Ineffectual Computations in the Graphics Pipeline2019 IEEE International Symposium on High Performance Computer Architecture (HPCA)10.1109/HPCA.2019.00015(635-646)Online publication date: Mar-2019
https://doi.org/10.1109/HPCA.2019.00015
Wyman CLuebke DMolnar S(2016)Exploring and expanding the continuum of OIT algorithmsProceedings of High Performance Graphics10.5555/2977336.2977338(1-11)Online publication date: 20-Jun-2016
https://dl.acm.org/doi/10.5555/2977336.2977338
Han SSander PWyman CYuksel C(2016)Triangle reordering for reduced overdraw in animated scenesProceedings of the 20th ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games10.1145/2856400.2856408(23-27)Online publication date: 27-Feb-2016
https://dl.acm.org/doi/10.1145/2856400.2856408
Vasilakis AFudos IKeyser JSander P(2014)k+-bufferProceedings of the 18th meeting of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games10.1145/2556700.2556702(143-150)Online publication date: 14-Mar-2014
https://dl.acm.org/doi/10.1145/2556700.2556702
Liu F(2013)Efficient Rendering of Order Independent Transparency on the GPUsGPU Solutions to Multi-scale Problems in Science and Engineering10.1007/978-3-642-16405-7_28(437-455)Online publication date: 9-Jan-2013
https://doi.org/10.1007/978-3-642-16405-7_28
Li WPaladini GGrady LKohlberger TSingh VBahlmann CManocha DWinslett M(2012)Luggage visualization and virtual unpackingProceedings of the Workshop at SIGGRAPH Asia10.1145/2425296.2425325(161-168)Online publication date: 26-Nov-2012
https://dl.acm.org/doi/10.1145/2425296.2425325
Zhang QWu YDing ZHuang XHersh WCallan JMaarek YSanderson M(2012)Learning hash codes for efficient content reuse detectionProceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval10.1145/2348283.2348339(405-414)Online publication date: 12-Aug-2012
https://dl.acm.org/doi/10.1145/2348283.2348339
Liu FHuang MLiu XWu EAliaga DOliveira MVarshney AWyman C(2010)FreePipeProceedings of the 2010 ACM SIGGRAPH symposium on Interactive 3D Graphics and Games10.1145/1730804.1730817(75-82)Online publication date: 19-Feb-2010
https://dl.acm.org/doi/10.1145/1730804.1730817
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten