Cited in
(50)- Reducing memory requirements in scientific computing and optimal control
- Computational science and its applications -- ICCSA 2003. International conference, Montreal, Canada, May 18--21, 2003. Proceedings, Part I.
- scientific article; zbMATH DE number 2152055 (Why is no real title available?)
- Compressing isosurfaces generated with marching cubes
- Dynamically restricted codebook-based vector quantisation scheme for mesh geometry compression
- Computational science and its applications --- ICCSA 2004. International conference, Assisi, Italy, May 14--17, 2004. Proceedings, Part IV.
- Lossless compression of predicted floating-point geometry
- Topological mesh operators
- Schnyder woods for higher genus triangulated surfaces, with applications to encoding
- scientific article; zbMATH DE number 2087089 (Why is no real title available?)
- Efficient Coding of Nontriangular Mesh Connectivity
- Succinct representations of planar maps
- Spirale reversi: Reverse decoding of the edgebreaker encoding
- scientific article; zbMATH DE number 5506220 (Why is no real title available?)
- Graph-Theoretic Concepts in Computer Science
- Linear-time compression of 2-manifold polygon meshes into information-theoretically optimal number of bits
- Planar graphs, via well-orderly maps and trees
- A compact encoding of plane triangulations with efficient query supports
- Geometric compression using Riemann surface structure
- The Safari interface for visualizing time-dependent volume data using iso-surfaces and contour spectra
- Quick encoding of plane graphs in \(\log _{2}14\) bits per edge
- Fast reconstruction of Delaunay triangulations
- Piecewise Regular Meshes: Construction and Compression
- Compressing the Property Mapping of Polygon Meshes
- Near-Optimal Connectivity Encoding of 2-Manifold Polygon Meshes
- MESH
- Metro
- 3D triangulations
- 2D triangulations
- Effects of noise on quantized triangle meshes
- Edgebreaker on a Corner Table: A Simple Technique for Representing and Compressing Triangulated Surfaces
- COMPACT REPRESENTATIONS OF SIMPLICIAL MESHES IN TWO AND THREE DIMENSIONS
- Image‐Based Surface Compression
- HexaShrink
- A novel 3D mesh compression using mesh segmentation with multiple principal plane analysis
- scientific article; zbMATH DE number 5506222 (Why is no real title available?)
- scientific article; zbMATH DE number 2147453 (Why is no real title available?)
- Explicit Array-Based Compact Data Structures for Triangulations
- HexaShrink, an exact scalable framework for hexahedral meshes with attributes and discontinuities: multiresolution rendering and storage of geoscience models
- Efficient compression of non-manifold polygonal meshes
- Wrap \& Zip decompression of the connectivity of triangle meshes compressed with edgebreaker
- scientific article; zbMATH DE number 2009910 (Why is no real title available?)
- A method of 3D modeling and codec
- The vertex-adjacency dual of a triangulated irregular network has a Hamiltonian cycle.
- scientific article; zbMATH DE number 2147452 (Why is no real title available?)
- scientific article; zbMATH DE number 1962839 (Why is no real title available?)
- An Information-Theoretic Upper Bound on Planar Graphs Using Well-Orderly Maps
- Orderly spanning trees with applications to graph encoding and graph drawing
- Optimal coding and sampling of triangulations
- An edgebreaker-based efficient compression scheme for regular meshes
This page was built for software: Edgebreaker
