On the public citation graph
Efficient partition trees
0 signed · 232 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-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/bf01293483openalex-snapshot
Dynamic half-space range reporting and its applications
inferredcites →https://doi.org/10.1007/bf02122778openalex-snapshot
A deterministic view of random sampling and its use in geometry
inferredcites →https://doi.org/10.1007/bf02187685openalex-snapshot
Halfspace range search: An algorithmic application ofk-sets
inferredcites →https://doi.org/10.1007/bf02187743openalex-snapshot
Quasi-optimal range searching in spaces of finite VC-dimension
inferredcites →https://doi.org/10.1007/bf02187809openalex-snapshot
Partitioning arrangements of lines II: Applications
inferredcites →https://doi.org/10.1007/bf02189314openalex-snapshot
Cutting hyperplanes for divide-and-conquer
inferredcites →https://doi.org/10.1007/bfb0014927openalex-snapshot
The Design of Dynamic Data Structures
inferredcites →https://doi.org/10.1016/0020-0190(79)90117-0openalex-snapshot
Decomposable searching problems
inferredcites →https://doi.org/10.1016/0020-0190(86)90088-8openalex-snapshot
Halfplanar range search in linear space and O(n0.695) query time
inferredcites →https://doi.org/10.1090/s0894-0347-1989-1001852-0openalex-snapshot
Lower Bounds on the Complexity of Polytope Range Searching
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/sfcs.1991.185370openalex-snapshot
Reporting points in halfspaces
inferredcites →https://doi.org/10.1109/sfcs.1991.185401openalex-snapshot
Discrepancy and in -approximations for bounded VC-dimension
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/100216.100260openalex-snapshot
Solving query-retrieval problems by compacting Voronoi diagrams
inferredcites →https://doi.org/10.1145/103418.103470openalex-snapshot
Approximations and optimal geometric divide-and-conquer
inferredcites →https://doi.org/10.1145/129712.129763openalex-snapshot
Ray shooting and parametric search
inferredcites →https://doi.org/10.1145/142675.142732openalex-snapshot
Range searching with efficient hierarchical cuttings
inferredcites →https://doi.org/10.1145/22145.22163openalex-snapshot
A general approach to d-dimensional geometric queries
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/98524.98532openalex-snapshot
Quasi-optimal upper bounds for simplex range searching and new zone theorems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcss.2000.1709openalex-snapshot
Efficient Searching with Linear Constraints
inferred← citeshttps://doi.org/10.1007/11534273_23openalex-snapshot
Orthogonal Subdivisions with Low Stabbing Numbers
inferred← citeshttps://doi.org/10.1007/11561071_46openalex-snapshot
Efficient c-Oriented Range Searching with DOP-Trees
inferred← citeshttps://doi.org/10.1007/11589440_6openalex-snapshot
Towards Faster Linear-Sized Nets for Axis-Aligned Boxes in the Plane
inferred← citeshttps://doi.org/10.1007/11589440_7openalex-snapshot
Farthest-Point Queries with Geometric and Combinatorial Constraints
inferred← citeshttps://doi.org/10.1007/3-540-44634-6_6openalex-snapshot
Time Responsive External Data Structures for Moving Points
inferred← citeshttps://doi.org/10.1007/3-540-44676-1_1openalex-snapshot
External Memory Data Structures
inferred← citeshttps://doi.org/10.1007/3-540-44842-x_80openalex-snapshot
Computing a Closest Point to a Query Hyperplane in Three and Higher Dimensions
inferred← citeshttps://doi.org/10.1007/3-540-46632-0_41openalex-snapshot
Output-Sensitive Algorithms for Uniform Partitions of Points
inferred← citeshttps://doi.org/10.1007/3-540-48762-x_71openalex-snapshot
Efficient Image Retrieval through Vantage Objects
inferred← citeshttps://doi.org/10.1007/3-540-63307-3_69openalex-snapshot
Dynamic data structures for fat objects and their applications
inferred← citeshttps://doi.org/10.1007/978-0-387-35973-1_614openalex-snapshot
Indexing Schemes for Multi-dimensional Moving Objects
inferred← citeshttps://doi.org/10.1007/978-1-4419-8590-3_7openalex-snapshot
Spatiotemporal Access Methods
inferred← citeshttps://doi.org/10.1007/978-1-4615-0005-6_9openalex-snapshot
External Memory Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-030-04651-4_34openalex-snapshot
Does a Robot Path Have Clearance C?
inferred← citeshttps://doi.org/10.1007/978-3-030-24766-9_20openalex-snapshot
Range Closest-Pair Search in Higher Dimensions
inferred← citeshttps://doi.org/10.1007/978-3-319-09129-7_28openalex-snapshot
Closest-Point Queries for Complex Objects
inferred← citeshttps://doi.org/10.1007/978-3-319-17885-1_614openalex-snapshot
Indexing Schemes for Multidimensional Moving Objects
inferred← citeshttps://doi.org/10.1007/978-3-319-23519-6_614-2openalex-snapshot
Indexing Schemes for Multi-dimensional Moving Objects
inferred← citeshttps://doi.org/10.1007/978-3-319-34171-2_21openalex-snapshot
Subquadratic Algorithms for Succinct Stable Matching
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-24595-7_14openalex-snapshot
Fixed-Location Circular-Arc Drawing of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-30140-0_3openalex-snapshot
Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects
inferred← citeshttps://doi.org/10.1007/978-3-540-30551-4_9openalex-snapshot
Polyline Fitting of Planar Points Under Min-sum Criteria
inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_18openalex-snapshot
Kinetic Dictionaries: How to Shoot a Moving Target
inferred← citeshttps://doi.org/10.1007/978-3-540-74472-6_6openalex-snapshot
Weak Visibility of Two Objects in Planar Polygonal Scenes
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_68openalex-snapshot
Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations
inferred← citeshttps://doi.org/10.1007/978-3-642-19222-7_36openalex-snapshot
Improved Points Approximation Algorithms Based on Simplicial Thickness Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-21204-8_36openalex-snapshot
Visibility Testing and Counting
inferred← citeshttps://doi.org/10.1007/978-3-642-22300-6_26openalex-snapshot
On Rectilinear Partitions with Minimum Stabbing Number
inferred← citeshttps://doi.org/10.1007/978-3-642-31155-0_8openalex-snapshot
A Simple Framework for the Generalized Nearest Neighbor Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-40104-6_42openalex-snapshot
Unions of Onions: Preprocessing Imprecise Points for Fast Onion Layer Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-642-40273-9_15openalex-snapshot
Succinct and Implicit Data Structures for Computational Geometry
inferred← citeshttps://doi.org/10.1007/978-3-642-60607-6_19openalex-snapshot
Conversion of Binary Space Partitioning Trees to Boundary Representation
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-44777-2_47openalex-snapshot
Halving Balls in Deterministic Linear Time
inferred← citeshttps://doi.org/10.1007/bf01293483openalex-snapshot
Dynamic half-space range reporting and its applications
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/bf02573975openalex-snapshot
On ray shooting in convex polytopes
inferred← citeshttps://doi.org/10.1007/bf02574015openalex-snapshot
On range searching with semialgebraic sets
inferred← citeshttps://doi.org/10.1007/bf02717729openalex-snapshot
Equipartition of mass distributions by hyperplanes
inferred← citeshttps://doi.org/10.1007/bfb0049412openalex-snapshot
Range searching and point location among fat objects
inferred← citeshttps://doi.org/10.1007/bfb0058020openalex-snapshot
Solving Some Discrepancy Problems in NC
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/s00224-008-9135-9openalex-snapshot
Covering Many or Few Points with Unit Disks
inferred← citeshttps://doi.org/10.1007/s00453-001-0084-9openalex-snapshot
Improved Algorithms for Uniform Partitions of Points
inferred← citeshttps://doi.org/10.1007/s00453-009-9322-3openalex-snapshot
On Bounded Leg Shortest Paths Problems
inferred← citeshttps://doi.org/10.1007/s00453-012-9679-6openalex-snapshot
Relative Convex Hulls in Semi-Dynamic Arrangements
inferred← citeshttps://doi.org/10.1007/s00453-019-00564-xopenalex-snapshot
Subquadratic Algorithms for Succinct Stable Matching
inferred← citeshttps://doi.org/10.1007/s00453-024-01284-7openalex-snapshot
Line Intersection Searching Amid Unit Balls in 3-Space
inferred← citeshttps://doi.org/10.1007/s00453-025-01358-0openalex-snapshot
Computing the Minimum Bottleneck Moving Spanning Tree
inferred← citeshttps://doi.org/10.1007/s00454-001-0002-6openalex-snapshot
Conical equipartitions of mass distributions
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-003-2949-yopenalex-snapshot
Testing Homotopy for Paths in the Plane
inferred← citeshttps://doi.org/10.1007/s00454-004-1116-4openalex-snapshot
New Constructions of Weak ?-Nets
inferred← citeshttps://doi.org/10.1007/s00454-007-9025-yopenalex-snapshot
Tight Bounds for Connecting Sites Across Barriers
inferred← citeshttps://doi.org/10.1007/s00454-010-9248-1openalex-snapshot
Relative (p,ε)-Approximations in Geometry
inferred← citeshttps://doi.org/10.1007/s00454-010-9308-6openalex-snapshot
Range Minima Queries with Respect to a Random Permutation, and Approximate Range Counting
inferred← citeshttps://doi.org/10.1007/s00454-012-9443-3openalex-snapshot
Simple Proofs of Classical Theorems in Discrete Geometry via the Guth–Katz Polynomial Partitioning Technique
inferred← citeshttps://doi.org/10.1007/s00454-014-9625-2openalex-snapshot
A Faster Algorithm for Computing Motorcycle Graphs
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-9845-8openalex-snapshot
$$\varepsilon $$ ε -Mnets: Hitting Geometric Set Systems with Subsets
inferred← citeshttps://doi.org/10.1007/s00454-019-00099-6openalex-snapshot
Near-Linear Algorithms for Geometric Hitting Sets and Set Covers
inferred← citeshttps://doi.org/10.1007/s00454-019-00103-zopenalex-snapshot
On Separating Points by Lines
inferred← citeshttps://doi.org/10.1007/s00454-020-00229-5openalex-snapshot
Dynamic Geometric Data Structures via Shallow Cuttings
inferred← citeshttps://doi.org/10.1007/s00454-020-00231-xopenalex-snapshot
On Grids in Point-Line Arrangements in the Plane
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-00709-yopenalex-snapshot
Algorithms for Halfplane Coverage and Related Problems
inferred← citeshttps://doi.org/10.1007/s00778-004-0139-zopenalex-snapshot
Indexing mobile objects using dual transformations
inferred← citeshttps://doi.org/10.1007/s10619-005-6830-2openalex-snapshot
An Indexing Method for Answering Queries on Moving Objects
inferred← citeshttps://doi.org/10.1007/s10998-008-8217-7openalex-snapshot
Convex subdivisions with low stabbing numbers
inferred← citeshttps://doi.org/10.1007/s11856-023-2517-5openalex-snapshot
Around the log-rank conjecture
inferred← citeshttps://doi.org/10.1016/0097-3165(94)90005-1openalex-snapshot
On joints in arrangements of lines in space and related problems
inferred← citeshttps://doi.org/10.1016/0925-7721(92)90006-eopenalex-snapshot
Reporting points in halfspaces
inferred← citeshttps://doi.org/10.1016/0925-7721(94)00018-qopenalex-snapshot
Derandomizing an output-sensitive convex hull algorithm in three dimensions
inferred← citeshttps://doi.org/10.1016/0925-7721(94)00019-0openalex-snapshot
Algorithms for generalized halfspace range searching and other intersection searching problems
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00012-7openalex-snapshot
Algorithms for generalized halfspace range searching and other intersection searching problems
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/0925-7721(95)00028-3openalex-snapshot
Fast algorithms for collision and proximity problems involving moving geometric objects
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.aim.2005.11.013openalex-snapshot
Topology and combinatorics of partitions of masses by hyperplanes
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.cad.2011.09.010openalex-snapshot
Querying simplexes in quasi-triangulation
inferred← citeshttps://doi.org/10.1016/j.comgeo.2005.03.002openalex-snapshot
Extremal point queries with lines and line segments and related problems
inferred← citeshttps://doi.org/10.1016/j.comgeo.2005.07.002openalex-snapshot
Farthest-point queries with geometric and combinatorial constraints
inferred← citeshttps://doi.org/10.1016/j.comgeo.2008.05.002openalex-snapshot
Efficient c-oriented range searching with DOP-trees
inferred← citeshttps://doi.org/10.1016/j.comgeo.2008.09.008openalex-snapshot
Dynamic ham-sandwich cuts in the plane
inferred← citeshttps://doi.org/10.1016/j.comgeo.2009.01.007openalex-snapshot
A (slightly) faster algorithm for Klee's measure problem
inferred← citeshttps://doi.org/10.1016/j.comgeo.2009.02.006openalex-snapshot
Computing minimum-area rectilinear convex hull and L-shape
inferred← citeshttps://doi.org/10.1016/j.comgeo.2009.07.001openalex-snapshot
Finding the Θ-guarded region
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.2020.101669openalex-snapshot
Range closest-pair search in higher dimensions
inferred← citeshttps://doi.org/10.1016/j.comgeo.2025.102196openalex-snapshot
Algorithms for computing closest points for segments
inferred← citeshttps://doi.org/10.1016/j.comgeo.2025.102218openalex-snapshot
Big line or big convex polygon
inferred← citeshttps://doi.org/10.1016/j.csda.2006.08.033openalex-snapshot
A practical approximation algorithm for the LMS line estimator
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.04.021openalex-snapshot
Geometric pattern matching for point sets in the plane under similarity transformations
inferred← citeshttps://doi.org/10.1016/j.jctb.2015.10.001openalex-snapshot
Semi-algebraic Ramsey numbers
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.09.027openalex-snapshot
A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs
inferred← citeshttps://doi.org/10.1016/s0010-4485(01)00119-1openalex-snapshot
Separating an object from its cast
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00187-2openalex-snapshot
Efficient algorithms for counting and reporting pairwise intersections between convex polygons
inferred← citeshttps://doi.org/10.1016/s0031-3203(00)00120-5openalex-snapshot
Efficient image retrieval through vantage objects
inferred← citeshttps://doi.org/10.1016/s0167-8655(03)00018-7openalex-snapshot
Using simplicial partitions to determine a closest point to a query line
inferred← citeshttps://doi.org/10.1016/s0196-6774(03)00090-7openalex-snapshot
Computing homotopic shortest paths in the plane
inferred← citeshttps://doi.org/10.1016/s0925-7721(01)00009-8openalex-snapshot
Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses☆☆A preliminary version of this report was presented at the Fifth Canadian Conference on Computational Geometry [32].
inferred← citeshttps://doi.org/10.1016/s0925-7721(96)00027-2openalex-snapshot
3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
inferred← citeshttps://doi.org/10.1090/s0002-9947-07-04294-8openalex-snapshot
Equipartitions of measures in ℝ⁴
inferred← citeshttps://doi.org/10.1109/5.163409openalex-snapshot
Dynamic algorithms in computational geometry
inferred← citeshttps://doi.org/10.1109/bigdata59044.2023.10386943openalex-snapshot
Fast Heavy Inner Product Identification Between Weights and Inputs in Neural Network Training
inferred← citeshttps://doi.org/10.1109/focs.2009.34openalex-snapshot
Instance-Optimal Geometric Algorithms
inferred← citeshttps://doi.org/10.1109/focs.2011.14openalex-snapshot
On Range Searching in the Group Model and Combinatorial Discrepancy
inferred← citeshttps://doi.org/10.1109/focs.2012.31openalex-snapshot
Down the Rabbit Hole: Robust Proximity Search and Density Estimation in Sublinear Space
inferred← citeshttps://doi.org/10.1109/focs.2012.32openalex-snapshot
On Range Searching with Semialgebraic Sets II
inferred← citeshttps://doi.org/10.1109/focs.2013.82openalex-snapshot
Approximating Minimization Diagrams and Generalized Proximity Search
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/infocom41043.2020.9155480openalex-snapshot
Differentially Private Range Counting in Planar Graphs for Spatial Sensing
inferred← citeshttps://doi.org/10.1109/istcs.1995.377043openalex-snapshot
Improved algorithms in geometric optimization via expanders
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/time.2003.1214887openalex-snapshot
Efficient aggregation over moving objects
inferred← citeshttps://doi.org/10.1137/05062826xopenalex-snapshot
Dense Arrangements are Locally Very Dense. I
inferred← citeshttps://doi.org/10.1137/06066031xopenalex-snapshot
Axis-Aligned Subdivisions with Low Stabbing Numbers
inferred← citeshttps://doi.org/10.1137/070684483openalex-snapshot
Efficient Colored Orthogonal Range Counting
inferred← citeshttps://doi.org/10.1137/08071990xopenalex-snapshot
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
inferred← citeshttps://doi.org/10.1137/080736600openalex-snapshot
Approximate Halfspace Range Counting
inferred← citeshttps://doi.org/10.1137/090751670openalex-snapshot
Dynamic Connectivity: Connecting to Networks and Geometry
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.9781611975031.59openalex-snapshot
On Separating Points by Lines
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch49openalex-snapshot
Halving by a Thousand Cuts or Punctures
inferred← citeshttps://doi.org/10.1137/120865240openalex-snapshot
On Range Searching in the Group Model and Combinatorial Discrepancy
inferred← citeshttps://doi.org/10.1137/120890855openalex-snapshot
On Range Searching with Semialgebraic Sets. II
inferred← citeshttps://doi.org/10.1137/130916448openalex-snapshot
Down the Rabbit Hole: Robust Proximity Search and Density Estimation in Sublinear Space
inferred← citeshttps://doi.org/10.1137/140959067openalex-snapshot
Approximating Minimization Diagrams and Generalized Proximity Search
inferred← citeshttps://doi.org/10.1137/19m128733xopenalex-snapshot
Resolving SINR Queries in a Dynamic Setting
inferred← citeshttps://doi.org/10.1137/21m145118xopenalex-snapshot
Algorithms for Subpath Convex Hull Queries and Ray-Shooting among Segments
inferred← citeshttps://doi.org/10.1137/23m1596582openalex-snapshot
Dynamic Geometric Set Cover, Revisited
inferred← citeshttps://doi.org/10.1137/24m1640732openalex-snapshot
Covering Points by Hyperplanes and Related Problems
inferred← citeshttps://doi.org/10.1137/s0097539702404389openalex-snapshot
Semi-Online Maintenance of Geometric Optima and Measures
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/s0097539794268649openalex-snapshot
An Expander-Based Approach to Geometric Optimization
inferred← citeshttps://doi.org/10.1137/s0097539796260321openalex-snapshot
Product Range Spaces, Sensitive Sampling, and Derandomization
inferred← citeshttps://doi.org/10.1137/s0097539798337212openalex-snapshot
Space-Time Tradeoffs for Emptiness Queries
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/s0218195900000322openalex-snapshot
OBNOXIOUS FACILITY LOCATION: COMPLETE SERVICE WITH MINIMAL HARM
inferred← citeshttps://doi.org/10.1142/s0218195900000334openalex-snapshot
QUANTILE APPROXIMATION FOR ROBUST STATISTICAL ESTIMATION AND k-ENCLOSING PROBLEMS
inferred← citeshttps://doi.org/10.1142/s0218195901000511openalex-snapshot
ON ENUMERATING AND SELECTING DISTANCES
inferred← citeshttps://doi.org/10.1142/s0218195906001951openalex-snapshot
POLYLINE FITTING OF PLANAR POINTS UNDER MIN-SUM CRITERIA
inferred← citeshttps://doi.org/10.1142/s0218195912500069openalex-snapshot
FITTING A STEP FUNCTION TO A POINT SET WITH OUTLIERS BASED ON SIMPLICIAL THICKNESS DATA STRUCTURES
inferred← citeshttps://doi.org/10.1142/s0218195912600096openalex-snapshot
THREE PROBLEMS ABOUT DYNAMIC CONVEX HULLS
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/s0218195919500018openalex-snapshot
Partial Enclosure Range Searching
inferred← citeshttps://doi.org/10.1145/1137856.1137920openalex-snapshot
Tight bounds for connecting sites across barriers
inferred← citeshttps://doi.org/10.1145/1377676.1377693openalex-snapshot
A (slightly) faster algorithm for klee's measure problem
inferred← citeshttps://doi.org/10.1145/160985.161137openalex-snapshot
An expander-based approach to geometric optimization
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/2462356.2462396openalex-snapshot
A faster algorithm for computing motorcycle graphs
inferred← citeshttps://doi.org/10.1145/2582112.2582152openalex-snapshot
Near-Linear Algorithms for Geometric Hitting Sets and Set Covers
inferred← citeshttps://doi.org/10.1145/2746539.2746559openalex-snapshot
Approximate k -flat Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1145/275487.275506openalex-snapshot
Efficient searching with linear constraints
inferred← citeshttps://doi.org/10.1145/299917.299918openalex-snapshot
Efficient algorithms for geometric optimization
inferred← citeshttps://doi.org/10.1145/3046673openalex-snapshot
Instance-Optimal Geometric Algorithms
inferred← citeshttps://doi.org/10.1145/304893.304993openalex-snapshot
On range reporting, ray shooting and k -level construction
inferred← citeshttps://doi.org/10.1145/3106700.3106711openalex-snapshot
Computational Geometry Column 65
inferred← citeshttps://doi.org/10.1145/336154.336198openalex-snapshot
Linear programming queries revisited
inferred← citeshttps://doi.org/10.1145/336154.336215openalex-snapshot
Deterministic algorithms for 3-D diameter and some 2-D lower envelopes
inferred← citeshttps://doi.org/10.1145/3363541openalex-snapshot
More Logarithmic-factor Speedups for 3SUM, (median,+)-convolution, and Some Geometric 3SUM-hard Problems
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/3584372.3588663openalex-snapshot
Indexing for Keyword Search with Structured Constraints
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.378675openalex-snapshot
Notes on computing peaks in k-levels and parametric spanning trees
inferred← citeshttps://doi.org/10.1145/513400.513421openalex-snapshot
Testing Homotopy for paths in the plane
inferred← citeshttps://doi.org/10.1145/777792.777813openalex-snapshot
New constructions of weak epsilon-nets
inferred← citeshttps://doi.org/10.1145/997817.997830openalex-snapshot
Algorithms for center and Tverberg points
inferred← citeshttps://doi.org/10.1145/997817.997844openalex-snapshot
Range counting over multidimensional data streams
inferred← citeshttps://doi.org/10.1145/997817.997854openalex-snapshot
Towards in-place geometric algorithms and data structures
showing the first 200 of 206 · page through all 206
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.