The need to compactly represent 3D data is motivated by the ever-increasing size
of these data. Furthermore, for large data sets it is useful to randomly access and
process a small part of the data. In this thesis we propose two methods of compactly
representing 3D data while allowing random access.
The first is the multiresolution sphere-packing tree (MSP-tree). The MSP-tree is a
multiresolution 3D hierarchy on regular grids based on sphere-packing arrangements.
The grids of the MSP-tree compactly represent underlying point-sampled data by
using more efficient grids than existing methods while maintaining high granularity
and a hierarchical structure that allows random access.
The second is distance-ranked random-accessible mesh compression (DR-RAMC).
DR-RAMC is a lossless simplicial mesh compressor that allows random access and
decompression of the mesh data based on a spatial region-of-interest. DR-RAMC encodes
connectivity based on relative proximity of vertices to each other and organizes
both this proximity data and vertex coordinates using a k-d tree. DR-RAMC is insensitive
to a variety of topological mesh problems (e.g. holes, handles, non-orientability)
and can compress simplicial meshes of any dimension embedded in spaces of any dimension.
Testing of DR-RAMC shows competitive compression rates for triangle
meshes and first-ever random accessible compression rates for tetrahedral meshes. / Thesis (Ph.D, Computing) -- Queen's University, 2012-07-17 15:28:39.406
Identifer | oai:union.ndltd.org:LACETR/oai:collectionscanada.gc.ca:OKQ.1974/7324 |
Date | 18 July 2012 |
Creators | Inoue, JIRO |
Contributors | Queen's University (Kingston, Ont.). Theses (Queen's University (Kingston, Ont.)) |
Source Sets | Library and Archives Canada ETDs Repository / Centre d'archives des thèses électroniques de Bibliothèque et Archives Canada |
Language | English, English |
Detected Language | English |
Type | Thesis |
Rights | This publication is made available by the authority of the copyright owner solely for the purpose of private study and research and may not be copied or reproduced except as permitted by the copyright laws without written authority from the copyright owner. |
Relation | Canadian theses |
Page generated in 0.0017 seconds