On the public citation graph

Duality of constrained Voronoi diagrams and Delaunay triangulations

https://doi.org/10.1007/bf01188709
0 signed · 24 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-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/978-1-4612-1098-6openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1007/bf01553881openalex-snapshot
Constrained delaunay triangulations
inferredcites →https://doi.org/10.1007/bf01840357openalex-snapshot
A sweepline algorithm for Voronoi diagrams
inferredcites →https://doi.org/10.1007/bf02187695openalex-snapshot
Generalized delaunay triangulation for planar graphs
inferredcites →https://doi.org/10.1007/bf02187890openalex-snapshot
AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segments
inferredcites →https://doi.org/10.1109/sfcs.1979.15openalex-snapshot
Efficient computation of continuous skeletons
inferredcites →https://doi.org/10.1137/0210006openalex-snapshot
Generalization of Voronoi Diagrams in the Plane
inferredcites →https://doi.org/10.1145/41958.41982openalex-snapshot
An optimal algorithm for constructing the Delaunay triangulation of a set of line segments
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9780470317013.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1002/9781118616901.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1007/3-540-48447-7_24openalex-snapshot
A Parallel Algorithm for Finding the Constrained Voronoi Diagram of Line Segments in the Plane
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_150openalex-snapshot
Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear-time
inferred← citeshttps://doi.org/10.1007/s00466-020-01867-5openalex-snapshot
Modelling 3D metal cutting problems with the particle finite element method
inferred← citeshttps://doi.org/10.1007/s11831-018-09313-9openalex-snapshot
Numerical Methods for the Modelling of Chip Formation
inferred← citeshttps://doi.org/10.1016/j.compstruc.2011.01.018openalex-snapshot
On some aspects of the CNEM implementation in 3D in order to simulate high speed machining or shearing
inferred← citeshttps://doi.org/10.1038/s41598-018-30668-3openalex-snapshot
Effects of NH4F and distilled water on structure of pores in TiO2 nanotube arrays
inferred← citeshttps://doi.org/10.1108/ec-07-2022-0492openalex-snapshot
Voronoi discretization to improve the meshless local Petrov–Galerkin method in 3D-computational fracture mechanics
inferred← citeshttps://doi.org/10.1109/icetci53161.2021.9563566openalex-snapshot
Overview of UAV path planning algorithms
inferred← citeshttps://doi.org/10.1115/omae2026-175455openalex-snapshot
Aquascan: Graph-Based Learning for Distributed Marine Sensing
inferred← citeshttps://doi.org/10.1137/s0097539795285916openalex-snapshot
Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time
inferred← citeshttps://doi.org/10.22215/etd/2014-10473openalex-snapshot
Theta-Graphs and Other Constrained Spanners
inferred← citeshttps://doi.org/10.48550/arxiv.1707.05949openalex-snapshot
On recent advances in 2D Constrained Delaunay triangulation algorithms
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.