On the public citation graph
On sorting triangles in a delaunay tessellation
0 signed · 39 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.1016/b978-0-12-587260-7.50011-xopenalex-snapshot
Software for C1 Surface Interpolation
inferredcites →https://doi.org/10.1038/scientificamerican0984-60openalex-snapshot
Data Structures and Algorithms
inferredcites →https://doi.org/10.1080/02693798708927800openalex-snapshot
Spatially ordered networks and topographic reconstructions
inferredcites →https://doi.org/10.1145/73833.73850openalex-snapshot
An acyclicity theorem for cell complexes in d dimensions
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.5987openalex-snapshot
One machine, one minute, three billion tetrahedra
inferred← citeshttps://doi.org/10.1007/3-540-36477-3_14openalex-snapshot
Java Applets for the Dynamic Visualization of Voronoi Diagrams
inferred← citeshttps://doi.org/10.1007/3-540-57207-4_17openalex-snapshot
Computing visibility maps on a digital terrain model
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/bf02122779openalex-snapshot
An acyclicity theorem for cell complexes ind dimension
inferred← citeshttps://doi.org/10.1007/bf02187810openalex-snapshot
Toughness and Delaunay triangulations
inferred← citeshttps://doi.org/10.1007/s00453-001-0014-xopenalex-snapshot
A One-Step Crust and Skeleton Extraction Algorithm
inferred← citeshttps://doi.org/10.1007/s10596-012-9305-3openalex-snapshot
Walking algorithms for point location in TIN models
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.1016/b978-044482537-7/50008-5openalex-snapshot
Applications of Computational Geometry to Geographic Information Systems
inferred← citeshttps://doi.org/10.1016/j.procs.2010.04.025openalex-snapshot
Star-shaped polyhedron point location with orthogonal walk algorithm
inferred← citeshttps://doi.org/10.1016/s0096-3003(02)00608-2openalex-snapshot
Remarks on the computation of the horizon of a digital terrain
inferred← citeshttps://doi.org/10.1017/cbo9781107359970.009openalex-snapshot
Counting lattice triangulations
inferred← citeshttps://doi.org/10.1023/a:1009708413602openalex-snapshot
Visibility Computations on Hierarchical Triangulated Terrain Models
inferred← citeshttps://doi.org/10.1023/a:1009942427413openalex-snapshot
Removing Degeneracies by Perturbing the Problem or Perturbing the World
inferred← citeshttps://doi.org/10.1068/b12979openalex-snapshot
Algorithms for Visibility Computation on Terrains: A Survey
inferred← citeshttps://doi.org/10.1080/02693799408901985openalex-snapshot
Visibility algorithms on triangulated digital terrain models
inferred← citeshttps://doi.org/10.1080/02693799408902019openalex-snapshot
Parallelizing visibility computations on triangulated terrains
inferred← citeshttps://doi.org/10.1080/02693799608902080openalex-snapshot
Outside-in: an alternative approach to forest map digitizing
inferred← citeshttps://doi.org/10.1080/136588197242310openalex-snapshot
Simple traversal of a subdivision without extra storage
inferred← citeshttps://doi.org/10.1145/116873.116880openalex-snapshot
Voronoi diagrams—a survey of a fundamental geometric data structure
inferred← citeshttps://doi.org/10.1145/73833.73850openalex-snapshot
An acyclicity theorem for cell complexes in d dimensions
inferred← citeshttps://doi.org/10.17273/book.2002.1openalex-snapshot
Delaunay triangulation and its applications
inferred← citeshttps://doi.org/10.17273/book.2006.1openalex-snapshot
Algorithms for triangulation construction and analisys
inferred← citeshttps://doi.org/10.4018/978-1-7998-1290-6.ch012openalex-snapshot
Methods for Extracting the Skeleton of an Image Based on Cellular Automata With a Hexagonal Coating Form and Radon Transform
inferred← citeshttps://doi.org/10.4018/978-1-7998-1415-3.ch015openalex-snapshot
Intellectual Measuring Complex for Control of Geometrical Parameters of Aviation Details
inferred← citeshttps://doi.org/10.48456/tr-728openalex-snapshot
A robust efficient algorithm for point location in triangulations
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.