Grouper: A Compact, Streamable Triangle Mesh Data Structure

No abstract is available for this paper.

• Publication year

  2014

• Venue

  IEEE Transactions on Visualization and Computer Graphics

• Publication date

  Unknown publication date

• Fields of study

  Medicine, Computer Science

• Identifiers
  DOI 10.1109/TVCG.2013.81PMID 24201328
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar, PubMed

• No claims are published for this paper.

• No concepts are published for this paper.

• Grouper: A Compact, Streamable Triangle Mesh Data Structure.

  2013cited by this paper
• Zipper: A compact connectivity data structure for triangle meshes

  2013cited by this paper
• Streaming Connected Component Computation for Trillion Voxel Images

  2011cited by this paper
• LR: compact connectivity representation for triangle meshes

  2011cited by this paper
• SQuad: Compact Representation for Triangle Meshes

  2011influential reference
• Streaming Algorithms for Independent Sets

  2010cited by this paper
• Random Accessible Mesh Compression Using Mesh Chartification

  2009cited by this paper
• Streaming surface sampling using Gaussian ε-nets

  2009influential reference
• Streaming tetrahedral mesh optimization

  2008cited by this paper
• A streaming algorithm for surface reconstruction

  2007cited by this paper
• Streaming Simplification of Tetrahedral Meshes

  2007cited by this paper
• Multilevel streaming for out-of-core surface reconstruction

  2007cited by this paper
• Random-Accessible Compressed Triangle Meshes

  2007cited by this paper
• Robust on-line computation of Reeb graphs: simplicity and speed

  2007cited by this paper
• Streaming computation of Delaunay triangulations

  2006cited by this paper
• Out-of-Core Remeshing of Large Polygonal Meshes

  2006cited by this paper
• Streaming compression of triangle meshes

  2005cited by this paper
• Tripod � a minimalist data structure for embedded triangulations

  2005cited by this paper
• VISUALIZATION AND COMPUTER GRAPHICS

  2005cited by this paper
• Streaming meshes

  2005influential reference
• Adaptive tetrapuzzles: efficient out-of-core construction and visualization of gigantic multiresolution polygonal models

  2004cited by this paper
• Quick-VDR: interactive view-dependent rendering of massive models

  2004cited by this paper
• A Stream Algorithm for the Decimation of Massive Meshes

  2003cited by this paper
• Out-of-core compression for gigantic polygon meshes

  2003cited by this paper
• Edgebreaker on a Corner Table: A Simple Technique for Representing and Compressing Triangulated Surfaces

  2003influential reference
• Large mesh simplification using processing sequences

  2003cited by this paper
• External Memory Management and Simplification of Huge Meshes

  2003cited by this paper
• XFastMesh: fast view-dependent meshing from external memory

  2002cited by this paper
• An out-of-core method for computing connectivities of large unstructured meshes

  2002cited by this paper
• Out-of-core build of a topological data structure from polygon soup

  2001cited by this paper
• Parallel programming in openMP

  2000cited by this paper
• Out-of-core simplification of large polygonal models

  2000cited by this paper
• Fortran Subroutines For Approximate Solution Of Maximum Independent Set Problems Using Grasp

  1998cited by this paper
• Greed is good: Approximating independent sets in sparse and bounded-degree graphs

  1997cited by this paper
• I/O optimal isosurface extraction

  1997cited by this paper
• Greed is good: approximating independent sets in sparse and bounded-degree graphs

  1993influential reference
• Introduction to Solid Modeling

  1988cited by this paper
• Eurographics Symposium on Geometry Processing 2009 Random Accessible Hierarchical Mesh Compression for Interactive Visualization

  year unknowncited by this paper

• Triangular matrix-based lossless compression algorithm for 3D mesh connectivity

  2024cites this paper
• A Task-Parallel Approach for Localized Topological Data Structures

  2023cites this paper
• A Distributed Model for Computing 3D Mesh Local Descriptors Based on k-Rings

  2022cites this paper
• IBNC: Integrated Boundary and Natural CSG for Polyhedra (Review, Simplifications, and Integration of Prior Art)

  2022cites this paper
• TopoCluster: A Localized Data Structure for Topology-based Visualization

  2021cites this paper
• Modelling and managing massive 3D data of the built environment

  2020cites this paper
• A 3D Model Compression Method for Large Scenes

  2018cites this paper
• The Topology ToolKit

  2018cites this paper
• Hierarchical representation for rasterized planar face complexes

  2018cites this paper
• Compactly representing massive terrain models as TINs in CityGML

  2018cites this paper
• Packing Vertex Data into Hardware-Decompressible Textures

  2018cites this paper
• The Stellar decomposition: A compact representation for simplicial complexes and beyond

  2017cites this paper
• Rasterized Planar Face Complex

  2017cites this paper
• The Stellar tree: a Compact Representation for Simplicial Complexes and Beyond

  2017cites this paper
• Triangulation Data Structures

  2016cites this paper
• COMPARATIVE ANALYSIS OF DATA STRUCTURES FOR STORING MASSIVE TINS IN A DBMS

  2016cites this paper
• Compact data structures for triangulations

  2015cites this paper
• 3D Mesh Compression

  2015cites this paper
• 39 3 D mesh compression : survey , comparisons and emerging trends

  2015cites this paper
• Mini Review on Efficient Data Structure For 3D Modelling of Polygonal Mesh

  2015cites this paper