On the public citation graph
A deterministic view of random sampling and its use in geometry
0 signed · 261 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/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/bf02187742openalex-snapshot
Implicitly representing arrangements of lines or segments
inferredcites →https://doi.org/10.1007/bf02187879openalex-snapshot
New applications of random sampling in computational geometry
inferredcites →https://doi.org/10.1016/0012-365x(75)90058-8openalex-snapshot
On the ratio of optimal integral and fractional covers
inferredcites →https://doi.org/10.1016/0097-3165(72)90019-2openalex-snapshot
On the density of families of sets
inferredcites →https://doi.org/10.1016/0196-6774(86)90019-2openalex-snapshot
A fast and simple randomized parallel algorithm for the maximal independent set problem
inferredcites →https://doi.org/10.1016/c2009-0-09109-0openalex-snapshot
Combinatorial Problems and Exercises
inferredcites →https://doi.org/10.1109/18.21258openalex-snapshot
Explicit codes with low covering radius
inferredcites →https://doi.org/10.1109/sfcs.1986.45openalex-snapshot
Probabilistic construction of deterministic algorithms: Approximating packing integer programs
inferredcites →https://doi.org/10.1137/0215024openalex-snapshot
Constructing Arrangements of Lines and Hyperplanes with Applications
inferredcites →https://doi.org/10.1137/0217010openalex-snapshot
An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
inferredcites →https://doi.org/10.1137/0217052openalex-snapshot
A Randomized Algorithm for Closest-Point Queries
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/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/73393.73396openalex-snapshot
A fast Las Vegas algorithm for triangulating a simple polygon
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.73399openalex-snapshot
The complexity of many faces in arrangements of lines of segments
inferredcites →https://doi.org/10.1145/73393.73401openalex-snapshot
Red-Blue intersection detection algorithms, with applications to motion planning and collision detection
inferredcites →https://doi.org/10.1214/aop/1176996762openalex-snapshot
On a Set of Almost Deterministic $k$-Independent Random Variables
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.1006/jagm.1996.0060openalex-snapshot
On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
inferred← citeshttps://doi.org/10.1007/10719839_22openalex-snapshot
Multi-parameter Minimum Spanning Trees
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-45294-x_16openalex-snapshot
Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope of Line Segments in Parallel
inferred← citeshttps://doi.org/10.1007/3-540-51542-9_2openalex-snapshot
Efficient spatial point location
inferred← citeshttps://doi.org/10.1007/3-540-52846-6_107openalex-snapshot
Intersection queries in sets of disks
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-55808-x_1openalex-snapshot
On range searching with semialgebraic sets
inferred← citeshttps://doi.org/10.1007/3-540-68530-8_34openalex-snapshot
Improved Deterministic Parallel Padded Sorting
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_18openalex-snapshot
Derandomization in Combinatorial Optimization
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-21840-3_40openalex-snapshot
Time-Space Trade-offs for Triangulations and 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_12openalex-snapshot
One-Sided Epsilon-Approximants
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-319-44479-6_21openalex-snapshot
Near-Optimal Lower Bounds for ε-Nets for Half-Spaces and Low Complexity Set Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_41openalex-snapshot
Cuttings for Disks and Axis-Aligned Rectangles
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_4openalex-snapshot
Epsilon-Nets and Computational Geometry
inferred← citeshttps://doi.org/10.1007/978-3-642-61012-7_12openalex-snapshot
Suchen und Konstruieren durch Verdoppeln
inferred← citeshttps://doi.org/10.1007/978-3-662-48350-3_75openalex-snapshot
Geometric Hitting Sets for Disks: Theory and Practice
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/bf01940875openalex-snapshot
Randomized geometric algorithms and pseudorandom generators
inferred← citeshttps://doi.org/10.1007/bf01955043openalex-snapshot
Lines in Space: Combinatorics and Algorithms
inferred← citeshttps://doi.org/10.1007/bf01994881openalex-snapshot
Intersection queries in sets of disks
inferred← citeshttps://doi.org/10.1007/bf02189314openalex-snapshot
Cutting hyperplanes for divide-and-conquer
inferred← citeshttps://doi.org/10.1007/bf02293052openalex-snapshot
Dynamic point location in arrangements of hyperplanes
inferred← citeshttps://doi.org/10.1007/bf02392598openalex-snapshot
Improved upper bounds for approximation by zonotopes
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/bf02570718openalex-snapshot
Almost optimal set covers in finite VC-dimension
inferred← citeshttps://doi.org/10.1007/bf02573972openalex-snapshot
Range searching with efficient hierarchical cuttings
inferred← citeshttps://doi.org/10.1007/bf02573985openalex-snapshot
An optimal convex hull algorithm in any fixed dimension
inferred← citeshttps://doi.org/10.1007/bf02574015openalex-snapshot
On range searching with semialgebraic sets
inferred← citeshttps://doi.org/10.1007/bf02574376openalex-snapshot
On lines missing polyhedral sets in 3-space
inferred← citeshttps://doi.org/10.1007/bf02716578openalex-snapshot
Vertical decompositions for triangles in 3-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/bfb0058020openalex-snapshot
Solving Some Discrepancy Problems in NC
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/pl00009327openalex-snapshot
Primal Dividing and Dual Pruning: Output-Sensitive Construction of Four-Dimensional Polytopes and Three-Dimensional Voronoi Diagrams
inferred← citeshttps://doi.org/10.1007/pl00009337openalex-snapshot
Largest Placement of One Convex Polygon Inside Another
inferred← citeshttps://doi.org/10.1007/pl00009394openalex-snapshot
On Constants for Cuttings in the Plane
inferred← citeshttps://doi.org/10.1007/s00453-006-1229-7openalex-snapshot
Motorcycle Graphs and Straight Skeletons
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.1007/s00454-001-0029-8openalex-snapshot
An Optimal Deterministic Algorithm for Computing the Diameter of a Three-Dimensional Point Set
inferred← citeshttps://doi.org/10.1007/s00454-001-0084-1openalex-snapshot
Cutting Circles into Pseudo-Segments and Improved Bounds for Incidences% and Complexity of Many Faces
inferred← citeshttps://doi.org/10.1007/s00454-002-0727-xopenalex-snapshot
The Number of Congruent Simplices in a Point Set
inferred← citeshttps://doi.org/10.1007/s00454-003-2856-2openalex-snapshot
On the Complexity of Halfspace Area Queries
inferred← citeshttps://doi.org/10.1007/s00454-004-1093-7openalex-snapshot
An Improved Bound for Joints in Arrangements of Lines in Space
inferred← citeshttps://doi.org/10.1007/s00454-004-1111-9openalex-snapshot
Incidences between Points and Circles in Three and Higher Dimensions
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-009-9158-2openalex-snapshot
Cuttings for Disks and Axis-Aligned Rectangles in Three-Space
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-012-9464-yopenalex-snapshot
A Center Transversal Theorem for Hyperplanes and Applications to Graph Drawing
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-016-9808-0openalex-snapshot
From Proximity to Utility: A Voronoi Partition of Pareto Optima
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-00103-zopenalex-snapshot
On Separating Points by Lines
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-022-00437-1openalex-snapshot
Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets: Collinearity Testing and Related Problems
inferred← citeshttps://doi.org/10.1007/s00454-024-00648-8openalex-snapshot
On the Number of Incidences When Avoiding an Induced Biclique in Geometric Settings
inferred← citeshttps://doi.org/10.1007/s00454-024-00656-8openalex-snapshot
Intersection Searching amid Tetrahedra in Four Dimensions
inferred← citeshttps://doi.org/10.1007/s00493-008-2099-1openalex-snapshot
Near optimal bounds for the Erdős distinct distances problem in high dimensions
inferred← citeshttps://doi.org/10.1007/s00493-017-3564-5openalex-snapshot
A Simple Proof of Optimal Epsilon Nets
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90076-topenalex-snapshot
On disjoint concave chains in arrangements of (pseudo) lines
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00057-3openalex-snapshot
On disjoint concave chains in arrangements of (pseudo) lines
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/0925-7721(92)90001-9openalex-snapshot
Farthest neighbors, maximum spanning trees and related problems in higher dimensions
inferred← citeshttps://doi.org/10.1016/0925-7721(92)90006-eopenalex-snapshot
Reporting points in halfspaces
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/0925-7721(95)00020-8openalex-snapshot
The exact fitting problem in higher dimensions
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00025-9openalex-snapshot
A deterministic algorithm for the three-dimensional diameter problem
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/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.aim.2021.107779openalex-snapshot
Planar point sets determine many pairwise crossing segments
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.2012.10.004openalex-snapshot
Space/query-time tradeoff for computing the visibility polygon
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.12.002openalex-snapshot
Tighter estimates for ϵ-nets for disks
inferred← citeshttps://doi.org/10.1016/j.comgeo.2017.01.001openalex-snapshot
Time–space trade-offs for triangulations and Voronoi diagrams
inferred← citeshttps://doi.org/10.1016/j.disc.2009.10.026openalex-snapshot
A note on the number of different inner products generated by a finite set of vectors
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.06.005openalex-snapshot
A note about weak ε-nets for axis-parallel boxes in d-space
inferred← citeshttps://doi.org/10.1016/j.jpdc.2006.12.006openalex-snapshot
Output-sensitive algorithms for optimally constructing the upper envelope of straight line segments in parallel
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00322-5openalex-snapshot
An efficient k nearest neighbors searching algorithm for a query line
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00638-2openalex-snapshot
Decomposable multi-parameter matroid optimization problems
inferred← citeshttps://doi.org/10.1016/s0925-7721(97)00009-6openalex-snapshot
Optimal, output-sensitive algorithms for constructing planar hulls in parallel
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80124-0openalex-snapshot
Chapter 7 A survey of computational geometry
inferred← citeshttps://doi.org/10.1017/s0963548304006091openalex-snapshot
Distinct Distances in Three and Higher Dimensions
inferred← citeshttps://doi.org/10.1017/s0963548308009127openalex-snapshot
On a Question of Bourgain about Geometric Incidences
inferred← citeshttps://doi.org/10.1017/s0963548317000591openalex-snapshot
Robust Tverberg and Colourful Carathéodory Results via Random Choice
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/ciss.2008.4558610openalex-snapshot
Optimizing wireless networks for heterogeneous spatial loads
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/focs.2012.32openalex-snapshot
On Range Searching with Semialgebraic Sets II
inferred← citeshttps://doi.org/10.1109/focs.2016.92openalex-snapshot
On Approximating Maximum Independent Set of Rectangles
inferred← citeshttps://doi.org/10.1109/focs.2018.00030openalex-snapshot
An Improved Bound for Weak Epsilon-Nets in the Plane
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00072openalex-snapshot
2D Generalization of Fractional Cascading on Axis-aligned Planar Subdivisions
inferred← citeshttps://doi.org/10.1109/sct.1993.336545openalex-snapshot
On limited nondeterminism and the complexity of the V-C dimension
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.185370openalex-snapshot
Reporting points in halfspaces
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.366847openalex-snapshot
Product range spaces, sensitive sampling, and derandomization
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365724openalex-snapshot
Parallel algorithms for higher-dimensional convex hulls
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/0220013openalex-snapshot
Approximate Levels in Line Arrangements
inferred← citeshttps://doi.org/10.1137/090762968openalex-snapshot
Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
inferred← citeshttps://doi.org/10.1137/090765092openalex-snapshot
Semialgebraic Range Reporting and Emptiness Searching with Applications
inferred← citeshttps://doi.org/10.1137/1.9781611973730.100openalex-snapshot
Density and regularity theorems for semi-algebraic hypergraphs
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.9781611974782.163openalex-snapshot
Incidences with curves and surfaces in three dimensions, with applications to distinct and repeated distances
inferred← citeshttps://doi.org/10.1137/1.9781611975031.59openalex-snapshot
On Separating Points by Lines
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.9781611977073.10openalex-snapshot
Hopcroft's Problem, Log-Star Shaving, 2D Fractional Cascading, and Decision Trees
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch49openalex-snapshot
Halving by a Thousand Cuts or Punctures
inferred← citeshttps://doi.org/10.1137/15m1007355openalex-snapshot
A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing
inferred← citeshttps://doi.org/10.1137/19m1257548openalex-snapshot
Constructive Polynomial Partitioning for Algebraic Curves in $\mathbb{R}^3$ with Applications
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/21m1408245openalex-snapshot
On Ray Shooting for Triangles in 3-Space and Related Problems
inferred← citeshttps://doi.org/10.1137/s0097539704444245openalex-snapshot
Output-Sensitive Construction of the Union of Triangles
inferred← citeshttps://doi.org/10.1137/s0097539704446724openalex-snapshot
Optimal Expected-Case Planar Point Location
inferred← citeshttps://doi.org/10.1137/s0097539793244368openalex-snapshot
Ray Shooting Amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions
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/s0097539796260321openalex-snapshot
Product Range Spaces, Sensitive Sampling, and Derandomization
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.1137/s0097539799350232openalex-snapshot
Constructing Planar Cuttings in Theory and Practice
inferred← citeshttps://doi.org/10.1142/s0218195901000523openalex-snapshot
RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS
inferred← citeshttps://doi.org/10.1142/s0218195913600054openalex-snapshot
IMPROVED POINTER MACHINE AND I/O LOWER BOUNDS FOR SIMPLEX RANGE REPORTING AND RELATED PROBLEMS
inferred← citeshttps://doi.org/10.1142/s021819591550017xopenalex-snapshot
An Upper Bound on the k-Modem Illumination Problem
inferred← citeshttps://doi.org/10.1145/103418.103470openalex-snapshot
Approximations and optimal geometric divide-and-conquer
inferred← citeshttps://doi.org/10.1145/1064092.1064115openalex-snapshot
Improved approximation algorithms for geometric set cover
inferred← citeshttps://doi.org/10.1145/1064092.1064121openalex-snapshot
Multi-pass geometric algorithms
inferred← citeshttps://doi.org/10.1145/109648.109663openalex-snapshot
Dynamic point location in arrangements of hyperplanes
inferred← citeshttps://doi.org/10.1145/142675.142732openalex-snapshot
Range searching with efficient hierarchical cuttings
inferred← citeshttps://doi.org/10.1145/1536414.1536501openalex-snapshot
Small-size ε-nets for axis-parallel rectangles and boxes
inferred← citeshttps://doi.org/10.1145/1542362.1542421openalex-snapshot
On the set multi-cover problem in geometric settings
inferred← citeshttps://doi.org/10.1145/160985.160990openalex-snapshot
On lines missing polyhedral sets in 3-space
inferred← citeshttps://doi.org/10.1145/160985.161002openalex-snapshot
Geometric partitioning made easier, even in parallel
inferred← citeshttps://doi.org/10.1145/1613676.1613678openalex-snapshot
On the union of fat tetrahedra in three dimensions
inferred← citeshttps://doi.org/10.1145/167088.167211openalex-snapshot
A parallel approximation algorithm for positive linear programming
inferred← citeshttps://doi.org/10.1145/167088.167217openalex-snapshot
A deterministic algorithm for the three-dimensional diameter problem
inferred← citeshttps://doi.org/10.1145/174666.174667openalex-snapshot
On randomization in sequential and distributed algorithms
inferred← citeshttps://doi.org/10.1145/177424.177427openalex-snapshot
Vertical decompositions for triangles in 3-space
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.178029openalex-snapshot
Almost optimal set covers in finite VC-dimension
inferred← citeshttps://doi.org/10.1145/1810959.1810974openalex-snapshot
The 2-center problem in three dimensions
inferred← citeshttps://doi.org/10.1145/195058.195411openalex-snapshot
Improved algorithms via approximations of probability distributions (extended abstract)
inferred← citeshttps://doi.org/10.1145/1993636.1993712openalex-snapshot
A unified framework for approximating and clustering data
inferred← citeshttps://doi.org/10.1145/1998196.1998215openalex-snapshot
A center transversal theorem for hyperplanes and applications to graph drawing
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/2261250.2261301openalex-snapshot
Improved pointer machine and I/O lower bounds for simplex range reporting and related problems
inferred← citeshttps://doi.org/10.1145/235666.571627openalex-snapshot
Computational Geometry Column 29
inferred← citeshttps://doi.org/10.1145/237218.237347openalex-snapshot
On computing Voronoi diagrams by divide-prune-and-conquer
inferred← citeshttps://doi.org/10.1145/237218.237351openalex-snapshot
Faster output-sensitive parallel convex hulls for d≤3
inferred← citeshttps://doi.org/10.1145/2390176.2390185openalex-snapshot
On the set multicover problem in geometric settings
inferred← citeshttps://doi.org/10.1145/2582112.2582155openalex-snapshot
The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection
inferred← citeshttps://doi.org/10.1145/2582112.2582157openalex-snapshot
Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of Polygons
inferred← citeshttps://doi.org/10.1145/2700222openalex-snapshot
The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection
inferred← citeshttps://doi.org/10.1145/276884.276914openalex-snapshot
Randomized external-memory algorithms for some geometric problems
inferred← citeshttps://doi.org/10.1145/276884.276921openalex-snapshot
Constructing cuttings in theory and practice
inferred← citeshttps://doi.org/10.1145/2996913.2996952openalex-snapshot
Massively parallel algorithms for computing TIN DEMs and contour trees for large terrains
inferred← citeshttps://doi.org/10.1145/304893.304993openalex-snapshot
On range reporting, ray shooting and k -level construction
inferred← citeshttps://doi.org/10.1145/3326122openalex-snapshot
Approximation Schemes for Independent Set and Sparse Subsets of Polygons
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.1145/3406325.3451062openalex-snapshot
Stronger bounds for weak epsilon-nets in higher dimensions
inferred← citeshttps://doi.org/10.1145/3555985openalex-snapshot
An Improved Bound for Weak Epsilon-nets in the Plane
inferred← citeshttps://doi.org/10.1145/3578574openalex-snapshot
Lower Bounds for Semialgebraic Range Searching and Stabbing Problems
inferred← citeshttps://doi.org/10.1145/3591357openalex-snapshot
Hopcroft’s Problem, Log* Shaving, Two-dimensional Fractional Cascading, and Decision Trees
inferred← citeshttps://doi.org/10.1145/378583.378587openalex-snapshot
On the number of congruent simplices in a point
inferred← citeshttps://doi.org/10.1145/513400.513416openalex-snapshot
Incidences between points and circles in three and higher dimensions
inferred← citeshttps://doi.org/10.1145/513400.513417openalex-snapshot
Lenses in arrangements of pseudo-circles and their applications
showing the first 200 of 236 · page through all 236
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.