Constant-time navigation in four-dimensional nested simplkial Meshes

Proceedings - Shape Modeling International SMI 2004

Volumn , Issue , 2004, Pages 221-230

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

^a UNIVERSITY OF MARYLAND   (United States)

^b UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE REPRESENTATION; MESHES; MULTI-RESOLUTION MODELS; PENTATOPES;

ALGORITHMS; APPROXIMATION THEORY; COMPUTER GRAPHICS; COMPUTER SIMULATION; ELECTRIC FIELDS; FINITE ELEMENT METHOD; HIERARCHICAL SYSTEMS; MAGNETIC FIELDS; VISUALIZATION;

TIME VARYING SYSTEMS;

EID: 6344289163     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SMI.2004.1314509     Document Type: Conference Paper

References (29)

1. F. Bhaniramka, R. Wenger, and R. Crawfis. Isosurfacing in higher dimensions. In Proceedings IEEE Visualization 2000, pages 267-273. IEEE Computer Society, Oct. 2000.
2. E. Danovaro, L. De Floriani, P. Magillo, and E. Puppo. Data structures for 3D Multi-Tessellations: an overview. In H. Post, G. Bonneau, and G. Nielson, editors, Proceedings Dagstuhl Scientific Visualization Seminar. Kluwer Academic Publishers, 2002.
3. L. De Floriani and M. Lee. Selective refinement on nested tetrahedral meshes. In G. Brunnett, B. Hamann, H. Mueller, and L. Linsen, editors, Geometric Modeling for Scientific Visualization, pages 329-344. Springer Verlag, 2003.
4. L. De Floriani and P. Magillo. Multi-resolution mesh representation: models and data structures. In M. Floater, A. Iske, and E. Quak, editors, Principles of Multi-resolution in Geometric Modeling, Lecture Notes in Mathematics, Springer Verlag, Berlin (D), 2002.
5. W. Evans, D. Kirkpatrick, and G. Townsend. Right-triangulated irregular networks. Algorithmica, 30(2):264-286, 2001.
6. I. Gargantini. An effective way to represent quadtrees. Communications of the ACM, 25(12):905-910, Dec. 1982.
7. T. Gerstner and M. Rumpf. Multiresolutional parallel isosurface extraction based on tetrahedral bisection. In Proceedings 1999 Symposium on Volume Visualization. IEEE Computer Society, 1999.
8. B. Gregorski, M. Duchaineau, P. Lindstrom, V. Pascucci, and K. Joy. Interactive view-dependent rendering of large isosurfaces. In Proceedings IEEE Visualization 2002, Boston, MA, Oct. 2002. IEEE Computer Society.
9. G. Greiner and R. Grosso. Hierarchical tetrahedral-octahedral subdivision for volume visualization. The Visual Computer, 16:357-369, 2000.
10. 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, pages 387-394, Phoenix, AZ, Oct. 1997.
11. D. J. Hebert. Symbolic local refinement of tetrahedral grids. Journal of Symbolic Computation, 17(5):457-472, May 1994.
12. L. Ibarria, P. Linstrom, J. Rossignac, and A. Szymczak. Out-of-core compression and decompression of large n-dimensional scalar fields. Computer Graphics Forum, 22(3), 2003.
13. G. Ji, H. Shen, and R. Wenger. Volume tracking using higher dimensional isosurfacing. In J. v. W. G. Turk and R. Moorhead, editors, Proceedings IEEE Visualization 2003, pages 209-216. IEEE Computer Society, Oct. 2003.
14. M. Lee, L. De Floriani, and H. Samet. Constant-time neighbor finding in hierarchical tetrahedral meshes. In Proceedings International Conference on Shape Modeling & Applications, pages 286-295, Genova, Italy, May 2001.
15. M. Lee and H. Samet. Navigating through triangle meshes implemented as linear quadtrees. ACM Transactions on Graphics, 19(2):79-121, Apr. 2000.
16. J. M. Maubach. Local bisection refinement for n-simplicial grids generated by reflection. SIAM 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(4):365-385, 1997.
18. V. Pascucci. Slow growing subdivision (SGS) in any dimension: towards removing the curse of dimensionality. Computer Graphics Forum, 21(3), 2002.
19. V. Pascucci and C. L. Bajaj. Time critical isosurface refinement and smoothing. In Proceedings IEEE Symposium on Volume Visualization, pages 33-42, Salt Lake City, UT, Oct. 2000. IEEE Computer Society.
20. M. Rivara and C. Levin. A 3D refinement algorithm for adaptive and multigrid techniques. Communications in Applied Numerical Methods, 8:281-290, 1992.
21. J. Roberts and S. Hill. Piecewise linear hypersurfaces using the marching cube algorithm. In R. Erbacher and A. Pang, editors, Visual Data Exploration and Analysis VI, Proceedings of SPIE Visualization 2000, pages 170-181. SPIE, 1999.
22. T. Roxborough and G. Nielson. Tetrahedron-based, least-squares, progressive volume models with application to free-hand ultrasound data. In Proceedings IEEE Visualization 2000, pages 93-100. IEEE Computer Society, Oct. 2000.
23. H. Samet. Neighbor finding techniques for images represented by quadtrees. Computer Graphics and Image Processing, 18(1):37-57, Jan. 1982.
24. H. Samet. Neighbor finding in images represented by octrees. Computer Vision, Graphics, and Image Processing, 46(3):367-386, June 1989. Also University of Maryland Computer Science TR-1968.
25. H. Samet. Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS. Addison-Wesley, Reading, MA, 1990.
26. G. Schrack. Finding neighbors of equal size in linear quadtrees and octrees in constant time. CVGIP: Image Understanding, 55(3):221-230, May 1992.
27. C. Weigle and D. Banks. Complex-valued contour meshing. In Proceedings IEEE Visualization 1996, pages 173-180. IEEE Computer Society, Oct. 1996.
28. C. Weigle and D. Banks. Extracting iso-valued features in 4-dimensional scalar fields. In Proceedings IEEE Visualization 1998, pages 103-110. IEEE Computer Society, Oct. 1998.
29. Y. Zhou, B. Chen, and A. Kaufman. Multiresolution tetrahedral framework for visualizing regular volume data. In R. Yagel and H. Hagen, editors, Proceedings IEEE Visualization '97, pages 135-142, Phoenix, AZ, Oct. 1997.