On the public citation graph
On lazy randomized incremental construction
0 signed · 85 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/3-540-55210-3_205openalex-snapshot
Four results on randomized incremental constructions
inferredcites →https://doi.org/10.1007/978-3-642-58043-7_3openalex-snapshot
Backwards Analysis of Randomized Geometric Algorithms
inferredcites →https://doi.org/10.1007/bf01758770openalex-snapshot
Randomized incremental construction of Delaunay and Voronoi diagrams
inferredcites →https://doi.org/10.1007/bf02123007openalex-snapshot
Triangles in space or building (and analyzing) castles in the air
inferredcites →https://doi.org/10.1007/bf02187740openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1007/bf02187744openalex-snapshot
On the general motion-planning problem with two degrees of freedom
inferredcites →https://doi.org/10.1007/bf02187783openalex-snapshot
Combinatorial complexity bounds for arrangements of curves and spheres
inferredcites →https://doi.org/10.1007/bf02187902openalex-snapshot
Separating two simple polygons by a sequence of translations
inferredcites →https://doi.org/10.1007/bf02293035openalex-snapshot
Applications of random sampling to on-line algorithms in computational geometry
inferredcites →https://doi.org/10.1007/bf02574686openalex-snapshot
On the construction of abstract voronoi diagrams
inferredcites →https://doi.org/10.1007/bf02574699openalex-snapshot
Small-dimensional linear programming and convex hulls made easy
inferredcites →https://doi.org/10.1016/0304-3975(93)90024-nopenalex-snapshot
On the randomized construction of the Delaunay tree
inferredcites →https://doi.org/10.1109/sfcs.1988.21974openalex-snapshot
A fast planar partition algorithm. I
inferredcites →https://doi.org/10.1137/0222031openalex-snapshot
On the Zone Theorem for Hyperplane Arrangements
inferredcites →https://doi.org/10.1145/220279.220301openalex-snapshot
A new technique for analyzing substructures in arrangements
inferredcites →https://doi.org/10.1145/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jagm.1996.0027openalex-snapshot
Derandomization in Computational Geometry
inferred← citeshttps://doi.org/10.1007/11751540_3openalex-snapshot
Visibility Maps of Segments and Triangles in 3D
inferred← citeshttps://doi.org/10.1007/3-540-36136-7_25openalex-snapshot
Casting a Polyhedron with Directional Uncertainty
inferred← citeshttps://doi.org/10.1007/3-540-46691-6_1openalex-snapshot
Recent Developments in the Theory of Arrangements of Surfaces
inferred← citeshttps://doi.org/10.1007/978-3-031-55598-5_20openalex-snapshot
Minimum-Width Double-Slabs and Widest Empty Slabs in High Dimensions
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/bf02712871openalex-snapshot
Efficient randomized algorithms for some geometric optimization problems
inferred← citeshttps://doi.org/10.1007/bf02712877openalex-snapshot
A new technique for analyzing substructures in arrangements of piecewise linear surfaces
inferred← citeshttps://doi.org/10.1007/bf02716576openalex-snapshot
The overlay of lower envelopes and its applications
inferred← citeshttps://doi.org/10.1007/bf02716803openalex-snapshot
A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment
inferred← citeshttps://doi.org/10.1007/bfb0054378openalex-snapshot
Fast and efficient computation of additively weighted Voronoi cells for applications in molecular biology
inferred← citeshttps://doi.org/10.1007/pl00009319openalex-snapshot
Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces
inferred← citeshttps://doi.org/10.1007/pl00009455openalex-snapshot
Motion Planning for a Convex Polygon in a Polygonal Environment
inferred← citeshttps://doi.org/10.1007/s00453-006-1229-7openalex-snapshot
Motorcycle Graphs and Straight Skeletons
inferred← citeshttps://doi.org/10.1007/s00454-001-0026-yopenalex-snapshot
Online Point Location in Planar Arrangements and Its Applications
inferred← citeshttps://doi.org/10.1007/s00454-001-0027-xopenalex-snapshot
A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time
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(95)00007-0openalex-snapshot
On-line construction of the upper envelope of triangles and surface patches in three dimensions
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00021-6openalex-snapshot
Point location in zones of k-flats in arrangements
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/50014-0openalex-snapshot
Derandomization in Computational Geometry
inferred← citeshttps://doi.org/10.1016/j.comgeo.2006.11.001openalex-snapshot
Visibility maps of segments and triangles in 3D
inferred← citeshttps://doi.org/10.1016/j.comgeo.2025.102173openalex-snapshot
Minimum-width double-slabs and widest empty slabs in high dimensions
inferred← citeshttps://doi.org/10.1016/j.datak.2012.02.001openalex-snapshot
Probabilistic Voronoi diagrams for probabilistic moving nearest neighbor queries
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.03.024openalex-snapshot
Capturing crossings: Convex hulls of segment and plane intersections
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00125-7openalex-snapshot
Computing a single cell in the overlay of two simple polygons
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00188-9openalex-snapshot
Separating and shattering long line segments
inferred← citeshttps://doi.org/10.1016/s0925-7721(02)00167-0openalex-snapshot
Casting a polyhedron with directional uncertainty
inferred← citeshttps://doi.org/10.1090/surv/173/08openalex-snapshot
Sampling and the moments technique
inferred← citeshttps://doi.org/10.1109/sffcs.1999.814582openalex-snapshot
Taking a walk in a planar arrangement
inferred← citeshttps://doi.org/10.1137/1.9781611975994.173openalex-snapshot
Nearly Optimal Planar k Nearest Neighbors Queries under General Distance Functions
inferred← citeshttps://doi.org/10.1137/110840030openalex-snapshot
Computing Shortest Paths amid Convex Pseudodisks
inferred← citeshttps://doi.org/10.1137/20m1388371openalex-snapshot
Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions
inferred← citeshttps://doi.org/10.1137/21m1423324openalex-snapshot
Optimal Algorithms for Geometric Centers and Depth
inferred← citeshttps://doi.org/10.1137/s0097539793250755openalex-snapshot
The Union of Convex Polyhedra in Three Dimensions
inferred← citeshttps://doi.org/10.1137/s0097539794265724openalex-snapshot
Computing Envelopes in Four Dimensions with Applications
inferred← citeshttps://doi.org/10.1137/s009753979426616xopenalex-snapshot
Computing Many Faces in Arrangements of Lines and Segments
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/s0097539799350232openalex-snapshot
Constructing Planar Cuttings in Theory and Practice
inferred← citeshttps://doi.org/10.1137/s0097539799362627openalex-snapshot
Taking a Walk in a Planar Arrangement
inferred← citeshttps://doi.org/10.1142/s0218195900000036openalex-snapshot
COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS
inferred← citeshttps://doi.org/10.1142/s0218195917500017openalex-snapshot
Minimum Cell Connection in Line Segment Arrangements
inferred← citeshttps://doi.org/10.1145/1150334.1150338openalex-snapshot
Efficient algorithms for bichromatic separability
inferred← citeshttps://doi.org/10.1145/1542362.1542368openalex-snapshot
Near-linear approximation algorithms for geometric hitting sets
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.177548openalex-snapshot
Computing many faces in arrangements of lines and segments
inferred← citeshttps://doi.org/10.1145/177424.178081openalex-snapshot
Computing envelopes in four dimensions with applications
inferred← citeshttps://doi.org/10.1145/2093973.2094010openalex-snapshot
Delineating imprecise regions via shortest-path graphs
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/220279.220314openalex-snapshot
Efficient randomized algorithms for some geometric optimization problems
inferred← citeshttps://doi.org/10.1145/225058.225285openalex-snapshot
Computing faces in segment and simplex arrangements
inferred← citeshttps://doi.org/10.1145/237218.237230openalex-snapshot
Vertical decomposition of a single cell in a three-dimensional arrangement of surfaces and its applications
inferred← citeshttps://doi.org/10.1145/304893.304993openalex-snapshot
On range reporting, ray shooting and k -level construction
inferred← citeshttps://doi.org/10.1145/336154.336197openalex-snapshot
When crossings count — approximating the minimum spanning tree
inferred← citeshttps://doi.org/10.1145/336154.336206openalex-snapshot
Linear-time triangulation of a simple polygon made easier via randomization
inferred← citeshttps://doi.org/10.1201/9781439864524-17openalex-snapshot
Largest Placem ents and M otion Planning of a Convex Polygon
inferred← citeshttps://doi.org/10.48550/arxiv.0907.0907openalex-snapshot
Randomized Incremental Construction of Compressed Quadtrees
inferred← citeshttps://doi.org/10.48550/arxiv.1104.4618openalex-snapshot
Minimum cell connection and separation in line segment arrangements
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0303001openalex-snapshot
When Crossings Count - Approximating the Minimum Spanning Tree
inferred← citeshttps://doi.org/10.5555/365411.365419openalex-snapshot
Online point location in planar arrangements and its applications
inferred← citeshttps://doi.org/10.5555/545381.545401openalex-snapshot
Motorcycle graphs and straight skeletons
inferred← citeshttps://doi.org/10.5555/982792.982897openalex-snapshot
Efficient algorithms for bichromatic separability
inferred← citeshttps://doi.org/10.7315/cadcam.2012.262openalex-snapshot
GPU Algorithm for Outer Boundaries of a Triangle Set
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.