On the public citation graph
Succinct Representation of Triangulations with a Boundary
0 signed · 54 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-26808-1_1openalex-snapshot
Recent Advances in Compression of 3D Meshes
inferredcites →https://doi.org/10.1007/3-540-45061-0_83openalex-snapshot
Optimal Coding and Sampling of Triangulations
inferredcites →https://doi.org/10.1007/3-540-46632-0_3openalex-snapshot
Static Dictionaries Supporting Rank
inferredcites →https://doi.org/10.1007/b138117openalex-snapshot
Advances in Multiresolution for Geometric Modelling
inferredcites →https://doi.org/10.1007/bfb0055046openalex-snapshot
Compact encodings of planar graphs via canonical orderings and multiple parentheses
inferredcites →https://doi.org/10.1080/10867651.2001.10487533openalex-snapshot
Star-Vertices: A Compact Representation for Planar Meshes with Adjacency Information
inferredcites →https://doi.org/10.1109/sfcs.1989.63533openalex-snapshot
Space-efficient static trees and graphs
inferredcites →https://doi.org/10.1137/s0097539799364092openalex-snapshot
Succinct Representation of Balanced Parentheses and Static Trees
inferredcites →https://doi.org/10.1184/r1/6604223openalex-snapshot
Compact Representations of Separable Graphs
inferredcites →https://doi.org/10.5555/313852.314087openalex-snapshot
Efficient suffix trees on secondary storage
inferredcites →https://doi.org/10.5555/365411.365518openalex-snapshot
Orderly Spanning Trees with Applications to Graph Encoding and Graph Drawing
inferredcites →https://doi.org/10.5555/365411.365526openalex-snapshot
Representing dynamic binary trees succinctly
inferredcites →https://doi.org/10.5555/545381.545411openalex-snapshot
Succinct indexable dictionaries with applications to encoding k-ary trees and multisets
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_589openalex-snapshot
Triangulation Data Structures
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_646openalex-snapshot
Compressed Representations of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-32686-9_35openalex-snapshot
Implementing the Topological Model Succinctly
inferred← citeshttps://doi.org/10.1007/978-3-319-62127-2_33openalex-snapshot
Fast and Compact Planar Embeddings
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_29openalex-snapshot
Succinct Representation of Labeled Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-77891-2_12openalex-snapshot
A Compact Encoding of Plane Triangulations with Efficient Query Supports
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_23openalex-snapshot
Compact Navigation and Distance Oracles for Graphs with Small Treewidth
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_33openalex-snapshot
Explicit Array-Based Compact Data Structures for Triangulations
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_589-1openalex-snapshot
Triangulation Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_646-1openalex-snapshot
Compressed Representations of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-28076-4_4openalex-snapshot
Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression
inferred← citeshttps://doi.org/10.1007/978-3-642-40273-9_15openalex-snapshot
Succinct and Implicit Data Structures for Computational Geometry
inferred← citeshttps://doi.org/10.1007/s00453-006-0114-8openalex-snapshot
Optimal Coding and Sampling of Triangulations
inferred← citeshttps://doi.org/10.1007/s00453-010-9452-7openalex-snapshot
Succinct Representation of Labeled Graphs
inferred← citeshttps://doi.org/10.1007/s00453-012-9712-9openalex-snapshot
Compact Navigation and Distance Oracles for Graphs with Small Treewidth
inferred← citeshttps://doi.org/10.1007/s00453-015-0086-7openalex-snapshot
I/O-Efficient Path Traversal in Succinct Planar Graphs
inferred← citeshttps://doi.org/10.1007/s00453-021-00861-4openalex-snapshot
Succinct Encoding of Binary Strings Representing Triangulations
inferred← citeshttps://doi.org/10.1007/s00454-009-9169-zopenalex-snapshot
Schnyder Woods for Higher Genus Triangulated Surfaces, with Applications to Encoding
inferred← citeshttps://doi.org/10.1016/j.comgeo.2020.101630openalex-snapshot
Fast and compact planar embeddings
inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101922openalex-snapshot
Navigating planar topologies in near-optimal space and time
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.06.014openalex-snapshot
A compact encoding of plane triangulations with efficient query supports
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.08.016openalex-snapshot
Succinct representations of planar maps
inferred← citeshttps://doi.org/10.1109/sibgrapi.2012.24openalex-snapshot
ESQ: Editable SQuad Representation for Triangle Meshes
inferred← citeshttps://doi.org/10.1109/viz.2009.31openalex-snapshot
Total or Selective Decompression of a Compressed Plane Triangulation
inferred← citeshttps://doi.org/10.1111/j.1467-8659.2009.01508.xopenalex-snapshot
Random Accessible Hierarchical Mesh Compression for Interactive Visualization
inferred← citeshttps://doi.org/10.1137/1.9781611973068.70openalex-snapshot
Succinct Geometric Indexes Supporting Point Location Queries
inferred← citeshttps://doi.org/10.1142/s021819591100372xopenalex-snapshot
CATALOG-BASED REPRESENTATION OF 2D TRIANGULATIONS
inferred← citeshttps://doi.org/10.1145/1137856.1137902openalex-snapshot
Optimal succinct representations of planar maps
inferred← citeshttps://doi.org/10.1145/1377676.1377730openalex-snapshot
Schnyder woods for higher genus triangulated surfaces
inferred← citeshttps://doi.org/10.1145/2151171.2151173openalex-snapshot
Succinct geometric indexes supporting point location queries
inferred← citeshttps://doi.org/10.1145/997817.997854openalex-snapshot
Towards in-place geometric algorithms and data structures
inferred← citeshttps://doi.org/10.1201/9780429171529-31openalex-snapshot
Terrain Modeling for the Geosciences
inferred← citeshttps://doi.org/10.22456/2175-2745.6011openalex-snapshot
3D Compression: from A to Zip a first complete example
inferred← citeshttps://doi.org/10.26439/interfases2022.n015.5886openalex-snapshot
A Distributed Model for Computing 3D Mesh Local Descriptors Based on k-Rings
inferred← citeshttps://doi.org/10.48550/arxiv.1308.4469openalex-snapshot
External Memory Algorithms For Path Traversal in Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1806.01799openalex-snapshot
Survey and Taxonomy of Lossless Graph Compression and Space-Efficient Graph Representations
inferred← citeshttps://doi.org/10.5555/1496770.1496840openalex-snapshot
Succinct geometric indexes supporting point location queries
inferred← citeshttps://doi.org/10.70675/a10b6b44z60c8z4399z89c1zb98014c4129eopenalex-snapshot
Compression de maillages de grande taille
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.