Journal of Digital Contents Society (디지털콘텐츠학회 논문지)

Digital Contents Society (한국디지털콘텐츠학회)
권호 표지
DOI QR코드

DOI QR Code

Analysis on Spatial Sampling and Implementation for Primal Trees

Primal Tree의 공간 분할 샘플링 분석 및 구현

  • 박태정 (덕성여자대학교 디지털미디어학과)
  • Received : 2014.03.30
  • Accepted : 2014.06.15
  • Published : 2014.06.30
Download PDF
⟨ Previous Next ⟩

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.

컴퓨터 그래픽스나 기하 정보 분석 및 검색 등의 애플리케이션에서 일반적인 octree가 널리 사용된다. 그러나 거리장 등 공간에 분포하는 특정한 연속 정보를 샘플링하기 위한 목적으로 일반적인 octree를 적용할 경우 샘플링 데이터 중복과 샘플링 지점과 표현 단위의 불일치가 발생한다. 이 문제를 해결하기 위해 dual octree가 제안된 바 있다. 본 논문에서는 dual octree가 일반적인 octree의 단점은 해결했으나 무한하게 분할을 수행하더라도 특정한 연속 영역에 액세스하지 못한다는 사실을 증명하고 이러한 모든 문제들을 해결할 수 있는 대안으로 Lefebvre와 Hoppe가 제안한 primal tree를 응용할 수 있음을 제시한다. 또한 트리 구조의 병렬화에 널리 사용되는 Morton code를 응용한 3차원 primal tree 검색 알고리즘을 제안한다.

Keywords

References

  1. 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.
  2. 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.
  3. 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.
  4. 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.
  5. 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. https://doi.org/10.1145/882262.882294
  6. 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.
  7. 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. https://doi.org/10.1111/j.1467-8659.2010.01775.x
  8. 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.
  9. A. Hatcher, "Algebraic Topology," Cambridge University Press, 2002.
  10. 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.