Constant-time neighbor finding in hierarchical tetrahedral meshes

Proceedings - International Conference on Shape Modeling and Applications, SMI 2001

Volumn , Issue , 2001, Pages 286-295

  Lee, Michael ^a   De Floriani, Leila ^b   Samet, Hanan ^a  

^a UNIVERSITY OF MARYLAND   (United States)

^b UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTANT TIME; EQUAL SIZES; HIERARCHICAL TETRAHEDRAL MESHES; NEIGHBOR FINDING; RECURSIVE DECOMPOSITION; TETRAHEDRAL MESHES;

GEOMETRY;

EID: 84881337393     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SMA.2001.923400     Document Type: Conference Paper

References (25)

1. W. G. Aref and H. Samet. Efficient processing of window queries in the pyramid data structure. In Proceedings of the 9th A CM S1GA CT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), pages 265-272, Nashville, TN, Apr. 1990.
2. (Also Proceedings of the Fifth Brazilian Symposium on Databases, Rio de Janeiro, Brazil, April 1990, 15-26).
3. P. Cignoni, L. DeFloriani, C. Montani, E. Puppo, and R. Scopigno. Multiresolution modeling and visualization of volume data based on simplicial complexes. In Proceedings of the 1994 Symposium on Volume Visualization, pages 19-26, Washington, DC, Oct. 1994.
4. L. De Floriani, E. Puppo, and P. Magillo. A formal approach to multiresolution hypersurface modeling. In W. Strasser, R. Klein, and R. Rau, editors, Geometric Modeling: Theory and Practice, pages 302-323. Springer-Verlag, 1997.
5. M. Duchaineau, M. Wolinsky, D. E. Sigeti, M. C. Miller, C. Aldrich, and M. B. Mineev-Weinstein. ROAMing terrain: Real-time optimally adapting meshes. In R. Yagel and H. Hagen, editors, Proceedings IEEE Visualization '97, pages 81-88, Phoenix, AZ, Oct. 1997.
6. W. Evans, D. Kirkpatrick, and G. Townsend. Right-triangulated irregular networks. Algorithmica, to appear 2000.
7. (Also University of Arizona Technical Report 97-09, May 1997).
8. G. Fekete. Rendering and managing spherical data with sphere quadtrees. In Proceedings of'Visualization '90, pages 176-186, San Francisco, CA, Oct. 1990.
9. I. Gargantini. An effective way to represent quadtrees. Communications of the ACM, 25(12):905-910, Dec. 1982.
10. T. Gerstner and M. Rumpf. Multiresolutional parallel isosurface extraction based on tetrahedral bisection. In Proceedings 1999 Symposium on Volume Visualization, ACM Press, 1999.
11. R. Gross, C. Luerig, and T. Ertl. The multilevel finite element method for adaptive mesh optimization and visualization of volume data. In R. Yagel and H. Hagen, editors, Proceedings IEEE Visualization '97, Volume 24, pages 387-394, Phoenix, AZ, Oct. 1997.
12. D. J. Hebert. Symbolic local refinement of tetrahedral grids. Journal of Symbolic Computation, 17:457-472, 1994.
13. M. Lee and H. Samet. Navigating through triangle meshes implemented as linear quadtrees. ACM Transactions on Computer Graphics, 19(2):79-121, Apr. 2000.
14. (Also University of Maryland Computer Science TR-3900, April 1998).
15. P. Lindstrom, D. Koller, W. Ribarsky, L. F. Hodges, N. Faust, and G. A. Turner. Real-time continuous level of detail rendering of height fields. In Proceedings of the SIGGRAPH'96 Conference, pages 109-118, New Orleans, Aug. 1996.
16. J. M. Maubach. Local bisection refinement for n-simplicial grids generated by reflection. S1AM Journal on Scientific Computing, 16(1):210-227, Jan. 1995.
17. M. Ohlberger and M. Rumpf. Hierarchical and adaptive visualization on nested grids. Computing, 56:365-385, 1997. (Pubitemid 127653564)
18. R. Pajarola. Large scale terrain visualization using the restricted quadtree triangulation. In D. Ebert, H. Hagen, and H. Rushmeier, editors, Proceedings IEEE Visualization '98, pages 19-26, Research Triangle Park, NC, Oct. 1998.
19. H. Samet. Neighbor finding techniques for images represented by quadtrees. Computer Graphics and Image Processing, 18(1):37-57, Jan. 1982. (Pubitemid 12500931)
20. H. Samet. Neighbor finding in images represented by octrees. Computer Vision, Graphics, and Image Processing, 46(3):367-386, June 1989.
21. H. Samet. Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS. Addison-Wesley, Reading, MA, 1990.
22. P. Shirley and A. Tuchman. A polygonal approximation to direct scalar volume rendering. Computer Graphics, 24(5):63-70, Nov. 1990. {Proceedings of San Diego Workshop on Volume Visualization).
23. J. Wilhelms and A. van Gelder. Multi-dimensional trees for controlled volume rendering and compression. In Proceedings of the 1994 Symposium on Volume Visualization, pages 17-18, Washington, DC, Oct. 1994.
24. P. L. Williams. Visibility ordering of meshed polyhedra. ACM Transactions on Graphics, 11 (2): 103-126, Apr. 1992.
25. Y. Zhou, B. Chen, and A. Kaufman. Multiresolution tetrahedral framework for visualizing regular volume data. In R. Yagel and H. Hagen, editors, Proceedings IEEE Visual-ization '97, pages 135-142, Phoenix, AZ, Oct. 1997.