On the public citation graph
New applications of random sampling in computational geometry
0 signed · 350 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/978-3-0348-9078-6_132openalex-snapshot
Probabilistic Methods in Combinatorics
inferredcites →https://doi.org/10.1007/978-3-319-21852-6_3openalex-snapshot
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
inferredcites →https://doi.org/10.1007/bf02187685openalex-snapshot
Halfspace range search: An algorithmic application ofk-sets
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(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)90122-6openalex-snapshot
The number of small semispaces of a finite set of points in the plane
inferredcites →https://doi.org/10.1016/0196-6774(85)90007-0openalex-snapshot
A linear algorithm for determining the separation of convex polyhedra
inferredcites →https://doi.org/10.1016/0304-3975(78)90051-8openalex-snapshot
Finding the intersection of two convex polyhedra
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/c2013-0-11898-3openalex-snapshot
A Survey of Combinatorial Theory
inferredcites →https://doi.org/10.1016/s0019-9958(84)80040-6openalex-snapshot
Geometric retrieval problems
inferredcites →https://doi.org/10.1016/s0019-9958(85)80045-0openalex-snapshot
How to search in history
inferredcites →https://doi.org/10.1109/sfcs.1981.6openalex-snapshot
A fast probabilistic parallel sorting algorithm
inferredcites →https://doi.org/10.1109/sfcs.1983.43openalex-snapshot
Optimum algorithms for two random sampling problems
inferredcites →https://doi.org/10.1109/sfcs.1988.21961openalex-snapshot
A Las Vegas algorithm for linear programming when the dimension is small
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/tc.1982.1676031openalex-snapshot
On k-Nearest Neighbor Voronoi Diagrams in the Plane
inferredcites →https://doi.org/10.1109/tc.1987.5009474openalex-snapshot
An Improved Algorithm for Constructing kth-Order Voronoi Diagrams
inferredcites →https://doi.org/10.1109/tit.1983.1056714openalex-snapshot
On the shape of a set of points in the plane
inferredcites →https://doi.org/10.1112/s0025579300002850openalex-snapshot
The maximum numbers of faces of a convex polytope
inferredcites →https://doi.org/10.1137/0215021openalex-snapshot
The Ultimate Planar Convex Hull Algorithm?
inferredcites →https://doi.org/10.1137/0215024openalex-snapshot
Constructing Arrangements of Lines and Hyperplanes with Applications
inferredcites →https://doi.org/10.1137/1116025openalex-snapshot
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
inferredcites →https://doi.org/10.1145/12130.12158openalex-snapshot
Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension
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/22145.22163openalex-snapshot
A general approach to d-dimensional geometric queries
inferredcites →https://doi.org/10.1145/22145.22165openalex-snapshot
A probabilistic algorithm for the post office problem
inferredcites →https://doi.org/10.1145/2422.322418openalex-snapshot
Linear Programming in Linear Time When the Dimension Is Fixed
inferredcites →https://doi.org/10.1145/282918.282923openalex-snapshot
Primitives for the manipulation of general subdivisions and the computation of Voronoi
inferredcites →https://doi.org/10.1145/323233.323263openalex-snapshot
An improved algorithm for constructing kth-order Voronoi diagrams
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/41958.41994openalex-snapshot
Partitioning and geometric embedding of range spaces of finite Vapnik-Chervonenkis dimension
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/73393.73397openalex-snapshot
Partition trees for triangle counting and other range searching problems
inferredcites →https://doi.org/10.1145/73393.73406openalex-snapshot
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
inferredcites →https://doi.org/10.1145/73393.73407openalex-snapshot
A geometric consistency theorem for a symbolic perturbation scheme
inferredcites →https://doi.org/10.1145/800057.808677openalex-snapshot
On k-hulls and related problems
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.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
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.1006/jagm.1996.0027openalex-snapshot
Derandomization in Computational Geometry
inferred← citeshttps://doi.org/10.1007/3-540-19487-8_7openalex-snapshot
Intersecting line segments, ray shooting, and other applications of geometric partitioning techniques
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_117openalex-snapshot
Geometric structures in computational geometry
inferred← citeshttps://doi.org/10.1007/3-540-44450-5_3openalex-snapshot
Irregularities of Distribution, Derandomization, and Complexity Theory
inferred← citeshttps://doi.org/10.1007/3-540-45678-3_14openalex-snapshot
Quantum Algorithms for Intersection and Proximity Problems
inferred← citeshttps://doi.org/10.1007/3-540-45749-6_9openalex-snapshot
Approximation Algorithms for k-Line Center
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/3-540-51542-9_2openalex-snapshot
Efficient spatial point location
inferred← citeshttps://doi.org/10.1007/3-540-52921-7_73openalex-snapshot
Spatial point location and its applications
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_174openalex-snapshot
Computational geometry for the gourmet old fare and new dishes
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_252openalex-snapshot
Algorithms for polytope covering and approximation
inferred← citeshttps://doi.org/10.1007/3-540-58218-5_23openalex-snapshot
Randomized geometric algorithms (abstract)
inferred← citeshttps://doi.org/10.1007/3-540-58218-5_7openalex-snapshot
A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_55openalex-snapshot
Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications
inferred← citeshttps://doi.org/10.1007/978-1-4471-4847-0_62openalex-snapshot
Discrete Construction of Network Verona Diagram for Lines
inferred← citeshttps://doi.org/10.1007/978-1-4613-3282-4_7openalex-snapshot
Parallel Randomized Techniques for Some Fundamental Geometric Problems
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_18openalex-snapshot
Derandomization in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_3openalex-snapshot
Concentration of Measure for Randomized Algorithms: Techniques and Analysis
inferred← citeshttps://doi.org/10.1007/978-3-030-45771-6_3openalex-snapshot
Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts
inferred← citeshttps://doi.org/10.1007/978-3-319-13075-0_3openalex-snapshot
A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-319-44479-6_1openalex-snapshot
Simplex Range Searching and Its Variants: A Review
inferred← citeshttps://doi.org/10.1007/978-3-319-44479-6_19openalex-snapshot
Approximating the k-Level in Three-Dimensional Plane Arrangements
inferred← citeshttps://doi.org/10.1007/978-3-540-85126-4_12openalex-snapshot
Higher Order Voronoi Diagrams and Distance Functions in Art and Visualization
inferred← citeshttps://doi.org/10.1007/978-3-540-85521-7_8openalex-snapshot
Robustness and Randomness
inferred← citeshttps://doi.org/10.1007/978-3-642-02270-8_14openalex-snapshot
Space–Query-Time Tradeoff for Computing the Visibility Polygon
inferred← citeshttps://doi.org/10.1007/978-3-642-13411-1_5openalex-snapshot
An Efficient Algorithm for the Sign Condition Problem in the Semi-algebraic Context
inferred← citeshttps://doi.org/10.1007/978-3-642-16167-4_11openalex-snapshot
Discrete Construction of order-k Voronoi Diagram
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-25255-6_37openalex-snapshot
Discrete Construction of Power Network Voronoi Diagram
inferred← citeshttps://doi.org/10.1007/978-3-642-27452-7_89openalex-snapshot
Dynamic Construction of Power Voronoi Diagram
inferred← citeshttps://doi.org/10.1007/978-3-642-34041-3_46openalex-snapshot
Dynamic Construction of Additively Weighted Network Voronoi Diagram
inferred← citeshttps://doi.org/10.1007/978-3-642-58043-7_2openalex-snapshot
Combinatorics and Algorithms of Arrangements
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/978-3-642-58043-7_4openalex-snapshot
Epsilon-Nets and Computational Geometry
inferred← citeshttps://doi.org/10.1007/978-3-642-61340-1_4openalex-snapshot
Computational Geometry and its Application to Computer Graphics
inferred← citeshttps://doi.org/10.1007/bf01187036openalex-snapshot
Ray shooting on triangles in 3-space
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/bf01293483openalex-snapshot
Dynamic half-space range reporting and its applications
inferred← citeshttps://doi.org/10.1007/bf01303517openalex-snapshot
Discrepancy and approximations for bounded VC-dimension
inferred← citeshttps://doi.org/10.1007/bf01377182openalex-snapshot
Efficient ray shooting and hidden surface removal
inferred← citeshttps://doi.org/10.1007/bf01587088openalex-snapshot
A randomized algorithm for fixed-dimensional linear programming
inferred← citeshttps://doi.org/10.1007/bf01758753openalex-snapshot
Optimal randomized parallel algorithms for computational geometry
inferred← citeshttps://doi.org/10.1007/bf01758854openalex-snapshot
Quasi-optimal upper bounds for simplex range searching and new zone theorems
inferred← citeshttps://doi.org/10.1007/bf01940877openalex-snapshot
A subexponential bound for linear programming
inferred← citeshttps://doi.org/10.1007/bf01955043openalex-snapshot
Lines in Space: Combinatorics and Algorithms
inferred← citeshttps://doi.org/10.1007/bf02122778openalex-snapshot
A deterministic view of random sampling and its use in geometry
inferred← citeshttps://doi.org/10.1007/bf02123007openalex-snapshot
Triangles in space or building (and analyzing) castles in the air
inferred← citeshttps://doi.org/10.1007/bf02187740openalex-snapshot
Applications of random sampling in computational geometry, II
inferred← citeshttps://doi.org/10.1007/bf02187741openalex-snapshot
A fast las vegas algorithm for triangulating a simple polygon
inferred← citeshttps://doi.org/10.1007/bf02187742openalex-snapshot
Implicitly representing arrangements of lines or segments
inferred← citeshttps://doi.org/10.1007/bf02187783openalex-snapshot
Combinatorial complexity bounds for arrangements of curves and spheres
inferred← citeshttps://doi.org/10.1007/bf02187784openalex-snapshot
The complexity and construction of many faces in arrangements of lines and of segments
inferred← citeshttps://doi.org/10.1007/bf02187785openalex-snapshot
The complexity of many cells in arrangements of planes and related problems
inferred← citeshttps://doi.org/10.1007/bf02187805openalex-snapshot
Partitioning arrangements of lines I: An efficient deterministic algorithm
inferred← citeshttps://doi.org/10.1007/bf02187809openalex-snapshot
Partitioning arrangements of lines II: Applications
inferred← citeshttps://doi.org/10.1007/bf02187829openalex-snapshot
An upper bound on the number of planarK-sets
inferred← citeshttps://doi.org/10.1007/bf02189314openalex-snapshot
Cutting hyperplanes for divide-and-conquer
inferred← citeshttps://doi.org/10.1007/bf02189329openalex-snapshot
Constructing arrangements optimally in parallel
inferred← citeshttps://doi.org/10.1007/bf02293052openalex-snapshot
Dynamic point location in arrangements of hyperplanes
inferred← citeshttps://doi.org/10.1007/bf02523679openalex-snapshot
On counting pairs of intersecting segments and off-line triangle range searching
inferred← citeshttps://doi.org/10.1007/bf02570713openalex-snapshot
On geometric optimization with few violated constraints
inferred← citeshttps://doi.org/10.1007/bf02573975openalex-snapshot
On ray shooting in convex polytopes
inferred← citeshttps://doi.org/10.1007/bf02574376openalex-snapshot
On lines missing polyhedral sets in 3-space
inferred← citeshttps://doi.org/10.1007/bf02574384openalex-snapshot
Almost tight upper bounds for lower envelopes in higher dimensions
inferred← citeshttps://doi.org/10.1007/bf02574692openalex-snapshot
On levels in arrangements and voronoi diagrams
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/bfb0009479openalex-snapshot
Separating and shattering long line segments
inferred← citeshttps://doi.org/10.1007/bfb0028246openalex-snapshot
Ray-shooting and isotopy classes of lines in 3-dimensional space
inferred← citeshttps://doi.org/10.1007/bfb0035458openalex-snapshot
Deterministic sampling and optimization
inferred← citeshttps://doi.org/10.1007/bfb0035760openalex-snapshot
A singly-exponential stratification scheme for real semi-algebraic varieties and its applications
inferred← citeshttps://doi.org/10.1007/bfb0054379openalex-snapshot
On the number of regular vertices of the union of Jordan regions
inferred← citeshttps://doi.org/10.1007/pl00009325openalex-snapshot
Bounded-Independence Derandomization of Geometric Partitioning with Applications to Parallel Fixed-Dimensional Linear Programming
inferred← citeshttps://doi.org/10.1007/pl00009394openalex-snapshot
On Constants for Cuttings in the Plane
inferred← citeshttps://doi.org/10.1007/pl00009478openalex-snapshot
Geometric Applications of a Randomized Optimization Technique
inferred← citeshttps://doi.org/10.1007/s00245-016-9381-1openalex-snapshot
Pointwise Constraints in Vector-Valued Sobolev Spaces
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-013-9846-4openalex-snapshot
Streaming Algorithms for Extent Problems in High Dimensions
inferred← citeshttps://doi.org/10.1007/s00453-014-9950-0openalex-snapshot
The Higher-Order Voronoi Diagram of Line Segments
inferred← citeshttps://doi.org/10.1007/s00453-018-00536-7openalex-snapshot
An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams
inferred← citeshttps://doi.org/10.1007/s00454-001-0001-7openalex-snapshot
On the number of regular vertices of the union of jordan regions
inferred← citeshttps://doi.org/10.1007/s00454-001-0006-2openalex-snapshot
A Simple Sampling Lemma: Analysis and Applications in Geometric Optimization
inferred← citeshttps://doi.org/10.1007/s00454-003-2924-7openalex-snapshot
Segment Intersection Searching Problems in General Settings
inferred← citeshttps://doi.org/10.1007/s00454-006-1273-8openalex-snapshot
Improved Approximation Algorithms for Geometric Set Cover
inferred← citeshttps://doi.org/10.1007/s00454-006-1275-6openalex-snapshot
Multi-Pass Geometric Algorithms
inferred← citeshttps://doi.org/10.1007/s00454-008-9118-2openalex-snapshot
On Regular Vertices of the Union of Planar Convex Objects
inferred← citeshttps://doi.org/10.1007/s00454-010-9312-xopenalex-snapshot
On the Union of Cylinders in Three Dimensions
inferred← citeshttps://doi.org/10.1007/s00454-010-9323-7openalex-snapshot
A Non-linear Lower Bound for Planar Epsilon-nets
inferred← citeshttps://doi.org/10.1007/s00454-015-9677-yopenalex-snapshot
On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures
inferred← citeshttps://doi.org/10.1007/s00454-015-9701-2openalex-snapshot
Multilevel Polynomial Partitions and Simplified Range Searching
inferred← citeshttps://doi.org/10.1007/s00454-016-9784-4openalex-snapshot
Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings
inferred← citeshttps://doi.org/10.1007/s00454-018-0043-8openalex-snapshot
A Nearly Quadratic Bound for Point-Location in Hyperplane Arrangements, in the Linear Decision Tree Model
inferred← citeshttps://doi.org/10.1007/s00454-019-00141-7openalex-snapshot
Decomposing Arrangements of Hyperplanes: VC-Dimension, Combinatorial Dimension, and Point Location
inferred← citeshttps://doi.org/10.1007/s00454-020-00193-0openalex-snapshot
Random Sampling with Removal
inferred← citeshttps://doi.org/10.1007/s00454-021-00340-1openalex-snapshot
Algebraic k-Sets and Generally Neighborly Embeddings
inferred← citeshttps://doi.org/10.1007/s10898-021-01033-yopenalex-snapshot
Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks
inferred← citeshttps://doi.org/10.1007/s10898-024-01386-0openalex-snapshot
The edge labeling of higher order Voronoi diagrams
inferred← citeshttps://doi.org/10.1007/s12065-019-00283-wopenalex-snapshot
Data augmentation for cancer classification in oncogenomics: an improved KNN based approach
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(91)90086-copenalex-snapshot
An introduction to randomized algorithms
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90261-yopenalex-snapshot
A singly exponential stratification scheme for real semi-algebraic varieties and its applications
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)90017-mopenalex-snapshot
Relative neighborhood graphs in three dimensions
inferred← citeshttps://doi.org/10.1016/0925-7721(93)90024-zopenalex-snapshot
On vertical ray shooting in arrangements
inferred← citeshttps://doi.org/10.1016/0925-7721(94)90009-4openalex-snapshot
Point location among hyperplanes and unidirectional ray-shooting
inferred← citeshttps://doi.org/10.1016/b978-0-12-800737-2.00018-1openalex-snapshot
IP Packet Filtering and Classification
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50012-6openalex-snapshot
Computational Geometry
inferred← citeshttps://doi.org/10.1016/b978-012088469-8.50077-2openalex-snapshot
Efficient Indexing Methods for Probabilistic Threshold Queries over Uncertain Data
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/50005-xopenalex-snapshot
Deterministic Parallel Computational Geometry
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/b978-044482537-7/50019-xopenalex-snapshot
Parallel Computational Geometry: An Approach using Randomization
inferred← citeshttps://doi.org/10.1016/j.comgeo.2005.02.003openalex-snapshot
Counting and representing intersections among triangles in three dimensions
inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.04.005openalex-snapshot
Optimal in-place and cache-oblivious algorithms for 3-d convex hulls and 2-d segment intersection
inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.10.004openalex-snapshot
Space/query-time tradeoff for computing the visibility polygon
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.04.006openalex-snapshot
Fast segment insertion and incremental construction of constrained Delaunay triangulations
inferred← citeshttps://doi.org/10.1016/j.comgeo.2016.08.004openalex-snapshot
A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams
inferred← citeshttps://doi.org/10.1016/j.dam.2012.03.009openalex-snapshot
Minimizing the error of linear separators on linearly inseparable data
inferred← citeshttps://doi.org/10.1016/j.datak.2008.06.009openalex-snapshot
A new approach on indexing mobile objects on the plane
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.01.010openalex-snapshot
A note on point location in arrangements of hyperplanes
inferred← citeshttps://doi.org/10.1016/j.ipl.2013.07.023openalex-snapshot
Order-k α-hulls and α-shapes
inferred← citeshttps://doi.org/10.1016/s0010-4485(97)00075-4openalex-snapshot
Filling polyhedral molds
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00188-9openalex-snapshot
Separating and shattering long line segments
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80068-6openalex-snapshot
Efficient NC algorithms for set cover with applications to learning and geometry
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80069-8openalex-snapshot
The probabilistic method yields deterministic parallel algorithms
inferred← citeshttps://doi.org/10.1016/s0097-8493(98)00003-xopenalex-snapshot
Analysis and construction of worst-case optimal ray shooting algorithms
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00024-2openalex-snapshot
A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon
inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80065-xopenalex-snapshot
An algorithm for generalized point location and its applications
inferred← citeshttps://doi.org/10.1016/s0925-7721(00)00005-5openalex-snapshot
Cylindrical static and kinetic binary space partitions
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/s0927-0507(05)80124-0openalex-snapshot
Chapter 7 A survey of computational geometry
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80337-8openalex-snapshot
On a Simple Sampling Lemma
inferred← citeshttps://doi.org/10.1017/s0963548317000591openalex-snapshot
Robust Tverberg and Colourful Carathéodory Results via Random Choice
inferred← citeshttps://doi.org/10.1051/ita/1991250201031openalex-snapshot
Spanning trees with low crossing number
inferred← citeshttps://doi.org/10.1080/00029890.1989.11972221openalex-snapshot
Algorithms in Combinatorial Geometry. By Herbert Edelsbrunner
inferred← citeshttps://doi.org/10.1080/00029890.1990.11995657openalex-snapshot
A Whirlwind Tour of Computational Geometry
inferred← citeshttps://doi.org/10.1090/bull/1653openalex-snapshot
The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
inferred← citeshttps://doi.org/10.1090/conm/223/03131openalex-snapshot
Geometric range searching and its relatives
inferred← citeshttps://doi.org/10.1090/surv/173/08openalex-snapshot
Sampling and the moments technique
inferred← citeshttps://doi.org/10.1109/35.668286openalex-snapshot
Beyond best effort: router architectures for the differentiated services of tomorrow's Internet
inferred← citeshttps://doi.org/10.1109/access.2022.3152206openalex-snapshot
Low-Rank Methods in Event Detection With Subsampled Point-to-Subspace Proximity Tests
inferred← citeshttps://doi.org/10.1109/cisp.2009.5305692openalex-snapshot
A Parallel Dynamic Convex Hull Algorithm Based on the Macro to Micro Model
inferred← citeshttps://doi.org/10.1109/fmcad.2008.ecp.17openalex-snapshot
A Theory-Based Decision Heuristic for DPLL(T)
inferred← citeshttps://doi.org/10.1109/focs.2007.10openalex-snapshot
Almost Tight Bound for the Union of Fat Tetrahedra in Three Dimensions
inferred← citeshttps://doi.org/10.1109/focs.2007.9openalex-snapshot
Extractors and Rank Extractors for Polynomial Sources
inferred← citeshttps://doi.org/10.1109/focs.2008.25openalex-snapshot
On the Union of Cylinders in Three Dimensions
inferred← citeshttps://doi.org/10.1109/focs.2010.39openalex-snapshot
A Non-linear Lower Bound for Planar Epsilon-Nets
inferred← citeshttps://doi.org/10.1109/iccsit.2010.5563736openalex-snapshot
Notice of Retraction: A parallel dynamic convex hull algorithm based on the M2M model originated from thinking pattern of human beings
inferred← citeshttps://doi.org/10.1109/iccsnt.2012.6526188openalex-snapshot
Dynamic construction of order-k Voronoi diagram
inferred← citeshttps://doi.org/10.1109/isvd.2006.36openalex-snapshot
Using Line and Texture to Visualize Higher-Order Voronoi Diagrams
inferred← citeshttps://doi.org/10.1109/isvd.2013.17openalex-snapshot
A Sweepline Algorithm for Higher Order Voronoi Diagrams
inferred← citeshttps://doi.org/10.1109/jsac.2011.110103openalex-snapshot
Impact of Vehicles as Obstacles in Vehicular Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21961openalex-snapshot
A Las Vegas algorithm for linear programming when the dimension is small
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21970openalex-snapshot
A deterministic view of random sampling and its use in geometry
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21973openalex-snapshot
Combinatorial complexity bounds for arrangements of curves and surfaces
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63455openalex-snapshot
Efficient NC algorithms for set cover with applications to learning and geometry
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63458openalex-snapshot
An upper bound on the number of planar k-sets
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185345openalex-snapshot
An optimal convex hull algorithm and new results on cuttings
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.185371openalex-snapshot
Randomized multidimensional search trees: further results in dynamic sampling
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185401openalex-snapshot
Discrepancy and in -approximations for bounded VC-dimension
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267805openalex-snapshot
A subexponential algorithm for abstract optimization problems
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267816openalex-snapshot
Dynamic half-space reporting, geometric optimization, and minimum spanning trees
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366837openalex-snapshot
Almost tight upper bounds for lower envelopes in higher dimensions
inferred← citeshttps://doi.org/10.1109/sfcs.1996.548506openalex-snapshot
New lower bounds for halfspace emptiness
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/synasc.2010.73openalex-snapshot
On Lower Bounds for Algebraic Decision Trees over the Complex Numbers
inferred← citeshttps://doi.org/10.1137/0217052openalex-snapshot
A Randomized Algorithm for Closest-Point Queries
inferred← citeshttps://doi.org/10.1137/0219020openalex-snapshot
Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection
inferred← citeshttps://doi.org/10.1137/0221020openalex-snapshot
Efficient Point Location in a Convex Spatial Cell-Complex
inferred← citeshttps://doi.org/10.1137/0221031openalex-snapshot
Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems
inferred← citeshttps://doi.org/10.1137/0221035openalex-snapshot
Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number
inferred← citeshttps://doi.org/10.1137/090762968openalex-snapshot
Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch83openalex-snapshot
Approximating the k-Level in Three-Dimensional Plane Arrangements
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/1.9781611976465.89openalex-snapshot
Near-Optimal Randomized Algorithms for Selection in Totally Monotone Matrices
inferred← citeshttps://doi.org/10.1137/1.9781611977073.10openalex-snapshot
Hopcroft's Problem, Log-Star Shaving, 2D Fractional Cascading, and Decision Trees
inferred← citeshttps://doi.org/10.1137/1.9781611977073.123openalex-snapshot
Constructing Many Faces in Arrangements of Lines and Segments
inferred← citeshttps://doi.org/10.1137/12089702xopenalex-snapshot
Self-Improving Algorithms for Coordinatewise Maxima and Convex Hulls
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/s0097539790184298openalex-snapshot
Randomized Algorithms for Binary Search and Load Balancing on Fixed Connection Networks with Geometric Applications
inferred← citeshttps://doi.org/10.1137/s0097539792229404openalex-snapshot
On Collision-Free Placements of Simplices and the Closest Pair of Lines in 3-Space
inferred← citeshttps://doi.org/10.1137/s0097539793250287openalex-snapshot
A Subexponential Algorithm for Abstract Optimization Problems
inferred← citeshttps://doi.org/10.1137/s0097539793256880openalex-snapshot
On Point Location and Motion Planning among Simplices
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
showing the first 200 of 302 · page through all 302
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.