An exact interactive time visibility ordering algorithm for polyhedral cell complexes

Proceedings of the 1998 IEEE Symposium on Volume Visualization, VVS 1998

Volumn , Issue , 1998, Pages 87-94

  Silva, Cláudio T ^a   Mitchell, Joseph S B ^b   Williams, Peter L ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b Stony Brook University   (United States)

Author keywords

Depth ordering; Finite element methods; Scientific visualization; Visibility ordering; Volume rendering; Volume visualization

Indexed keywords

CELLS; CYTOLOGY; DATA VISUALIZATION; FINITE ELEMENT METHOD; HEURISTIC METHODS; VISIBILITY; VISUALIZATION; VOLUME RENDERING; VOLUMETRIC ANALYSIS;

CONVEX POLYHEDRONS; DEPTH ORDERING; EXPERIMENTAL EVIDENCE; POLYHEDRAL CELLS; UNSTRUCTURED MESHES; UNSTRUCTURED TETRAHEDRAL MESHES; VISIBILITY ORDERING; VOLUME VISUALIZATION;

MESH GENERATION;

EID: 80855137602     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/288126.288170     Document Type: Conference Paper

References (35)

1. P. K. Agarwal and J. Matousek. Ray shooting and païametrii search. SIAMJ. Comput, 22(4):794-806, 1993.
2. P. K. Agarsval and J. Matousek. On range searching with semi algebraic sets. Discrete Compia. Geom, 11:393-418, 1994.
3. L J. Balaban. An optimal algorithm for finding segment intersections. In Proc Utk Anna. ACMSympos. Compia. Geom., pages 211-219, 1995.
4. B. Chazelle and H. Edelsbrunner. An optimal algorithm for intersecting line segments in the plane. J. ACM, 39:1-54, 1992.
5. B. Chazelle, H. Edelsbrunner, L. J. Guibas, R. Pollack, R. Seidel M. Shark, and J. Snoeyink. Counting and cutting cycles of lines and rods in space. Compia. Geom. Theory Appi, 1305-323, 1999
6. M. de Berg. Ray Shooting. Depth Orders and Hidden Surface Removal, volume 703 of Lecture Notes Compia. Sci Springer-Verlag, Berlin, Germany, 1993.
7. M. de Berg, L. J. Guibas, and D. Halperin. Vertical decompositions for triangles in 3-space. Discrete Compia Geom., 153561, 1996.
8. M. de Berg, D. Halperin, M. Overmais, J. Snoeyink, and M van Kreveld. Efficient ray shooting and hidden surface removal. Al-gorithmica, 1230-53, 1994.
9. M. de Berg, M. Overmars, and O. Schwarzkopf. Computing and verifying depth orders. SIAM Journal on Computing, 23:437446, 1994.
10. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, 1997.
11. L. Carpenter, The A-buffer, an annaliased hidden surface method, " Computer Graphics, vol. 18, no. 3, pp. 103-108, 1984.
12. D. P. Doblan and M. J. Laszlo. Primitives for the manipulation of three-dimensional subdivisions. Algorithmica, 43-32, 1989.
13. H. Edelsbronner. An acyclicity theorem for cell complexes in d dimensions. Combinatorica, 10251-260, 1990.
14. H. Edelsbrunner and E. P. Mücke. Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. ACM Trans. Graph., 9:66-104, 1990.
15. H. Fuchs, Z. M. Kedem, and B. Naylor. On visible surface generation by a priori tree structures. Comput Graph., 14(3): 124133, 1980. Proc. SIGGRAPH '80.
16. M. P. Garrity, ytracing Irregular Volume Data, Computer Graphics (San Diego Workshop on Volume Visualization), vol. 24, pp. 35-40, Nov. 1990.
17. CGiertsen, "Volume Visualization of Sparse Irregular Meshes, " IEEE Computer Graphics and Applications, vol. 12, no. 2, pp. 40-48, March 1992.
18. M. Goodrich and R. Tamassia. Dynamic trees and dynamic point location. In Proc. 23rd Arum. ACM Sympos. Theory Comput, pages 523-533, 1991.
19. M. S. Karasick, D. Lieber, L. R. Nackman, and V. T. Rajan. Visualization of three-dimensional Delaunay meshes. Algorithmica, 19(1-2):114-12S, Sept 1997.
20. N. Max, P. Hanrahan, and R. Crawfis. Area and volume coherence for efficient Visualization of 3d scalar functions. Compul Graph., 24(5)27-33, 1990.
21. J. S. B. Mitchell, D. M. Mount, and S. Suri. Query-sensitive ray shooting. In Proc 10th Annu. ACM Sympos. Comput Geom., pages 359-368, 1994.
22. M. Newell, R. Newell and T. Sancha, "Solution to the hidden surface problem, " Proc ACM National Conference, 1972, pp. 443-450.
23. M. Newell, "The utilization of procedure models in digital image synthesis, " Ph.D. Thesis, University of Utah, 1974 (UTEC-CSc-76-218 and NTIS AD/A 039 008yLL).
24. O. Nurmi. On translating a set of objects in two- and three-dimensional spaces. Comput. Vision Graph. Image Process., 36:42-52, 1986.
25. M. S. Paterson and F. F. Yao. Efficient binary space partitions for hidden-surface removal and solid modeling. Discrete Comput. Geom., 5:485-503, 1990.
26. M. Pellegrini. Ray shooting on triangles in 3-space. Algorithmica, 9:471-494, 1993.
27. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, NY, 1985.
28. O. Schwarzkopf and M. Shark. Vertical decomposition of a single cell in a mree-dimensional arrangement of surfaces and its applications. Discrete Comput Geom., 18:269-288, 1997.
29. M. Shark and P. K. Agarwal. Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, New York, 1995.
30. P. Shkley and A. Tuchman, "A Polygonal Approximation to Direct Scalar Volume Rendering, " Computer Graphics (San Diego Workshop on Volume Visualization), vol. 24, pp. 63-70, Nov. 1990.
31. C T. Silva and J. S. B. Mitchell. The lazy sweep ray casting algorithm for rendering irregular grids. IEEE Trans. Visualizat. Comput Graph., 3(2):142-157, Apr. 1997.
32. C Stein, B. Becker, and N. Max, "Sorting and Hardware Assisted Rendering for Volume Visualization, " Symposium on Volume Visualization, pp. 83-90, October 1994.
33. P. Williams, "Visibility Ordering Meshed Polyhedra, " ACM Transactions on Graphics, vol. 11, no. 2, 1992.
34. P. L. Williams, N. Max, and C. Stein, "A high accuracy volume renderer for unstructured data, " IEEE Trans, on Visualization and Computer Graphics, vol. 4, no. 1, pp. 1-18, March 1998.
35. R. Yagel, D. Reed, A. Law, P-W. Shin, and N. Shareef, "Hardware Assisted Volume Rendering of Unstructured Grids by Incremental Slicing, " IEEE-ACM Volume Visualization Symposium, pp. 55-62, Nov. 1996.