On the public citation graph
On levels in arrangements and voronoi diagrams
0 signed · 99 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/bf01840438openalex-snapshot
Edge-skeletons in arrangements with applications
inferredcites →https://doi.org/10.1007/bf02187685openalex-snapshot
Halfspace range search: An algorithmic application ofk-sets
inferredcites →https://doi.org/10.1007/bf02187686openalex-snapshot
More onk-sets of finite sets in the plane
inferredcites →https://doi.org/10.1007/bf02187879openalex-snapshot
New applications of random sampling in computational geometry
inferredcites →https://doi.org/10.1016/0020-0190(79)90074-7openalex-snapshot
Voronoi diagrams from convex hulls
inferredcites →https://doi.org/10.1016/0097-3165(84)90081-5openalex-snapshot
On the number of k-subsets of a set of n points in the plane
inferredcites →https://doi.org/10.1016/0097-3165(86)90122-6openalex-snapshot
The number of small semispaces of a finite set of points 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.1109/sfcs.1988.21974openalex-snapshot
A fast planar partition algorithm. I
inferredcites →https://doi.org/10.1109/sfcs.1989.63540openalex-snapshot
On obstructions in relation to a fixed viewpoint
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/0215024openalex-snapshot
Constructing Arrangements of Lines and Hyperplanes with Applications
inferredcites →https://doi.org/10.1145/102782.102785openalex-snapshot
A fast planar partition algorithm, II
inferredcites →https://doi.org/10.1145/28395.28400openalex-snapshot
A Linear time algorithm for computing the Voronoi diagram of a convex polygon
inferredcites →https://doi.org/10.1145/323233.323263openalex-snapshot
An improved algorithm for constructing kth-order Voronoi diagrams
inferredcites →https://doi.org/10.1145/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1145/73393.73395openalex-snapshot
Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incremental
inferredcites →https://doi.org/10.1145/73833.73837openalex-snapshot
A fast planar partition algorithm, II
inferredcites →https://doi.org/10.1145/74333.74372openalex-snapshot
An efficient algorithm for hidden surface removal
inferredcites →https://doi.org/10.1145/74334.74372openalex-snapshot
An efficient algorithm for hidden surface removal
inferredcites →https://doi.org/10.1145/800057.808677openalex-snapshot
On k-hulls and related problems
inferredcites →https://doi.org/10.13182/nse68-a19548openalex-snapshot
The Art of Computer Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rsa.21168openalex-snapshot
The impact of heterogeneity and geometry on the proof complexity of random satisfiability
inferred← citeshttps://doi.org/10.1006/jagm.1996.0027openalex-snapshot
Derandomization in Computational Geometry
inferred← citeshttps://doi.org/10.1007/3-540-48447-7_1openalex-snapshot
Optimization over k-set Polytopes and Efficient k-set Enumeration
inferred← citeshttps://doi.org/10.1007/3-540-61680-2_64openalex-snapshot
Reporting red-blue intersections between two sets of connected line segments
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_7openalex-snapshot
An Output-Sensitive Approach for the L 1/L ∞ k-Nearest-Neighbor Voronoi Diagram
inferred← citeshttps://doi.org/10.1007/978-3-642-31155-0_6openalex-snapshot
Higher Order City Voronoi Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-642-83539-1_9openalex-snapshot
Davenport-Schinzel Sequences and their Geometric Applications
inferred← citeshttps://doi.org/10.1007/bf01228508openalex-snapshot
A semidynamic construction of higher-order voronoi diagrams and its randomized analysis
inferred← citeshttps://doi.org/10.1007/bf01264915openalex-snapshot
On the total weight of arrangements of halfplanes
inferred← citeshttps://doi.org/10.1007/bf01293483openalex-snapshot
Dynamic half-space range reporting and its applications
inferred← citeshttps://doi.org/10.1007/bf01940875openalex-snapshot
Randomized geometric algorithms and pseudorandom generators
inferred← citeshttps://doi.org/10.1007/bf02570713openalex-snapshot
On geometric optimization with few violated constraints
inferred← citeshttps://doi.org/10.1007/bf02573989openalex-snapshot
Arrangements of oriented hyperplanes
inferred← citeshttps://doi.org/10.1007/bfb0028249openalex-snapshot
Fully dynamic delaunay triangulation in logarithmic expected time per operation
inferred← citeshttps://doi.org/10.1007/bfb0035458openalex-snapshot
Deterministic sampling and optimization
inferred← citeshttps://doi.org/10.1007/s00453-002-0967-4openalex-snapshot
Reporting Red--Blue Intersections between Two Sets of Connected Line Segments
inferred← citeshttps://doi.org/10.1007/s00453-013-9809-9openalex-snapshot
The k-Nearest-Neighbor Voronoi Diagram Revisited
inferred← citeshttps://doi.org/10.1007/s00453-022-01027-6openalex-snapshot
A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes
inferred← citeshttps://doi.org/10.1007/s00454-020-00243-7openalex-snapshot
Dynamic Planar Voronoi Diagrams for General Distance Functions and Their Algorithmic Applications
inferred← citeshttps://doi.org/10.1007/s00454-023-00492-2openalex-snapshot
Unbounded Regions of High-Order Voronoi Diagrams of Lines and Line Segments in Higher Dimensions
inferred← citeshttps://doi.org/10.1007/s00778-023-00804-1openalex-snapshot
Quantifying the competitiveness of a dataset in relation to general preferences
inferred← citeshttps://doi.org/10.1007/s00778-026-00972-wopenalex-snapshot
A framework for top-k queries with constrained preferences
inferred← citeshttps://doi.org/10.1007/s10115-018-1290-yopenalex-snapshot
Cost optimization based on influence and user preference
inferred← citeshttps://doi.org/10.1007/s10898-024-01386-0openalex-snapshot
The edge labeling of higher order Voronoi diagrams
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00134-0openalex-snapshot
k-Violation linear programming
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/0304-3975(95)00174-3openalex-snapshot
An introduction to randomization in computational geometry
inferred← citeshttps://doi.org/10.1016/0925-7721(92)90025-nopenalex-snapshot
Fully dynamic delaunay triangulation in logarithmic expected time per operation
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50002-4openalex-snapshot
Davenport–Schinzel Sequences and Their Geometric Applications**Both authors have been supported by a grant from the U.S.–Israeli Binational Science Foundation. Pankaj Agarwal has also been supported by a National Science Foundation Grant CCR-93–01259, by an Army Research Office MURI grant…
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/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/b978-044482537-7/50014-0openalex-snapshot
Derandomization in Computational Geometry
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50017-6openalex-snapshot
Randomized Algorithms in Computational Geometry
inferred← citeshttps://doi.org/10.1016/j.jda.2017.04.003openalex-snapshot
On the arrangement of stochastic lines in R2
inferred← citeshttps://doi.org/10.1109/5.163409openalex-snapshot
Dynamic algorithms in computational geometry
inferred← citeshttps://doi.org/10.1109/icde.2016.7498283openalex-snapshot
Influence based cost optimization on user preference
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63540openalex-snapshot
On obstructions in relation to a fixed viewpoint
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185368openalex-snapshot
Randomized multidimensional search trees: lazy balancing and dynamic shuffling
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185369openalex-snapshot
Dynamic maintenance of geometric structures made easy
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185371openalex-snapshot
Randomized multidimensional search trees: further results in dynamic sampling
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267815openalex-snapshot
Randomized geometric algorithms and pseudo-random generators
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.1137/060669474openalex-snapshot
On Approximating the Depth and Related Problems
inferred← citeshttps://doi.org/10.1137/1.9781611976465.4openalex-snapshot
The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability
inferred← citeshttps://doi.org/10.1137/s0097539703427963openalex-snapshot
Shape Fitting with Outliers
inferred← citeshttps://doi.org/10.1137/s0097539795281840openalex-snapshot
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
inferred← citeshttps://doi.org/10.1137/s0097539795295936openalex-snapshot
Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
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/s021819599200007xopenalex-snapshot
RANDOMIZATION YIELDS SIMPLE O(n log ⋆ n) ALGORITHMS FOR DIFFICULT Ω(n) PROBLEMS
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/102782.102785openalex-snapshot
A fast planar partition algorithm, II
inferred← citeshttps://doi.org/10.1145/109648.109664openalex-snapshot
A simple on-line randomized incremental algorithm for computing higher order 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/129712.129763openalex-snapshot
Ray shooting and parametric search
inferred← citeshttps://doi.org/10.1145/160985.160994openalex-snapshot
An optimal algorithm for the (≤ k)-levels, with applications to separation and transversal problems
inferred← citeshttps://doi.org/10.1145/160985.161141openalex-snapshot
Dehn-Sommerville relations, upper bound theorem, and levels in arrangements
inferred← citeshttps://doi.org/10.1145/177424.177521openalex-snapshot
Constructing levels in arrangements and higher order Voronoi diagrams
inferred← citeshttps://doi.org/10.1145/177424.178039openalex-snapshot
On geometric optimization with few violated constraints
inferred← citeshttps://doi.org/10.1145/220279.220284openalex-snapshot
Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications
inferred← citeshttps://doi.org/10.1145/3448016.3452832openalex-snapshot
On m-Impact Regions and Standing Top-k Influence Problems
inferred← citeshttps://doi.org/10.1145/3531054openalex-snapshot
On Finding Rank Regret Representatives
inferred← citeshttps://doi.org/10.1145/73833.73837openalex-snapshot
A fast planar partition algorithm, II
inferred← citeshttps://doi.org/10.1145/74333.74372openalex-snapshot
An efficient algorithm for hidden surface removal
inferred← citeshttps://doi.org/10.1145/777792.777824openalex-snapshot
Incremental constructions con BRIO
inferred← citeshttps://doi.org/10.14778/3204028.3204031openalex-snapshot
Exact processing of uncertain top-k queries in multi-criteria settings
inferred← citeshttps://doi.org/10.15479/at:ista:9056openalex-snapshot
Multi-cover persistence and Delaunay mosaics
inferred← citeshttps://doi.org/10.1609/aaai.v36i5.20433openalex-snapshot
Algorithmic Bayesian Persuasion with Combinatorial Actions
inferred← citeshttps://doi.org/10.17169/refubium-28335openalex-snapshot
Dynamic Planar Voronoi Diagrams for General Distance Functions and Their Algorithmic Applications
inferred← citeshttps://doi.org/10.47749/t/unicamp.1999.211117openalex-snapshot
Diagramas de Voronoi de ordem k na geometria projetiva orientada
inferred← citeshttps://doi.org/10.5441/002/edbt.2014.39openalex-snapshot
A Unified Framework for Efficiently Processing Ranking Related Queries
inferred← citeshttps://doi.org/10.5555/1070432.1070556openalex-snapshot
On approximating the depth and related problems
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.