Browse > Article
http://dx.doi.org/10.9728/dcs.2014.15.3.347

Analysis on Spatial Sampling and Implementation for Primal Trees  

Park, Taejung (덕성여자대학교 디지털미디어학과)
Publication Information
Journal of Digital Contents Society / v.15, no.3, 2014 , pp. 347-355 More about this Journal
Abstract
The general octree structure is common for various applications including computer graphics, geometry information analysis and query. Unfortunately, the general octree approach causes duplicated sample data and discrepancy between sampling and representation positions when applied to sample continuous spatial information, for example, signed distance fields. To address these issues, some researchers introduced the dual octree. In this paper, the weakness of the dual octree approach will be illustrated by focusing on the fact that the dual octree cannot access some specific continuous zones asymptotically. This paper shows that the primal tree presented by Lefebvre and Hoppe can solve all the problems above. Also, this paper presents a three-dimensional primal tree traversal algorithm based the Morton codes which will help to parallelize the primal tree method.
Keywords
octree; dual octree; primal tree; spatial division sampling; Morton code; parallel tree structures;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 A. Hatcher, "Algebraic Topology," Cambridge University Press, 2002.
2 T. Ju, F. Losasso, S. Schaefer, and J. Warren, "Dual Contouring of Hermite Data," ACM Transactions on Graphics vol. 21, no. 3, pp.339-346, July 2002.
3 H. Kim and H Park, "A Hybrid Rendering Model to support LOD," Journal of Digital Contents Society vol. 9 no. 3, pp. 509-516, Sep. 2008.   과학기술학회마을
4 S. F. Frisken, R. N. Perry, A. P. Rockwood, and T. R. Jones, "Adaptively sampled distance fields: a general representation of shape for computer graphics," Proc. SIGGRAPH 2000, pp.249-254, July 2000.
5 S. Lee, T. Park and C. Kim, "Primitive Trees for Precomputed Distance Queries," Computer Graphics Forum (Proc. EUROGRAPHICS 2013), vol. 32, no. 2, pp. 419-428, May 2013.
6 T. Park, H. Lee and C. Kim, "Progressive Compression of Geometry Information with Smooth Intermediate Meshes," Iberian Conference on Pattern Recognition and Image Analysis 2007, vol. 4478, pp. 89-96, June 2007.
7 H. Lee, M. Desbrun, and P. Schroder, "Progressive Encoding of Complex Isosurfaces," ACM Transactions on Graphics vol. 22, no. 3, pp. 471-476, July 2003.   DOI   ScienceOn
8 S. Lee, T. Park, J. Kim and C. Kim, "Adaptive Synthesis of Distance Fields," IEEE Transactions on Visualization and Computer Graphics, vol. 17, no. 7, pp. 1202-1206, July 2012.
9 T. Lewiner, V. Mello, A. Peixoto, S. Pesco and H. Lopes, "Fast Generation of Pointerless Octree Duals," Computer Graphics Forum vol. 29, pp. 1661-1669 Sep. 2010.   DOI   ScienceOn
10 S. Lefebvre and H. Hoppe, "Compressed Random-ac cess Trees for Spatially Coherent Data," Proc. the 18th Eurographics Conference on Rendering Techniques (EGSR'07), pp. 339-349, 2007.