Edgebreaker

swMATH4117MaRDI QIDQ16304FDOQ16304

Author name not available (Why is that?)

Cited In (46)

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

This page was built for software: Edgebreaker