On the public citation graph
AnO(n logn) plane-sweep algorithm forL 1 andL ∞ Delaunay triangulations
0 signed · 38 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/bf00977785openalex-snapshot
Two algorithms for constructing a Delaunay triangulation
inferredcites →https://doi.org/10.1007/bf01937482openalex-snapshot
Delaunay triangulation and the convex hull ofn points in expected linear time
inferredcites →https://doi.org/10.1007/bfb0015744openalex-snapshot
A fast algorithm for polygon containment by translation
inferredcites →https://doi.org/10.1016/0020-0190(86)90038-4openalex-snapshot
The Greedy and Delauney triangulations are not bad in the average case
inferredcites →https://doi.org/10.1016/0031-3203(80)90066-7openalex-snapshot
The relative neighbourhood graph of a finite planar set
inferredcites →https://doi.org/10.1016/0031-3203(85)90023-8openalex-snapshot
Relative neighborhood graphs in the Li-metric
inferredcites →https://doi.org/10.1080/03052158008902421openalex-snapshot
AN 0 (N log N) HEURISTIC ALGORITHM FOR THE RECTILINEAR STEINER MINIMAL TREE PROBLEM
inferredcites →https://doi.org/10.1093/comjnl/21.1.73openalex-snapshot
Some improved designs for the digital summation threshold logic (DSTL) gate
inferredcites →https://doi.org/10.1093/comjnl/21.2.168openalex-snapshot
Computing Dirichlet Tessellations in the Plane
inferredcites →https://doi.org/10.1109/tcs.1976.1084243openalex-snapshot
Use of Steiner's problem in suboptimal routing in rectilinear metric
inferredcites →https://doi.org/10.1109/tcs.1979.1084551openalex-snapshot
An O(n log n) algorithm for suboptimal rectilinear Steiner trees
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.1137/0210006openalex-snapshot
Generalization of Voronoi Diagrams in the Plane
inferredcites →https://doi.org/10.1145/10515.10534openalex-snapshot
There is a planar graph almost as good as the complete graph
inferredcites →https://doi.org/10.1145/10515.10545openalex-snapshot
A simple divide-and-conquer algorithm for computing Delaunay triangulations in O(n log log n) expected time
inferredcites →https://doi.org/10.1145/10515.10549openalex-snapshot
A sweepline algorithm for Voronoi diagrams
inferredcites →https://doi.org/10.1145/12130.12175openalex-snapshot
Two probabilistic results on rectilinear Steiner trees
inferredcites →https://doi.org/10.1145/2402.322386openalex-snapshot
The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
inferredcites →https://doi.org/10.1145/282918.282923openalex-snapshot
Primitives for the manipulation of general subdivisions and the computation of Voronoi
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.323264openalex-snapshot
Voronoi diagrams based on convex distance functions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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/978-3-540-30205-6_46openalex-snapshot
An Efficient Low-Degree RMST Algorithm for VLSI/ULSI Physical Design
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.1016/j.amc.2014.03.100openalex-snapshot
A connectivity graph generation approach for Manhattan path calculation in detailed facility layout
inferred← citeshttps://doi.org/10.1016/j.comgeo.2021.101821openalex-snapshot
Persistent homology in ℓ∞ metric
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00232-0openalex-snapshot
Efficient minimum spanning tree construction without Delaunay triangulation
inferred← citeshttps://doi.org/10.1109/aspdac.2001.913303openalex-snapshot
Efficient minimum spanning tree construction without Delaunay triangulation [VLSI CAD]
inferred← citeshttps://doi.org/10.1109/aspdac.2005.1466119openalex-snapshot
The polygonal contraction heuristic for rectilinear Steiner tree construction
inferred← citeshttps://doi.org/10.1109/isvd.2007.32openalex-snapshot
On Sweep-plane Analysis of Laguerre Voronoi Diagram
inferred← citeshttps://doi.org/10.1145/1120725.1120731openalex-snapshot
The polygonal contraction heuristic for rectilinear Steiner tree construction
inferred← citeshttps://doi.org/10.1145/370155.370320openalex-snapshot
Efficient minimum spanning tree construction without Delaunay triangulation
inferred← citeshttps://doi.org/10.7146/dpb.v20i373.6605openalex-snapshot
A Sweepline Algorithm for Generalized Delaunay 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.