An exact interactive time visibility ordering algorithm for polyhedral cell complexes

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

An exact interactive time visibility ordering algorithm for polyhedral cell complexes

Full text

Pdf (950 KB)

Source

Symposium on Volume Visualization archive
Proceedings of the 1998 IEEE symposium on Volume visualization table of contents

Research Triangle Park, North Carolina, United States

Pages: 87 - 94

Year of Publication: 1998

ISBN:1-58113-105-4

Authors

Cláudio T. Silva	Visual and Geometric Computing Group, P.O. Box 704, IBM T. J. Watson Research Center, State University of New York at Stony Brook, Yorktown Heights, NY
Joseph S. B. Mitchell	Department of Applied Mathematics and Statistics, IBM T. J. Watson Research Center, State University of New York at Stony Brook, NY
Peter L. Williams	Data Explorer (DX) Research Group. P.O. Beoc 704, IBM T. J. Watson Resarch Center, State University of New York at Stony Brook, York Town Heights, NY

Sponsors

IEEE-CS : Computer Society
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 12, Citation Count: 11

Additional Information:

references cited by index terms collaborative colleagues

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/288126.288170 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	Pankaj K. Agarwal , Jiří Matoušek, Ray shooting and parametric search, SIAM Journal on Computing, v.22 n.4, p.794-806, Aug. 1993 [doi>10.1137/0222051]
	2	E K. Agam,al and k Matou~ek. On range searching with semialgebraic sets. Discrete Comput. Geom., 11:.393-418, 1994.
	3	Ivan J. Balaban, An optimal algorithm for finding segments intersections, Proceedings of the eleventh annual symposium on Computational geometry, p.211-219, June 05-07, 1995, Vancouver, British Columbia, Canada [doi>10.1145/220279.220302]
	4	Bernard Chazelle , Herbert Edelsbrunner, An optimal algorithm for intersecting line segments in the plane, Journal of the ACM (JACM), v.39 n.1, p.1-54, Jan. 1992 [doi>10.1145/147508.147511]
	5	Bernard Chazelle , Herbert Edelsbrunner , Leonidas J. Guibas , Richard Pollack , Raimund Seidel , Micha Sharir , Jack Snoeyink, Counting and cutting cycles of lines and rods in space, Computational Geometry: Theory and Applications, v.1 n.6, p.305-323, June 1992 [doi>10.1016/0925-7721(92)90009-H]
	6	Mark de Berg, Ray Shooting, Depth Orders and Hidden Surface Removal, Springer-Verlag New York, Inc., Secaucus, NJ, 1993
	7	M. de Berg, L. J. Gm'bas, and D. Halpefin. Vertical decompositions for triangles in 3-space. Discrete Comput. Geora., 15".35- 61, 1996.
	8	M. de Berg, D. Halperin, M. Overmars, j. Snoe35ak, and M. van Kreveld. Efficient my shooting and hidden surface removal. AlgorithrMca, 12:30-53, 1994.
	9	Mark de Berg , Mark Overmars , Otfried Schwarzkopf, Computing and Verifying Depth Orders, SIAM Journal on Computing, v.23 n.2, p.437-446, April 1994 [doi>10.1137/S0097539791223747]
	10	M. de Berg,/~ x~m Kreveld, ~ Ovennars, and O. Sehwarzkopf. Computan'onal Geometo," Algorithms and Applications. Springer-Verlag, Berlin, 199%
	11	Loren Carpenter, The A -buffer, an antialiased hidden surface method, ACM SIGGRAPH Computer Graphics, v.18 n.3, p.103-108, July 1984
	12	D. P. Dobldn and M. J. Laszlo. Primitia.es for the manipulation ofthree-dimensional subdivisions. Algorithmica, 4"_'3--32, 1989.
	13	H. Edelsbmnner. An aeyelieity theorem for cell complexes in d dimensions. Combinatorica, 10".251-260, 1990.
	14	Herbert Edelsbrunner , Ernst Peter Mücke, Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms, ACM Transactions on Graphics (TOG), v.9 n.1, p.66-104, Jan. 1990 [doi>10.1145/77635.77639]
	15	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
	16	h~ P. Gar6b- "RayWa~g ~ Volume Data," Computer Grapt'dcs (San Diego Workshop on Volume Hsualiz~'on), vol. 24, pp. 35--40, Nov. 1990.
	17	Christopher Giertsen, Volume Visualization of Sparse Irregular Meshes, IEEE Computer Graphics and Applications, v.12 n.2, p.40-48, March 1992 [doi>10.1109/38.124287]
	18	Michael T. Goodrich , Roberto Tamassia, Dynamic trees and dynamic point location, Proceedings of the twenty-third annual ACM symposium on Theory of computing, p.523-533, May 05-08, 1991, New Orleans, Louisiana, United States [doi>10.1145/103418.103472]
	19	M. S. Karasick, D. Lieber, L. R. Naehnan, and V. T. Rajah. Visualization of three-dimensioaal Delannay meshes. Algorithrrdca, 19(1-2):114-128, Sept. 199%
	20	Nelson Max , Pat Hanrahan , Roger Crawfis, Area and volume coherence for efficient visualization of 3D scalar functions, ACM SIGGRAPH Computer Graphics, v.24 n.5, p.27-33, Nov. 1990
	21	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]
	22	M. NeweU, R. Newell and T. Sancha, "Solution to the hidden surface problem" Proc ACM National Conference, 1972, pp. 443-450.
	23	Martin Edward Newell, The utilization of procedure models in digital image synthesis., 1975
	24	Otto Nurmi, On translating a set of objects in 2- and 3-dimensional space, Computer Vision, Graphics, and Image Processing, v.36 n.1, p.42-52, Oct. 1986 [doi>10.1016/S0734-189X(86)80028-7]
	25	Michael S. Paterson , F. Frances Yao, Efficient binary space partitions for hidden-surface removal and solid modeling, Discrete & Computational Geometry, v.5 n.5, p.485-503, 1990 [doi>10.1007/BF02187806]
	26	M. Pellegrini. Ray shooting on triangles in 3-space. Algorithm~ca, 9:471--494, 1993.
	27	Franco P. Preparata , Michael I. Shamos, Computational geometry: an introduction, Springer-Verlag New York, Inc., New York, NY, 1985
	28	O. Sehwarzkopf and M. Shark. Vertical decomposition of a single cell in a three-dimensional arrangement of surfaces and its applications. Discrete Comput. Geom., 18:269-288, 1997.
	29	Micha Sharir , Pankaj K. Agarwal, Davenport-Schinzel sequences and their geometric applications, Cambridge University Press, New York, NY, 1996
	30	Peter Shirley , Allan Tuchman, A polygonal approximation to direct scalar volume rendering, ACM SIGGRAPH Computer Graphics, v.24 n.5, p.63-70, Nov. 1990
	31	Claudio T. Silva , Joseph S. B. Mitchell, The Lazy Sweep Ray Casting Algorithm for Rendering Irregular Grids, IEEE Transactions on Visualization and Computer Graphics, v.3 n.2, p.142-157, April 1997 [doi>10.1109/2945.597797]
	32	Clifford M. Stein , Barry G. Becker , Nelson L. Max, Sorting and hardware assisted rendering for volume visualization, Proceedings of the 1994 symposium on Volume visualization, p.83-89, October 17-18, 1994, Tysons Corner, Virginia, United States [doi>10.1145/197938.197971]
	33	Peter L. Williams, Visibility-ordering meshed polyhedra, ACM Transactions on Graphics (TOG), v.11 n.2, p.103-126, April 1992 [doi>10.1145/130826.130899]
	34	Peter L. Williams , Nelson L. Max , Clifford M. Stein, A High Accuracy Volume Renderer for Unstructured Data, IEEE Transactions on Visualization and Computer Graphics, v.4 n.1, p.37-54, January 1998 [doi>10.1109/2945.675650]
	35	David M. Reed , Roni Yagel , Asish Law , Po-Wen Shin , Naeem Shareef, Hardware assisted volume rendering of unstructured grids by incremental slicing, Proceedings of the 1996 symposium on Volume visualization, p.55-ff., October 28-29, 1996, San Francisco, California, United States

