On the public citation graph

A combinatorial property of convex sets

https://doi.org/10.1007/pl00009296
0 signed · 27 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-94-009-2639-4_11openalex-snapshot
Partial Orders and Euclidean Geometry
inferredcites →https://doi.org/10.1007/bf00181432openalex-snapshot
Circles through two points that always enclose many points
inferredcites →https://doi.org/10.1007/bf00354889openalex-snapshot
Interval orders and circle orders
inferredcites →https://doi.org/10.1007/bf02187726openalex-snapshot
Some extremal results on circles containing points
inferredcites →https://doi.org/10.1007/bf02187727openalex-snapshot
A combinatorial result about points and balls in euclidean space
inferredcites →https://doi.org/10.1007/bf02187728openalex-snapshot
A note on the circle containment problem
inferredcites →https://doi.org/10.1007/bf02187798openalex-snapshot
A combinatorial property of points and ellipsoids
inferredcites →https://doi.org/10.1016/0012-365x(88)90015-5openalex-snapshot
A combinatorial result on points and circles on the plane
inferredcites →https://doi.org/10.1016/0925-7721(93)90033-3openalex-snapshot
Randomized incremental construction of abstract Voronoi diagrams
inferredcites →https://doi.org/10.1145/160985.161007openalex-snapshot
Convex distance functions in 3-space are different
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-36136-7_45openalex-snapshot
The Min-Max Voronoi Diagram of Polygons and Applications in VLSI Manufacturing
inferred← citeshttps://doi.org/10.1007/3-540-45995-2_4openalex-snapshot
Open Problems in Computational Geometry
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_27openalex-snapshot
Map of Geometric Minimal Cuts with Applications*
inferred← citeshttps://doi.org/10.1007/978-1-4614-6624-6_27-1openalex-snapshot
Map of Geometric Minimal Cuts with Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-03780-6_21openalex-snapshot
Map of Geometric Minimal Cuts for General Planar Embedding
inferred← citeshttps://doi.org/10.1007/978-3-540-45078-8_38openalex-snapshot
On the Hausdorff Voronoi Diagram of Point Clusters in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_26openalex-snapshot
Computing the Map of Geometric Minimal Cuts
inferred← citeshttps://doi.org/10.1007/978-3-642-54423-1_9openalex-snapshot
A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters
inferred← citeshttps://doi.org/10.1007/s00453-004-1095-0openalex-snapshot
The Hausdorff Voronoi Diagram of Point Clusters in the Plane
inferred← citeshttps://doi.org/10.1007/s00453-012-9704-9openalex-snapshot
Computing the Map of Geometric Minimal Cuts
inferred← citeshttps://doi.org/10.1007/s00453-016-0118-yopenalex-snapshot
A Randomized Incremental Algorithm for the Hausdorff Voronoi Diagram of Non-crossing Clusters
inferred← citeshttps://doi.org/10.1109/isvd.2011.17openalex-snapshot
The $L_\infty$ Hausdorff Voronoi Diagram Revisited
inferred← citeshttps://doi.org/10.1142/s0218195904001536openalex-snapshot
THE HAUSDORFF VORONOI DIAGRAM OF POLYGONAL OBJECTS: A DIVIDE AND CONQUER APPROACH
inferred← citeshttps://doi.org/10.1142/s0218195915500089openalex-snapshot
The L∞ Hausdorff Voronoi Diagram Revisited
inferred← citeshttps://doi.org/10.22215/etd/2014-10404openalex-snapshot
Obstacle-Avoiding Path Existence Queries in a Simple Polygon
inferred← citeshttps://doi.org/10.48550/arxiv.1306.5838openalex-snapshot
Randomized incremental construction of the Hausdorff Voronoi diagram of non-crossing clusters
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.