On the public citation graph
Edge-skeletons in arrangements with applications
0 signed · 57 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/0020-0190(85)90107-3openalex-snapshot
Finding extreme points in three dimensions and solving the post-office problem in the plane
inferredcites →https://doi.org/10.1016/0097-3165(85)90017-2openalex-snapshot
On the number of line separations of a finite set in the plane
inferredcites →https://doi.org/10.1016/0097-3165(86)90075-0openalex-snapshot
The number of extreme pairs of finite point-sets in Euclidean spaces
inferredcites →https://doi.org/10.1016/0196-6774(85)90011-2openalex-snapshot
Partitioning with two lines in the plane
inferredcites →https://doi.org/10.1016/b978-0-7204-2262-7.50018-1openalex-snapshot
Dissection Graphs of Planar Point Sets
inferredcites →https://doi.org/10.1016/s0020-0190(80)90073-3openalex-snapshot
Dynamization of decomposable searching problems
inferredcites →https://doi.org/10.1080/0025570x.1978.11976715openalex-snapshot
Simple Partitions of Space
inferredcites →https://doi.org/10.1109/sfcs.1983.11openalex-snapshot
Constructing arrangements of lines and hyperplanes with applications
inferredcites →https://doi.org/10.1109/sfcs.1984.715939openalex-snapshot
Space Searching For Intersecting Objects
inferredcites →https://doi.org/10.1109/tc.1982.1675946openalex-snapshot
An Optimal Illumination Region Algorithm for Convex Polygons
inferredcites →https://doi.org/10.1109/tc.1982.1676031openalex-snapshot
On k-Nearest Neighbor Voronoi Diagrams in the Plane
inferredcites →https://doi.org/10.1137/0214006openalex-snapshot
Voronoi Diagram in the Laguerre Geometry and Its Applications
inferredcites →https://doi.org/10.1137/0215024openalex-snapshot
Constructing Arrangements of Lines and Hyperplanes with Applications
inferredcites →https://doi.org/10.1137/0216006openalex-snapshot
Power Diagrams: Properties, Algorithms and Applications
inferredcites →https://doi.org/10.1145/323233.323266openalex-snapshot
Voronoi diagrams and arrangements
inferredcites →https://doi.org/10.1145/359423.359430openalex-snapshot
Convex hulls of finite sets of points in two and three dimensions
inferredcites →https://doi.org/10.1145/800057.808677openalex-snapshot
On k-hulls and related problems
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-51084-2_31openalex-snapshot
Tetrahedrizing point sets in three dimensions
inferred← citeshttps://doi.org/10.1007/3-540-52292-1_24openalex-snapshot
k — Nearest — Neighbor Voronoi diagrams for sets of convex polygons, line segments and points
inferred← citeshttps://doi.org/10.1007/3-540-52921-7_56openalex-snapshot
The K-Gabriel graphs and their applications
inferred← citeshttps://doi.org/10.1007/3-540-55121-2_11openalex-snapshot
Voronoi diagrams of moving points in the plane
inferred← citeshttps://doi.org/10.1007/978-1-4615-5319-9_2openalex-snapshot
Median problems in location science
inferred← citeshttps://doi.org/10.1007/978-3-642-58043-7_7openalex-snapshot
Hyperplane Approximation and Related Topics
inferred← citeshttps://doi.org/10.1007/bf01759056openalex-snapshot
Order-k voronoi diagrams of sites with additive weights in the plane
inferred← citeshttps://doi.org/10.1007/bf02090398openalex-snapshot
Selection and sorting in totally monotone arrays
inferred← citeshttps://doi.org/10.1007/bf02187788openalex-snapshot
A new duality result concerning voronoi diagrams
inferred← citeshttps://doi.org/10.1007/bf02574692openalex-snapshot
On levels in arrangements and voronoi diagrams
inferred← citeshttps://doi.org/10.1007/bfb0042803openalex-snapshot
Symbolic treatment of geometric degeneracies
inferred← citeshttps://doi.org/10.1007/s00454-025-00739-0openalex-snapshot
Eight-Partitioning Points in 3D, and Efficiently Too
inferred← citeshttps://doi.org/10.1007/s12665-015-4738-3openalex-snapshot
Intertwining agents and environments
inferred← citeshttps://doi.org/10.1016/0022-0000(90)90016-eopenalex-snapshot
A geometric consistency theorem for a symbolic perturbation scheme
inferred← citeshttps://doi.org/10.1016/0022-0000(93)90041-topenalex-snapshot
Output sensitive and dynamic constructions of higher order voronoi diagrams and levels in arrangements
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90115-5openalex-snapshot
Voronoi diagrams over dynamic scenes
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50003-6openalex-snapshot
Arrangements and Their Applications**Work by PA. was supported by Army Research Office MURI grant DAAH04-96-1-0013, by a Sloan fellowship, by an NYI award, and by a grant from the U.S.–Israeli Binational Science Foundation. Work by M.S. was supported by NSF Grants CCR-91-22103 and CCR-93-11127, by…
inferred← citeshttps://doi.org/10.1016/j.cad.2022.103374openalex-snapshot
Robust Construction of Voronoi Diagrams of Spherical Balls in Three-Dimensional Space
inferred← citeshttps://doi.org/10.1016/s0734-189x(87)80134-2openalex-snapshot
Picture Processing: 1986
inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80068-5openalex-snapshot
Tetrahedrizing point sets in three dimensions†
inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80069-7openalex-snapshot
Symbolic treatment of geometric degeneracies
inferred← citeshttps://doi.org/10.1016/s0747-7171(86)80020-7openalex-snapshot
Computing a ham-sandwich cut in two dimensions
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185399openalex-snapshot
A general approach to removing degeneracies
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743509openalex-snapshot
Random sampling, halfspace range reporting, and construction of (≤k)-levels in three dimensions
inferred← citeshttps://doi.org/10.1109/tc.1987.5009474openalex-snapshot
An Improved Algorithm for Constructing kth-Order Voronoi Diagrams
inferred← citeshttps://doi.org/10.1137/s0097539792235918openalex-snapshot
A General Approach to Removing Degeneracies
inferred← citeshttps://doi.org/10.1137/s0097539798349188openalex-snapshot
Random Sampling, Halfspace Range Reporting, and Construction of \lowercase$(\le k)$-Levels in Three Dimensions
inferred← citeshttps://doi.org/10.1142/s0218195998000126openalex-snapshot
A Complete Implementation for Computing General Dimensional Convex Hulls
inferred← citeshttps://doi.org/10.1145/100216.100259openalex-snapshot
Output sensitive construction of levels and Voronoi diagrams in R d of order 1 to k
inferred← citeshttps://doi.org/10.1145/100216.100260openalex-snapshot
Solving query-retrieval problems by compacting Voronoi diagrams
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/142675.142740openalex-snapshot
Finding k farthest pairs and k closest/farthest bichromatic pairs for points in the plane
inferred← citeshttps://doi.org/10.1145/73393.73406openalex-snapshot
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
inferred← citeshttps://doi.org/10.1145/73393.73407openalex-snapshot
A geometric consistency theorem for a symbolic perturbation scheme
inferred← citeshttps://doi.org/10.1145/77635.77639openalex-snapshot
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
inferred← citeshttps://doi.org/10.21236/ada230380openalex-snapshot
Results in Computational Geometry: Geometric Embeddings and Query- Retrieval Problems
inferred← citeshttps://doi.org/10.5555/320176.320236openalex-snapshot
Selection and sorting in totally monotone arrays
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.