On the public citation graph

An acyclicity theorem for cell complexes ind dimension

0 signed · 67 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/bf01759057openalex-snapshot
On sorting triangles in a delaunay tessellation
inferredcites →https://doi.org/10.1016/0146-664x(82)90117-4openalex-snapshot
Fundamentals of interactive computer graphics
inferredcites →https://doi.org/10.1016/s0019-9958(85)80045-0openalex-snapshot
How to search in history
inferredcites →https://doi.org/10.1109/tit.1983.1056714openalex-snapshot
On the shape of a set of points in the plane
inferredcites →https://doi.org/10.1137/0216006openalex-snapshot
Power Diagrams: Properties, Algorithms and Applications
inferredcites →https://doi.org/10.1145/800250.807481openalex-snapshot
On visible surface generation by a priori tree structures
inferredcites →https://doi.org/10.1145/965105.807481openalex-snapshot
On visible surface generation by a priori tree structures
inferredcites →https://doi.org/10.1515/crll.1908.133.97openalex-snapshot
Nouvelles applications des paramètres continus à la théorie des formes quadratiques. Premier mémoire. Sur quelques propriétés des formes quadratiques positives parfaites.
inferredcites →https://doi.org/10.2307/2325168openalex-snapshot
Algorithms in Combinatorial Geometry.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/nme.3016openalex-snapshot
3D boundary recovery by constrained Delaunay tetrahedralization
inferred← citeshttps://doi.org/10.1007/3-540-46632-0_12openalex-snapshot
Online Routing in Triangulations
inferred← citeshttps://doi.org/10.1007/3-540-47738-1_31openalex-snapshot
Nonregular triangulations, view graphs of triangulations, and linear programming duality
inferred← citeshttps://doi.org/10.1007/3-540-58795-0_37openalex-snapshot
Hierarchical hypersurface modeling
inferred← citeshttps://doi.org/10.1007/978-3-540-30140-0_62openalex-snapshot
Classroom Examples of Robustness Problems in Geometric Computations
inferred← citeshttps://doi.org/10.1007/978-3-540-45077-1_21openalex-snapshot
On Lawson’s Oriented Walk in Random Delaunay Triangulations
inferred← citeshttps://doi.org/10.1007/978-3-642-55566-4_17openalex-snapshot
Surface Reconstruction by Wrapping Finite Sets in Space
inferred← citeshttps://doi.org/10.1007/978-3-662-03567-2_1openalex-snapshot
Tetrahedra Based Volume Visualization
inferred← citeshttps://doi.org/10.1007/bf01975867openalex-snapshot
Incremental topological flipping works for regular triangulations
inferred← citeshttps://doi.org/10.1007/bf02187810openalex-snapshot
Toughness and Delaunay triangulations
inferred← citeshttps://doi.org/10.1007/s00454-004-1089-3openalex-snapshot
Dense Point Sets Have Sparse Delaunay Triangulations or ?... But Not Too Nasty?
inferred← citeshttps://doi.org/10.1007/s00454-008-9060-3openalex-snapshot
General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties
inferred← citeshttps://doi.org/10.1007/s00454-011-9375-3openalex-snapshot
Weakly Regular Subdivisions
inferred← citeshttps://doi.org/10.1007/s10851-017-0734-4openalex-snapshot
Overview of Shelling for 2-Manifold Surface Reconstruction Based on 3D Delaunay Triangulation
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00028-bopenalex-snapshot
Why is the 3D Delaunay triangulation difficult to construct?
inferred← citeshttps://doi.org/10.1016/0097-8493(94)90002-7openalex-snapshot
Terrain visibility
inferred← citeshttps://doi.org/10.1016/0925-7721(92)90001-9openalex-snapshot
Farthest neighbors, maximum spanning trees and related problems in higher dimensions
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50006-1openalex-snapshot
Voronoi Diagrams**Partially supported by the Deutsche Forschungsgemeinschaft, grant K1 655 2-2.
inferred← citeshttps://doi.org/10.1017/cbo9781107359970.009openalex-snapshot
Counting lattice triangulations
inferred← citeshttps://doi.org/10.1109/2945.485616openalex-snapshot
A multiscale model for structure-based volume rendering
inferred← citeshttps://doi.org/10.1109/2945.597797openalex-snapshot
The lazy sweep ray casting algorithm for rendering irregular grids
inferred← citeshttps://doi.org/10.1109/2945.646238openalex-snapshot
Multiresolution representation and visualization of volume data
inferred← citeshttps://doi.org/10.1109/cvpr46437.2021.01393openalex-snapshot
DeRF: Decomposed Radiance Fields
inferred← citeshttps://doi.org/10.1109/dcc.2005.85openalex-snapshot
TetStreamer: Compressed Back-to-Front Transmission of Delaunay Tetrahedra Meshes
inferred← citeshttps://doi.org/10.1109/ipdps.2010.5470471openalex-snapshot
Midpoint routing algorithms for Delaunay triangulations
inferred← citeshttps://doi.org/10.1109/svv.1996.558038openalex-snapshot
Fast rendering of irregular grids
inferred← citeshttps://doi.org/10.1109/svv.1998.729589openalex-snapshot
An exact interactive time visibility ordering algorithm for polyhedral cell complexes
inferred← citeshttps://doi.org/10.1109/visual.1995.480789openalex-snapshot
Interval set: a volume rendering technique generalizing isosurface extraction
inferred← citeshttps://doi.org/10.1109/visual.2001.964514openalex-snapshot
Cell-projection of cyclic meshes
inferred← citeshttps://doi.org/10.1111/1467-8659.00357openalex-snapshot
Fast Polyhedral Cell Sorting for Interactive Rendering of Unstructured Grids
inferred← citeshttps://doi.org/10.1111/cgf.70037openalex-snapshot
Isosurface Extraction for Signed Distance Functions using Power Diagrams
inferred← citeshttps://doi.org/10.1137/s0097539700369387openalex-snapshot
Online Routing in Triangulations
inferred← citeshttps://doi.org/10.1137/s0097539702411368openalex-snapshot
Pseudotriangulations from Surfaces and a Novel Type of Edge Flip
inferred← citeshttps://doi.org/10.1142/s0129054102001047openalex-snapshot
WALKING IN A TRIANGULATION
inferred← citeshttps://doi.org/10.1142/s0218195997000065openalex-snapshot
Parallelizing an Algorithm for Visibility on Polyhedral Terrain
inferred← citeshttps://doi.org/10.1145/142675.142688openalex-snapshot
Incremental topological flipping works for regular triangulations
inferred← citeshttps://doi.org/10.1145/197938.197952openalex-snapshot
Multiresolution modeling and visualization of volume data based on simplicial complexes
inferred← citeshttps://doi.org/10.1145/218013.218054openalex-snapshot
Pyramidal simplicial complexes
inferred← citeshttps://doi.org/10.1145/220279.220303openalex-snapshot
Triangulations intersect nicely
inferred← citeshttps://doi.org/10.1145/237218.237396openalex-snapshot
Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations
inferred← citeshttps://doi.org/10.1145/276884.276893openalex-snapshot
A condition guaranteeing the existence of higher-dimensional constrained Delaunay triangulations
inferred← citeshttps://doi.org/10.1145/288126.288170openalex-snapshot
An exact interactive time visibility ordering algorithm for polyhedral cell complexes
inferred← citeshttps://doi.org/10.1145/304893.304911openalex-snapshot
Topological beam tracing
inferred← citeshttps://doi.org/10.1145/3394486.3403266openalex-snapshot
Voronoi Graph Traversal in High Dimensions with Applications to Topological Data Analysis and Piecewise Linear Interpolation
inferred← citeshttps://doi.org/10.1145/378583.378643openalex-snapshot
Walking in a triangulation
inferred← citeshttps://doi.org/10.1201/b12987-17openalex-snapshot
Meshing piecewise smooth complexes
inferred← citeshttps://doi.org/10.18419/opus-2510openalex-snapshot
Direct volume visualization of geometrically unpleasant meshes
inferred← citeshttps://doi.org/10.20537/2076-7633-2014-6-2-203-215openalex-snapshot
Space-marching algorithm for solving radiative transfer problem based on short-characteristics method
inferred← citeshttps://doi.org/10.20948/prepr-2018-193openalex-snapshot
Сells’ bypassing algorithm for characteristic methods of transport equation solving
inferred← citeshttps://doi.org/10.3103/s1066369x12010045openalex-snapshot
The Delaunay triangulation for multidimensional surfaces and its approximative properties
inferred← citeshttps://doi.org/10.3929/ethz-a-004222924openalex-snapshot
Algorithms and software for radio signal coverage prediction in terrains
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0110030openalex-snapshot
Dense point sets have sparse Delaunay triangulations
inferred← citeshttps://doi.org/10.5281/zenodo.3893142openalex-snapshot
Modelling Three-dimensional fields in geoscience with the Voronoi diagram and its dual
inferred← citeshttps://doi.org/10.5555/236226.236228openalex-snapshot
Fast rendering of irregular grids
inferred← citeshttps://doi.org/10.5555/545381.545397openalex-snapshot
Dense point sets have sparse Delaunay triangulations: or "…but not too nasty"
inferred← citeshttps://doi.org/10.5555/601671.601704openalex-snapshot
Cell-projection of cyclic meshes
inferred← citeshttps://doi.org/10.5555/832271.833840openalex-snapshot
Interval set: a volume rendering technique generalizing isosurface extraction
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.