On the public citation graph
Voronoi diagrams based on general metrics in the plane
0 signed · 62 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.1002/net.3230140304openalex-snapshot
Euclidean shortest paths in the presence of rectilinear barriers
inferredcites →https://doi.org/10.1002/zamm.19610411042openalex-snapshot
W. Rinow, Die innere Geometrie der metrischen Räume. XVI + 520 S. Berlin/Göttingen/Heidelberg 1961. Springer‐Verlag. Preis geb. DM 83,—
inferredcites →https://doi.org/10.1007/3-540-19422-3_5openalex-snapshot
A sweepcircle algorithm for Voronoi diagrams
inferredcites →https://doi.org/10.1007/978-3-662-11499-5openalex-snapshot
Die innere Geometrie der metrischen Räume
inferredcites →https://doi.org/10.1007/978-3-7091-6110-4_20openalex-snapshot
Untersuchungen über allgemeine Metrik
inferredcites →https://doi.org/10.1007/bf01448840openalex-snapshot
Untersuchungen �ber allgemeine Metrik
inferredcites →https://doi.org/10.1007/bf01840357openalex-snapshot
A sweepline algorithm for Voronoi diagrams
inferredcites →https://doi.org/10.1016/0020-0190(79)90074-7openalex-snapshot
Voronoi diagrams from convex hulls
inferredcites →https://doi.org/10.1137/0209017openalex-snapshot
Voronoui Diagrams in $L_1 (L_\infty )$ Metrics with 2-Dimensional Storage Applications
inferredcites →https://doi.org/10.1145/322123.322124openalex-snapshot
An O ( n log n ) Algorithm for Rectilinear Minimal Spanning Trees
inferredcites →https://doi.org/10.1145/322217.322219openalex-snapshot
Two-Dimensional Voronoi Diagrams in the L p -Metric
inferredcites →https://doi.org/10.1145/323233.323258openalex-snapshot
Distance problems in computational geometry with fixed orientations
inferredcites →https://doi.org/10.1145/323233.323264openalex-snapshot
Voronoi diagrams based on convex distance functions
inferredcites →https://doi.org/10.1145/41958.41963openalex-snapshot
On the geodesic Voronoi diagram of point sites in a simple polygon
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/1097-0037(200010)36:3<156::aid-net2>3.0.co;2-lopenalex-snapshot
The graph Voronoi diagram with applications
inferred← citeshttps://doi.org/10.1007/11602613_100openalex-snapshot
Shortest Paths and Voronoi Diagrams with Transportation Networks Under General Distances
inferred← citeshttps://doi.org/10.1007/3-540-48447-7_8openalex-snapshot
Optimizing Constrained Offset and Scaled Polygonal Annuli
inferred← citeshttps://doi.org/10.1007/3-540-50335-8_31openalex-snapshot
Abstract voronoi diagrams and their applications
inferred← citeshttps://doi.org/10.1007/3-540-50728-0_61openalex-snapshot
Voronoi diagrams in the moscow metric
inferred← citeshttps://doi.org/10.1007/3-540-52282-4_46openalex-snapshot
On the construction of abstract voronoi diagrams
inferred← citeshttps://doi.org/10.1007/3-540-52292-1_26openalex-snapshot
Combinatorial properties of abstract Voronoi diagrams
inferred← citeshttps://doi.org/10.1007/3-540-58338-6_76openalex-snapshot
“The big sweep”: On the power of the wavefront approach to Voronoi diagrams
inferred← citeshttps://doi.org/10.1007/3-540-63307-3_60openalex-snapshot
Voronoi diagrams for polygon-offset distance functions
inferred← citeshttps://doi.org/10.1007/978-3-319-53007-9_3openalex-snapshot
Voronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function
inferred← citeshttps://doi.org/10.1007/978-3-319-94776-1_12openalex-snapshot
Computing Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons
inferred← citeshttps://doi.org/10.1007/978-3-319-97785-0_25openalex-snapshot
Line Voronoi Diagrams Using Elliptical Distances
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_58openalex-snapshot
On the Stretch Factor of Convex Delaunay Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-41905-8_6openalex-snapshot
Proximity and Motion Planning on ℓ1-Rigid Planar Periodic Graphs
inferred← citeshttps://doi.org/10.1007/bf02523236openalex-snapshot
“The big sweep”: On the power of the wavefront approach to Voronoi diagrams
inferred← citeshttps://doi.org/10.1007/bf02574686openalex-snapshot
On the construction of abstract voronoi diagrams
inferred← citeshttps://doi.org/10.1007/pl00009366openalex-snapshot
Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions
inferred← citeshttps://doi.org/10.1007/s00453-021-00824-9openalex-snapshot
Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons
inferred← citeshttps://doi.org/10.1007/s004540010081openalex-snapshot
Voronoi diagrams for convex polygon-offset distance functions
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90175-hopenalex-snapshot
Construction of Voronoi diagrams in the plane by using maps
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/j.cad.2012.10.031openalex-snapshot
Parallel computing 2D Voronoi diagrams using untransformed sweepcircles
inferred← citeshttps://doi.org/10.1016/j.jda.2003.12.004openalex-snapshot
Optimizing a constrained convex polygonal annulus
inferred← citeshttps://doi.org/10.1016/s0262-8856(96)01111-0openalex-snapshot
An efficient algorithm for the largest empty figure problem based on a 2D cellular automaton architecture
inferred← citeshttps://doi.org/10.1023/a:1026110926707openalex-snapshot
Location Science Research: A Review
inferred← citeshttps://doi.org/10.1080/02693799408901986openalex-snapshot
Nearest neighbourhood operations with generalized Voronoi diagrams: a review
inferred← citeshttps://doi.org/10.1109/70.563646openalex-snapshot
Collision-free path planning for a diamond-shaped robot using two-dimensional cellular automata
inferred← citeshttps://doi.org/10.1109/aspdac.1995.486409openalex-snapshot
Cellular automata-based collision-free robot path planning
inferred← citeshttps://doi.org/10.1109/isvd.2011.28openalex-snapshot
Proximity and Motion Planning on l_1-Embeddable Tilings
inferred← citeshttps://doi.org/10.1137/080742166openalex-snapshot
Querying Approximate Shortest Paths in Anisotropic Regions
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/1247069.1247082openalex-snapshot
Querying approximate shortest paths in anisotropic regions
inferred← citeshttps://doi.org/10.1145/220279.220289openalex-snapshot
The Voronoi diagram of curved objects
inferred← citeshttps://doi.org/10.1145/3197517.3201343openalex-snapshot
Polyhedral voronoi diagrams for additive manufacturing
inferred← citeshttps://doi.org/10.1145/380752.380815openalex-snapshot
A tight bound for the complexity of voroni diagrams under polyhedral convex distance functions in 3D
inferred← citeshttps://doi.org/10.1504/ijcat.2006.010600openalex-snapshot
Parallel algorithms for robot path planning with simpler VLSI architecture
inferred← citeshttps://doi.org/10.22215/etd/2014-10473openalex-snapshot
Theta-Graphs and Other Constrained Spanners
inferred← citeshttps://doi.org/10.2312/diss.20098216openalex-snapshot
SELF-DELAUNAY MESHES FOR SURFACES
inferred← citeshttps://doi.org/10.32657/10356/65864openalex-snapshot
Intrinsic computation of voronoi diagrams on surfaces and its application
inferred← citeshttps://doi.org/10.5821/dissertation-2117-95231openalex-snapshot
Skeletal representations of orthogonal shapes
inferred← citeshttps://doi.org/10.6028/nist.ir.5164openalex-snapshot
Bibliographic notes on Voronoi diagrams
inferred← citeshttps://doi.org/10.6688/jise.2014.30.5.9openalex-snapshot
Travel Time Distances Induced by Transportation Networks and General Underlying Distances
inferred← citeshttps://doi.org/10.70675/35b5bc3dz7c71z458fzbbb1z054346ba75b7openalex-snapshot
Algorithmes d'optimisation pour la surveillance et l'estimation de la pollution de l'air
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.