Fast generation of pointerless octree duals

Eurographics Symposium on Geometry Processing

Volumn 29, Issue 5, 2010, Pages 1661-1669

  Lewiner, Thomas ^a   Mello, Vinícius ^b   Peixoto, Adelailson ^c   Pesco, Sinésio ^a   Lopes, Hélio ^a  

^a PONTIFICAL CATHOLIC UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^b FEDERAL UNIVERSITY OF BAHIA   (Brazil)

^c FEDERAL UNIVERSITY OF ALAGOAS   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 78650491505     PISSN: 17278384     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. BASTOS T., CELES W.: GPU-accelerated adaptively sampled distance fields. In Shape Modeling and Applications (2008), pp. 171-178.
2. CHOI M. G., JU E., CHANG J.-W., LEE J., KIM Y. J.: Linkless octree using multi-level perfect hashing. Computer Graphics Forum 28, 7 (2009), 1773-1780.
3. CASTRO R., LEWINER T., LOPES H., TAVARES G., BORDIGNON A.: Statistical optimization of octree searches. Computer Graphics Forum 27, 6 (2008), 1557-1566.
4. GARGANTINI I.: Linear octrees for fast processing of three-dimensional objects. Computer Graphics and Image Processing 4, 20 (1982), 365-374.
5. GUMEROV N. A., DURAISWAMI R., BOROVIKO E. A.: Data structures, optimal choice of parameters and complexity results for generalized multilevel fast multipole methods in d dimensions. Tech. rep., University of Maryland, 2003.
6. HATCHER A.: Algebraic topology. Cambridge University Press, 2002.
7. JU T., LOSASSO F., SCHAEFER S., WARREN J.: Dual contouring of Hermite data. In Siggraph (2002), ACM, pp. 339-346.
8. LEFEBVRE S., HOPPE H.: Perfect spatial hashing. In Siggraph (2006), ACM, pp. 579-588.
9. LEÓN A., TORRES J. C., VELASCO F.: Volume octree with an implicitly defined dual grid. Computers & Graphics 32, 4 (2008), 393-401.
10. MORTON G. M.: A computer oriented geodetic data base and a new technique in file sequencing. Tech. rep., IBM, Ottawa, 1966.
11. [NY06] NEWMAN T. S., YI H.: A survey of the Marching Cubes algorithm. Computers & raphics 30, 5 (2006), 854-879.
12. PAIVA A., LOPES H., LEWINER T., DE FIGUEIREDO L. H.: Robust adaptive meshes for implicit surfaces. In Sibgrapi (2006), IEEE, pp. 205-212.
13. SAMET H.: The design and analysis of spatial data structures. Addison-Wesley, 1990.
14. SCHRACK G.: Finding neighbors of equal size in linear quadtrees and octrees in constant time. Computer Vision, Graphics and Image Processing 55, 3 (1992), 221-230.
15. SHARF A., LEWINER T., SHKLARSKI G., TOLEDO S., COHEN-OR D.: Interactive topology-aware surface reconstruction. In Siggraph (2007), ACM, pp. 43.1-43.9.
16. SIVAN R., SAMET H.: Algorithms for constructing quadtree surface maps. In Symposium on Spatial Data Handling (1992), pp. 361-370.
17. STOCCO L. J., SCHRACK G.: Integer dilation and contraction for quadtrees and octrees. In Communications, Computers and Signal Processing (1995), IEEE, pp. 426-428.
18. STOCCO L. J., SCHRACK G.: On spatial orders and location codes. Transactions on Computers 58, 3 (2009), 424-432.
19. SCHAEFER S., WARREN J.: Dual Marching Cubes: primal contouring of dual grids. In Pacific Graphics (Washington, 2004), IEEE, pp. 70-76.
20. VON HERZEN B., BARR A. H.: Accurate triangulations of deformed, intersecting surfaces. In Siggraph (1987), ACM, pp. 103-110.
21. WARREN M. S., SALMON J. K.: A parallel hashed octree n-body algorithm. Supercomputing (1993), 12-21.