On the public citation graph
Applications of random sampling to on-line algorithms in computational geometry
0 signed · 103 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-52282-4_46openalex-snapshot
On the construction of abstract voronoi diagrams
inferredcites →https://doi.org/10.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/bf02187740openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1007/bf02187783openalex-snapshot
Combinatorial complexity bounds for arrangements of curves and spheres
inferredcites →https://doi.org/10.1007/bfb0032048openalex-snapshot
Randomized incremental construction of delaunay and Voronoi diagrams
inferredcites →https://doi.org/10.1016/0020-0190(85)90044-4openalex-snapshot
Constructing the visibility graph for n-line segments in O(n2) time
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.1016/b978-0-444-87806-9.50007-4openalex-snapshot
Simple On-Line Algorithms for Convex Polygons
inferredcites →https://doi.org/10.1109/sfcs.1988.21973openalex-snapshot
Combinatorial complexity bounds for arrangements of curves and surfaces
inferredcites →https://doi.org/10.1109/sfcs.1988.21975openalex-snapshot
An optimal algorithm for intersecting line segments in the plane
inferredcites →https://doi.org/10.1109/sfcs.1989.63540openalex-snapshot
On obstructions in relation to a fixed viewpoint
inferredcites →https://doi.org/10.1145/10515.10543openalex-snapshot
The hierarchical representation of objects: the Delaunay tree
inferredcites →https://doi.org/10.1145/12130.12172openalex-snapshot
Constructing higher-dimensional convex hulls at logarithmic cost per face
inferredcites →https://doi.org/10.1145/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1145/73833.73869openalex-snapshot
Higher-dimensional Voronoi diagrams in linear expected time
inferredcites →https://doi.org/10.14288/1.0051821openalex-snapshot
A convex hull algorithm optimal for point sets in even dimensions
inferredcites →https://doi.org/10.22028/d291-26121openalex-snapshot
On the construction of abstract Voronoi diagrams
inferredcites →https://doi.org/10.2307/2325168openalex-snapshot
Algorithms in Combinatorial Geometry.
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-44676-1_26openalex-snapshot
Splitting a Delaunay Triangulation in Linear Time
inferred← citeshttps://doi.org/10.1007/3-540-44968-x_32openalex-snapshot
On Some Optimization Problems in Obnoxious Facility Location
inferred← citeshttps://doi.org/10.1007/3-540-55210-3_205openalex-snapshot
Four results on randomized incremental constructions
inferred← citeshttps://doi.org/10.1007/3-540-55488-2_20openalex-snapshot
Selected topics from computational geometry, data structures and motion planning
inferred← citeshttps://doi.org/10.1007/3-540-57273-2_50openalex-snapshot
Dog bites postman: Point location in the moving Voronoi diagram and related problems
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_231openalex-snapshot
Remembering conflicts in history yields dynamic algorithms
inferred← citeshttps://doi.org/10.1007/3-540-60249-6_65openalex-snapshot
Randomized incremental construction of simple abstract Voronoi diagrams in 3-space
inferred← citeshttps://doi.org/10.1007/3-540-60392-1_18openalex-snapshot
Updating visibility information on multiresolut ion terrain models
inferred← citeshttps://doi.org/10.1007/978-3-322-95233-2_17openalex-snapshot
Randomized Incremental Construction of Abstract Voronoi Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-642-58043-7_3openalex-snapshot
Backwards Analysis of Randomized Geometric Algorithms
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/bf01898599openalex-snapshot
Horizon computation on a hierarchical triangulated terrain model
inferred← citeshttps://doi.org/10.1007/bf01940875openalex-snapshot
Randomized geometric algorithms and pseudorandom generators
inferred← citeshttps://doi.org/10.1007/bf02570694openalex-snapshot
Piecewise linear paths among convex obstacles
inferred← citeshttps://doi.org/10.1007/bf02570705openalex-snapshot
On lazy randomized incremental construction
inferred← citeshttps://doi.org/10.1007/bf02716580openalex-snapshot
A compact piecewise-linear voronoi diagram for convex sites in the plane
inferred← citeshttps://doi.org/10.1007/bfb0009479openalex-snapshot
Separating and shattering long line segments
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/bfb0049411openalex-snapshot
How to compute the Voronoi diagram of line segments: Theoretical and experimental results
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/pl00009366openalex-snapshot
Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions
inferred← citeshttps://doi.org/10.1007/pl00009477openalex-snapshot
Degenerate Convex Hulls On-Line in Any Fixed Dimension
inferred← citeshttps://doi.org/10.1007/s00453-002-0939-8openalex-snapshot
Splitting a Delaunay Triangulation in Linear Time
inferred← citeshttps://doi.org/10.1007/s00454-005-1192-0openalex-snapshot
The Voronoi Diagram of Curved Objects
inferred← citeshttps://doi.org/10.1007/s00454-009-9170-6openalex-snapshot
Markov Incremental Constructions
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90024-nopenalex-snapshot
On the randomized construction of the Delaunay tree
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/0925-7721(93)90011-topenalex-snapshot
Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection
inferred← citeshttps://doi.org/10.1016/0925-7721(93)90033-3openalex-snapshot
Randomized incremental construction of abstract Voronoi diagrams
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)00024-0openalex-snapshot
An algorithm for constructing the convex hull of a set of spheres in dimension d
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/50008-5openalex-snapshot
Applications of Computational Geometry to Geographic Information Systems
inferred← citeshttps://doi.org/10.1016/j.cad.2008.08.004openalex-snapshot
Topology-oriented incremental computation of Voronoi diagrams of circular arcs and straight-line segments
inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.11.007openalex-snapshot
Dynamic well-spaced point sets
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.10.003openalex-snapshot
Offset polygon and annulus placement problems
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(00)00019-5openalex-snapshot
Union and split operations on dynamic trapezoidal maps☆☆This work was partially supported by ESPRIT Basic Research Action r. 7141 (ALCOM II). A preliminary version appeared as [22].
inferred← citeshttps://doi.org/10.1016/s0925-7721(96)00020-xopenalex-snapshot
Randomized incremental construction of simple abstract Voronoi diagrams in 3-space
inferred← citeshttps://doi.org/10.1016/s0925-7721(98)00025-xopenalex-snapshot
Offset-polygon annulus placement problems
inferred← citeshttps://doi.org/10.1109/5.163409openalex-snapshot
Dynamic algorithms in computational geometry
inferred← citeshttps://doi.org/10.1109/70.478433openalex-snapshot
On computing three-finger force-closure grasps of polygonal objects
inferred← citeshttps://doi.org/10.1109/iros.1991.174668openalex-snapshot
Efficient motion planners for nonholonomic mobile robots
inferred← citeshttps://doi.org/10.1109/robot.1993.291933openalex-snapshot
On characterizing and computing three- and four-finger force-closure grasps of polyhedral objects
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185369openalex-snapshot
Dynamic maintenance of geometric structures made easy
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267815openalex-snapshot
Randomized geometric algorithms and pseudo-random generators
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366829openalex-snapshot
A compact piecewise-linear Voronoi diagram for convex sites in the plane
inferred← citeshttps://doi.org/10.1137/090759112openalex-snapshot
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings
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/s0097539794266602openalex-snapshot
On Translational Motion Planning of a Convex Polyhedron in 3-Space
inferred← citeshttps://doi.org/10.1137/s0097539797329373openalex-snapshot
Robust Plane Sweep for Intersecting Segments
inferred← citeshttps://doi.org/10.1142/s0218195901000663openalex-snapshot
FURTHEST SITE ABSTRACT VORONOI DIAGRAMS
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.1142/s0218195996000022openalex-snapshot
OUTPUT SENSITIVE CONSTRUCTION OF THE DELAUNAY TRIANGULATION OF POINTS LYING IN TWO PLANES
inferred← citeshttps://doi.org/10.1142/s0218195998000126openalex-snapshot
A Complete Implementation for Computing General Dimensional Convex Hulls
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/1247069.1247116openalex-snapshot
The voronoi diagram of three lines
inferred← citeshttps://doi.org/10.1145/1377676.1377701openalex-snapshot
Markov incremental constructions
inferred← citeshttps://doi.org/10.1145/142675.142734openalex-snapshot
Ray shooting in convex polytopes
inferred← citeshttps://doi.org/10.1145/167088.167224openalex-snapshot
Piecewise linear paths among convex obstacles
inferred← citeshttps://doi.org/10.1145/174666.174667openalex-snapshot
On randomization in sequential and distributed algorithms
inferred← citeshttps://doi.org/10.1145/177424.178081openalex-snapshot
Computing envelopes in four dimensions with applications
inferred← citeshttps://doi.org/10.1145/1810959.1811011openalex-snapshot
Dynamic well-spaced point sets
inferred← citeshttps://doi.org/10.1145/195058.195113openalex-snapshot
On lazy randomized incremental construction
inferred← citeshttps://doi.org/10.1145/1989493.1989498openalex-snapshot
Parallelism in dynamic well-spaced point sets
inferred← citeshttps://doi.org/10.1145/220279.220288openalex-snapshot
Voronoi diagrams in higher dimensions under certain polyhedral distance functions
inferred← citeshttps://doi.org/10.1145/220279.220289openalex-snapshot
The Voronoi diagram of curved objects
inferred← citeshttps://doi.org/10.1145/276884.276913openalex-snapshot
Degenerate convex hulls on-line in any fixed dimension
inferred← citeshttps://doi.org/10.1177/027836499701600102openalex-snapshot
On Computing Four-Finger Equilibrium and Force-Closure Grasps of Polyhedral Objects
inferred← citeshttps://doi.org/10.17169/refubium-21527openalex-snapshot
Tail estimates for the space complexity of randomized incremental algorithms
inferred← citeshttps://doi.org/10.22215/etd/2009-06397openalex-snapshot
A ubiquitous GIS: framework, services and algorithms, development
inferred← citeshttps://doi.org/10.2312/egwr/egsr04/275-286openalex-snapshot
Combining Higher-Order Wavelets and Discontinuity Meshing: a Compact Representation for Radiosity
inferred← citeshttps://doi.org/10.48550/arxiv.1107.5204openalex-snapshot
Analysis of the Incircle predicate for the Euclidean Voronoi diagram of axes-aligned line segments
inferred← citeshttps://doi.org/10.5555/1496770.1496788openalex-snapshot
Linear-time algorithms for geometric graphs with sublinearly many crossings
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.