Navigating through triangle meshes implemented as linear quadtrees

ACM Transactions on Graphics

Volumn 19, Issue 2, 2000, Pages 79-121

  Lee, Michael ^a   Samet, Hanan ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

G.1.2 Numerical Analysis : Approximation Approximation of surfaces and contours; G.1.8 Numerical Analysis : Partial Differential Equations Finite element methods; I.3.3 Computer Graphics : Picture Image Generation Display algorithms

Indexed keywords

EID: 0002244040     PISSN: 07300301     EISSN: None     Source Type: Journal    
DOI: 10.1145/343593.343598     Document Type: Article

References (44)

1. ABEL, D. J. 1984. A B+ tree structure for large quadtrees. Comput. Vision Graph. Image Process. 27, 1, 19-31.
2. BANK, R. E., SHERMAN, A. H., AND WEISER, A. 1983. Refinement algorithms and data structures for regular local mesh refinement. In Scientific Computing IMACS Transactions on Scientific Computation, vol. 1. North-Holland Publishing Co., Amsterdam, The Netherlands, 3-17.
3. BENTLEY, J. L. 1975. Multidimensional binary search trees used for associative searching. Commun. ACM 18, 9 (Sept.), 509-517.
4. BERN, M., EPPSTEIN, D., AND GILBERT, J. 1994. Provably good mesh generation. J. Comput. Syst. Sci. 48, 3 (June 1994), 384-409.
5. COMER, D. 1979. The ubiquitous B-tree. ACM Comput. Surv. 11, 2 (June), 121-137.
6. DA SILVA, A. AND DUARTE-RAMOS, H. 1990. A progressive trimming approach to space decomposition. In Proceedings of the Fourth International Symposium on Spatial Data Handling (Zurich, Switzerland, July 1990),
7. DE FLORIANI, L., MAGILLO, P., AND PUPPO, E. 1997. Building and traversing a surface at variable resolution. In Proceedings of the conference on Visualization '97 (Phoenix, AZ, Oct. 19-24, 1997), R. Yagel, H. Hagen, R. Moorhead, N. Johnston, T.-M. Rhyne, and C. Hansen, Eds. ACM Press, New York, NY, 103ff.
8. DE FLORIANI, L., MARZANO, P., AND PUPPO, E. 1996. Multiresolution models for topographic surface description. Visual Comput. 12, 7 (Aug.), 317-345.
9. DUTTON, G. 1984. Geodesic modelling of planetary relief. Cartographica 21, 2-3, 188-207.
10. DUTTON, G. 1990. Locational properties of quaternary triangular meshes. In Proceedings of the Fourth International Symposium on Spatial Data Handling (Zurich, Switzerland, July 1990), 901-910.
11. DYN, N., LEVINE, D., AND GREGORY, J. A. 1990. A butterfly subdivision scheme for surface interpolation with tension control. ACM Trans. Graph. 9, 2 (Apr. 1990), 160-169.
12. ECK, M., DEROSE, T., DUCHAMP, T., HOPPE, H., LOUNSBERY, M., AND STUETZLE, W. 1995. Multiresolution analysis of arbitrary meshes. In Proceedings of the 22nd Annual ACM Conference on Computer Graphics (SIGGRAPH '95, Los Angeles, CA, Aug. 9-11), S. G. Mair and R. Cook, Eds. Annual conference series ACM Press, New York, NY, 173-182.
13. EPPSTEIN, D. 1992. Approximating the minimum weight triangulation. In Proceedings of the Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '92, Orlando, FL, Jan. 27-29), G. Frederickson, Ed. ACM Press, New York, NY, 48-57.
14. FEKETE, G. 1990. Rendering and managing spherical data with sphere quadtrees. In Proceedings of the Conference on Visualization '90 (San Francisco, CA, Oct. 1990),
15. FEKETE, G. AND DAVIS, L. S. 1984. A new representation for 3-d object recognition. In Proceedings of the Workshop on Computer Vision: Representation and Control (Annapolis, MD, Apr. 1984), 192-201.
16. FUCHS, H., KEDEM, Z. M., AND NAYLOR, B. F. 1980. On visible surface generation by a priori tree structures. SIGGRAPH Comput. Graph. 14, 3 (July), 124-133.
17. FUJIMOTO, A., TANAKA, T., AND IWATA, K. 1986. ARTS: Accelerated ray-tracing system. IEEE Comput. Graph. Appl. 6, 4 (Apr. 1986), 16-26.
18. GARGANTINI, I. 1982. An effective way to represent quadtrees. Commun. ACM 25, 12 (Dec.), 905-910.
19. GLASSNER, A. S. 1984. Space subdivision for fast ray tracing. IEEE Comput. Graph. Appl. 4, 10, 15-22.
20. GOODCHILD, M. F. AND SHIREN, Y. 1992. A hierarchical spatial data structure for global geographic information systems. CVGIP: Graph. Models Image Process. 54, 1 (Jan. 1992), 31-44.
21. HOPPE, H. 1997. View-dependent refinement of progressive meshes. In Proceedings of the 24th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH '97, Los Angeles, CA, Aug. 3-8), G. S. Owen, T. Whitted, and B. Mones-Hattal, Eds. ACM Press/Addison-Wesley Publ. Co., New York, NY, 189-198.
22. HOPPE, H., DEROSE, T., DUCHAMP, T., HALSTEAD, M., JIN, H., MCDONALD, J., SCHWEITZER, J., AND STUETZLE, W. 1994. Piecewise smooth surface reconstruction. In Proceedings of the ACM Conference on Computer Graphics (SIGGRAPH '94, Orlando, FL, July 24-29, 1994), D. Schweitzer, A. Glassner, and M. Keeler, Eds. ACM Press, New York, NY, 295-302.
23. HUNTER, G. M. 1978. Efficient computation and data structures for graphics. Ph.D. Dissertation. Department of Computer Science, Princeton Univ., Princeton, NJ.
24. JUNKINS, S. 1999. Constant time neighbor finding for subdivision surfaces. Tech. Rep.. Intel Corp., Santa Clara, CA.
25. KAPLAN, M. R. 1985. Space-tracing: A constant time ray-tracer. In Proceedings of the ACM Conference on Computer Graphics (SIGGRAPH '85, San Francisco, CA), ACM, New York, NY.
26. KELA, A., PERUCCHIO, R., AND VOELCKER, H. 1986. Toward automatic finite element analysis. Comput. Mech. Eng. 5, 1 (July), 57-71.
27. KLINGER, A. 1971. Patterns and search statistics. In Optimizing Methods in Statistics, J. S. Rustagi, Ed. Academic Press, Inc., New York, NY, 303-337.
28. KNOWLTON, K. 1980. Progressive transmission of grey-scale and binary pictures by simple efficient, and lossless encoding schemes. Proc. IEEE 68, 7 (July), 885-896.
29. LEE, M. AND SAMET, H. 1998. Navigating through triangle meshes implemented as linear quadtrees. TR-3900. Department of Computer Science, University of Maryland, College Park, MD.
30. MORTON, G. M. 1966. A computer oriented geodetic data base and a new technique in file sequencing. Tech. Rep.. IBM, Ltd., Ottawa, Canada.
31. OTOO, E. J. AND ZHU, H. 1993. Indexing on spherical surfaces using semi-quadcodes. In Proceedings of the Third International Symposium on Advances in Spatial Databases (SSD'93, Singapore, June 1993), D. Abel and B. C. Ooi, Eds. Springer-Verlag, New York, 510-529.
32. PERUCCHIO, R., SAXENA, M., AND KELA, A. 1989. Automatic mesh generation from solid models based on recursive spatial decompositions. Int. J. Num. Methods Eng. 28, 11 (Nov.), 2469-2501.
33. SAMET, H. 1982. Neighbor finding techniques for images represented by quadtrees. Comput. Vision Graph. Image Process. 18, 1 (Jan.), 37-57.
34. SAMET, H. 1989. Implementing ray tracing with octrees and neighbor finding. Comput. Graph. 13, 4, 445-460.
35. SAMET, H. 1990a. The Design and Analysis of Spatial Data Structures. Addison-Wesley Series in Computer Science. Addison-Wesley Longman Publ. Co., Inc., Reading, MA.
36. SAMET, H. 1990b. Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS. Addison-Wesley Series in Computer Science. Addison-Wesley Longman Publ. Co., Inc., Reading, MA.
37. SAMET, H. AND TAMMINEN, M. 1988. Efficient component labeling of images of arbitrary dimension represented by linear bintrees. IEEE Trans. Pattern Anal. Mach. Intell. 10, 4 (July 1988), 579-586.
38. SAXENA, M. AND PERUCCHIO, R. 1989. Element extraction for automatic meshing based on recursive spatial decompositions. Tech. Rep.. University of Rochester, Rochester, NY.
39. SCHRACK, G. 1991. Finding neighbors of equal size in linear quadtrees and octrees in constant time. CVGIP: Image Underst. 55, 3 (May 1992), 221-230.
40. SNYDER, J. P. 1987. Map Projection; A Working Manual. U.S. Government Printing Office, Washington, DC.
41. TAMMINEN, M. 1984. Comment on quad- and oct-trees. Commun. ACM 27, 3 (Mar.), 248-249.
42. TAMMINEN, M., KARONEN, O., AND MANTYLA, M. 1984. Ray-casting and block model conversion using a spatial index. Comput. Aided Des. 16, 4 (July 1984), 203-208.
43. TOBLER, W. AND CHEN, Z. T. 1986. A quadtree for global information storage. Geographical Anal. 18, 4 (Oct.), 360-371.
44. YERRY, M. A. AND SHEPHARD, M. S. 1983. A modified quadtree approach to finite element mesh generation. IEEE Comput. Graph. Appl. 3, 1 (Feb.), 39-46.