CITED BY 11

	Lance C. Burton , Raghu Machiraju , Donna S. Reese, Dynamic view-dependent partitioning for structured grids with complex boundaries for object-order rendering techniques, Proceedings of the 1999 IEEE symposium on Parallel visualization and graphics, p.89-96, October 25-26, 1999, San Francisco, California, United States
	Ricardo Farias , Joseph S. B. Mitchell , Cláudio T. Silva, ZSWEEP: an efficient and exact projection algorithm for unstructured volume rendering, Proceedings of the 2000 IEEE symposium on Volume visualization, p.91-99, October 09-10, 2000, Salt Lake City, Utah, United States
	Stefan Guthe , Stefan Roettger , Andreas Schieber , Wolfgang Strasser , Thomas Ertl, High-quality unstructured volume rendering on the PC platform, Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware, September 01-02, 2002, Saarbrucken, Germany
	Brian Wylie , Kenneth Moreland , Lee Ann Fisk , Patricia Crossno, Tetrahedral projection using vertex shaders, Proceedings of the 2002 IEEE symposium on Volume visualization and graphics, October 28-29, 2002, Boston, Massachusetts
	Martin Kraus , Thomas Ertl, Cell-projection of cyclic meshes, Proceedings of the conference on Visualization '01, October 21-26, 2001, San Diego, California
	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
	Steven P. Callahan , Milan Ikits , Joao L. D. Comba , Claudio T. Silva, Hardware-Assisted Visibility Sorting for Unstructured Volume Rendering, IEEE Transactions on Visualization and Computer Graphics, v.11 n.3, p.285-295, May 2005
	Richard Cook , Nelson Max , Claudio T. Silva , Peter L. Williams, Image-Space Visibility Ordering for Cell Projection Volume Rendering of Unstructured Data, IEEE Transactions on Visualization and Computer Graphics, v.10 n.6, p.695-707, November 2004
	Naga K. Govindaraju , Michael Henson , Ming C. Lin , Dinesh Manocha, Interactive visibility ordering and transparency computations among geometric primitives in complex environments, Proceedings of the 2005 symposium on Interactive 3D graphics and games, April 03-06, 2005, Washington, District of Columbia
	Philipp Muigg , Markus Hadwiger , Helmut Doleisch , Helwig Hauser, Scalable Hybrid Unstructured and Structured Grid Raycasting, IEEE Transactions on Visualization and Computer Graphics, v.13 n.6, p.1592-1599, November 2007