Jiro Inoue
ABSTRACT
Sphere packing arrangements are frequently found in nature, exhibiting efficient space-filling and energy minimization properties. Close sphere packings provide a tight, uniform, and highly symmetric spatial sampling at a single resolution. We introduce the Multiresolution Sphere Packing Tree (MSP-tree): a hierarchical spatial data structure based on sphere packing arrangements suitable for 3D space representation and selective refinement. Compared to the commonly used octree, MSP-tree offers three advantages: a lower fanout (a factor of four compared to eight), denser packing (about 24% denser), and persistence (sphere centers at coarse resolutions persist at finer resolutions). We present MSP-tree both as a region-based approach that describes the refinement mechanism succintly and intuitively, and as a lattice-based approach better suited for implementation. The MSP-tree offers a robust, highly symmetric tessellation of 3D space with favorable image processing properties.
- Bentley, J. L. 1975. Multidimensional binary search trees used for associative searching. Commun. ACM 18, 9, 509--517. Google Scholar
Digital Library
- Bey, J. 1995. Tetrahedral grid refinement. Computing 55, 13 (December), 355--378. Google ScholarDigital Library
- De Floriani, L., Kobbelt, L., and Puppo, E. 2005. A survey on data structures for level-of-detail models. In Advances in Multiresolution and Geometric Modelling, Springer, N. A. Dodgson, M. S. Floater, and M. A. Sabin, Eds., 49--74.Google Scholar
- Entezari, A., Meng, T., Bergner, S., and Móller, T. 2006. A granular three dimensional multiresolution transform. In Proceedings of Eurographics/IEEE-VGTC Symposium on Visualization 2006 (EuroVis 2006), 267--274. Google ScholarDigital Library
- Greiner, G., and Grosso, R. 2000. Hierarchical tetrahedraloctahedral subdivision for volume visualization. The Visual Computer 16, 6 (October), 357--369.Google ScholarCross Ref
- Kobbelt, L. 2000. √3-subdivision. In Proceedings of ACM SIGGRAPH 2000, ACM Press/Addison-Wesley Publishing Co., New York, NY, USA, 103--112. Google ScholarDigital Library
- Linsen, L., Pascucci, V., Duchaineau, M. A., Hamann, B., and Joy, K. I. 2004. Wavelet-based multiresolution with n-th-root-of-2 subdivision. In Journal on Computing, special edition. Google ScholarDigital Library
- Maubach, J. M. 1995. Local bisection refinement for n-simplicial grids generated by reflection. SIAM Journal on Scientific Computing 16, 1, 210--227. Google ScholarDigital Library
- Peterson, P. 2003. Close-packed, uniformly adjacent, multiresolutional, overlapping spatial data ordering. Canadian Patent Application 2436312 (August 2003), United States Patent Application 20060265197 (November 2006).Google Scholar
- Popović, J., and Hoppe, H. 1997. Progressive simplicial complexes. In Proceedings of ACM SIGGRAPH 1997, ACM Press/Addison-Wesley Publishing Co., New York, NY, USA, 217--224. Google ScholarDigital Library
- PYXIS Innovation Inc. 2006. Mathematics for a new grid system. www.pyxisinnovation.com/pyxwiki?title=Mathematics_for_a_New_Grid_System, viewed December 2007.Google Scholar
- Sahr, K., and White, D. 1998. Discrete global grid systems. In Computing Science and Statistics: Proceeedings of the 30th symposium on the interface, Interface Foundation of North America, S. Weisberg, Ed., vol. 30, 269--278.Google Scholar
- Sahr, K., White, D., and Kimerling, A. J. 2003. Geodesic discrete global grid systems. Cartography and Geographic Information Science 30, 2, 121--134.Google ScholarCross Ref
- Staadt, O. G., and Gross, M. H. 1998. Progressive tetrahedralizations. vis 00, 397. Google ScholarDigital Library
- Sweldens, W. 1995. Lifting scheme: a new philosophy in biorthogonal wavelet constructions. In Wavelet applications in signal and image processing III; Proceedings of SPIE 2569, 68--79.Google Scholar
- Ville, D. V. D., Blu, T., and Unser, M. 2005. On the multidimensional extension of the quincunx subsampling matrix. IEEE Signal Processing Letters 12, 2 (February), 112--115.Google Scholar
- Zhang, S. 1995. Successive subdivision of tetrahedra and multi-grid methods on tetrahedral meshes. Houston Journal of Mathematics 21, 3, 541--556.Google Scholar
Index Terms
- Multiresolution sphere packing tree: a hierarchical multiresolution 3D data structure
Recommendations
Online circle and sphere packing
AbstractIn this paper we consider the Online Bin Packing Problem in three variants: Circles in Squares, Circles in Isosceles Right Triangles, and Spheres in Cubes. The two first ones receive an online sequence of circles (items) of different ...
Packing circles and spheres on surfaces
Inspired by freeform designs in architecture which involve circles and spheres, we introduce a new kind of triangle mesh whose faces' incircles form a packing. As it turns out, such meshes have a rich geometry and allow us to cover surfaces with circle ...
Transitive Mesh Space of a Progressive Mesh
This paper investigates the set of all selectively refined meshes that can be obtained from a progressive mesh. We call the set the transitive mesh space of a progressive mesh and present a theoretical analysis of the space. We define selective edge ...
Comments