{"id":{"repo_id":"queens","oai_identifier":"oai:queensu.scholaris.ca:1974/7324"},"canonical_url":"https://search.dev.ndltd.org/etd/queens/oai:queensu.scholaris.ca:1974/7324","repository":{"repo_id":"queens","name":"Queens University","base_url":"https://qspace.library.queensu.ca/server/oai/request"},"display":{"title":"Compact 3D Representations","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Inoue, Jiro"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Computing","school":null,"contributors":[],"advisors":["Stewart, James"],"committee_chairs":[],"committee_members":[],"year":2012,"date_issued":"2012-07-18","date_published":"2012-07-18","updated_at":"2026-07-27T20:35:19Z","subjects":["3D data","hierarchical subdivision","mesh compression","computer science"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1974/7324","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.department","label":"Department","values":["Computing"]},{"key":"dc:contributor.supervisor","label":"Supervisor","values":["Stewart, James"]},{"key":"dc:creator","label":"Author","values":["Inoue, Jiro"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2012-07-17 15:28:39.406"]},{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2012-07-18T15:25:05Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2012-07-18T15:25:05Z"]},{"key":"dc:date.issued","label":"Date","values":["2012-07-18"]},{"key":"dc:type","label":"Dc Type","values":["thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["3D data","hierarchical subdivision","mesh compression","computer science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1974/7324"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (Ph.D, Computing) -- Queen's University, 2012-07-17 15:28:39.406"]},{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["PhD"]},{"key":"dc:title","label":"Title","values":["Compact 3D Representations"]}]}],"canonical_facts":{"dc:contributor.department":["Computing"],"dc:contributor.supervisor":["Stewart, James"],"dc:creator":["Inoue, Jiro"],"dc:date":["2012-07-17 15:28:39.406"],"dc:date.accessioned":["2012-07-18T15:25:05Z"],"dc:date.available":["2012-07-18T15:25:05Z"],"dc:date.issued":["2012-07-18"],"dc:description":["Thesis (Ph.D, Computing) -- Queen's University, 2012-07-17 15:28:39.406"],"dc:description.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."],"dc:description.degree":["PhD"],"dc:identifier.uri":["http://hdl.handle.net/1974/7324"],"dc:language.iso":["eng"],"dc:subject":["3D data","hierarchical subdivision","mesh compression","computer science"],"dc:title":["Compact 3D Representations"],"dc:type":["thesis"]},"updated_at":"2026-07-27T20:35:19Z"}