Queen's University - Utility Bar

QSpace at Queen's University >
Graduate Theses, Dissertations and Projects >
Queen's Graduate Theses and Dissertations >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1974/7324

Title: Compact 3D Representations
Authors: Inoue, JIRO

Files in This Item:

File Description SizeFormat
INOUE_JIRO_201207_PHD.pdf8.24 MBAdobe PDFView/Open
Keywords: 3D data
hierarchical subdivision
mesh compression
computer science
Issue Date: 18-Jul-2012
Series/Report no.: Canadian theses
Abstract: 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.
Description: Thesis (Ph.D, Computing) -- Queen's University, 2012-07-17 15:28:39.406
URI: http://hdl.handle.net/1974/7324
Appears in Collections:Queen's Graduate Theses and Dissertations
School of Computing Graduate Theses

Items in QSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


  DSpace Software Copyright © 2002-2008  The DSpace Foundation - TOP