On the public citation graph
Range searching with efficient hierarchical cuttings
0 signed · 220 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/bf01758854openalex-snapshot
Quasi-optimal upper bounds for simplex range searching and new zone theorems
inferredcites →https://doi.org/10.1007/bf01931656openalex-snapshot
Storing line segments in partition trees
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/bf02187742openalex-snapshot
Implicitly representing arrangements of lines or segments
inferredcites →https://doi.org/10.1007/bf02187743openalex-snapshot
Quasi-optimal range searching in spaces of finite VC-dimension
inferredcites →https://doi.org/10.1007/bf02187805openalex-snapshot
Partitioning arrangements of lines I: An efficient deterministic algorithm
inferredcites →https://doi.org/10.1007/bf02189314openalex-snapshot
Cutting hyperplanes for divide-and-conquer
inferredcites →https://doi.org/10.1007/bfb0028277openalex-snapshot
Applications of a new space partitioning technique
inferredcites →https://doi.org/10.1016/0020-0190(90)90084-bopenalex-snapshot
An optimal algorithm with unknown time complexity for convex matrix searching
inferredcites →https://doi.org/10.1016/0196-6774(87)90015-0openalex-snapshot
Space searching for intersecting objects
inferredcites →https://doi.org/10.1051/ita/1991250201031openalex-snapshot
Spanning trees with low crossing number
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.1145/103418.103470openalex-snapshot
Approximations and optimal geometric divide-and-conquer
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.1007/0-387-25592-3_2openalex-snapshot
Problems and Results on Geometric Patterns
inferred← citeshttps://doi.org/10.1007/11611257_14openalex-snapshot
Constructing Interference-Minimal Networks
inferred← citeshttps://doi.org/10.1007/11682462_44openalex-snapshot
Lower Bounds for Geometric Diameter Problems
inferred← citeshttps://doi.org/10.1007/3-540-44634-6_12openalex-snapshot
Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions
inferred← citeshttps://doi.org/10.1007/3-540-45749-6_38openalex-snapshot
Computing Homotopic Shortest Paths Efficiently
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-57155-8_234openalex-snapshot
Connected component and simple polygon intersection searching
inferred← citeshttps://doi.org/10.1007/3-540-61680-2_64openalex-snapshot
Reporting red-blue intersections between two sets of connected line segments
inferred← citeshttps://doi.org/10.1007/3-540-63307-3_54openalex-snapshot
On some geometric optimization problems in layered manufacturing
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-87363-3_2openalex-snapshot
Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_509openalex-snapshot
Geometric Shortest Paths in the Plane
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-67899-9_12openalex-snapshot
New Variants of Perfect Non-crossing Matchings
inferred← citeshttps://doi.org/10.1007/978-3-031-55598-5_20openalex-snapshot
Minimum-Width Double-Slabs and Widest Empty Slabs in High Dimensions
inferred← citeshttps://doi.org/10.1007/978-3-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-24587-2_28openalex-snapshot
On Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts
inferred← citeshttps://doi.org/10.1007/978-3-540-24698-5_37openalex-snapshot
Encoding Homotopy of Paths in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-540-27810-8_11openalex-snapshot
Matching Polyhedral Terrains Using Overlays of Envelopes
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-73951-7_2openalex-snapshot
Approximate Range Searching: The Absolute Model
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-15775-2_32openalex-snapshot
A Unified Approach to Approximate Proximity Searching
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-27848-8_509-1openalex-snapshot
Geometric Shortest Paths in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-642-31155-0_26openalex-snapshot
Linear-Space Data Structures for Range Minority Query in Arrays
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-61012-7_12openalex-snapshot
Suchen und Konstruieren durch Verdoppeln
inferred← citeshttps://doi.org/10.1007/bf01940884openalex-snapshot
Connected component and simple polygon intersection searching
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/bf02574015openalex-snapshot
On range searching with semialgebraic sets
inferred← citeshttps://doi.org/10.1007/bf02712875openalex-snapshot
New lower bounds for Hopcroft's problem
inferred← citeshttps://doi.org/10.1007/bf02716578openalex-snapshot
Vertical decompositions for triangles in 3-space
inferred← citeshttps://doi.org/10.1007/bf02717729openalex-snapshot
Equipartition of mass distributions by hyperplanes
inferred← citeshttps://doi.org/10.1007/bfb0035458openalex-snapshot
Deterministic sampling and optimization
inferred← citeshttps://doi.org/10.1007/bfb0049410openalex-snapshot
A unified scheme for detecting fundamental curves in binary edge images
inferred← citeshttps://doi.org/10.1007/bfb0049412openalex-snapshot
Range searching and point location among fat objects
inferred← citeshttps://doi.org/10.1007/bfb0049415openalex-snapshot
Fast algorithms for collision and proximity problems involving moving geometric objects
inferred← citeshttps://doi.org/10.1007/pl00014422openalex-snapshot
Determining the Castability of Simple Polyhedra
inferred← citeshttps://doi.org/10.1007/s00224-013-9455-2openalex-snapshot
Linear-Space Data Structures for Range Mode Query in Arrays
inferred← citeshttps://doi.org/10.1007/s00453-002-0967-4openalex-snapshot
Reporting Red--Blue Intersections between Two Sets of Connected Line Segments
inferred← citeshttps://doi.org/10.1007/s00453-004-1107-0openalex-snapshot
Matching Polyhedral Terrains Using Overlays of Envelopes
inferred← citeshttps://doi.org/10.1007/s00453-005-1202-xopenalex-snapshot
Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts
inferred← citeshttps://doi.org/10.1007/s00453-007-9010-0openalex-snapshot
A Tight Lower Bound for Computing the Diameter of a 3D Convex Polytope
inferred← citeshttps://doi.org/10.1007/s00453-008-9270-3openalex-snapshot
Guarding a Terrain by Two Watchtowers
inferred← citeshttps://doi.org/10.1007/s00453-017-0307-3openalex-snapshot
Semi-Group Range Sum Revisited: Query-Space Lower Bound Tightened
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-0043-xopenalex-snapshot
On the Complexity of Arrangements of Circles in the Plane
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-002-2884-3openalex-snapshot
Combinatorial Geometry Problems in Pattern Recognition
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-003-2946-1openalex-snapshot
The Power of Nonmonotonicity in Geometric Searching
inferred← citeshttps://doi.org/10.1007/s00454-004-1089-3openalex-snapshot
Dense Point Sets Have Sparse Delaunay Triangulations or ?... But Not Too Nasty?
inferred← citeshttps://doi.org/10.1007/s00454-006-1269-4openalex-snapshot
Range Counting over Multidimensional Data Streams
inferred← citeshttps://doi.org/10.1007/s00454-007-9019-9openalex-snapshot
Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D
inferred← citeshttps://doi.org/10.1007/s00454-009-9140-zopenalex-snapshot
The Effect of Corners on the Complexity of Approximate Range Searching
inferred← citeshttps://doi.org/10.1007/s00454-009-9177-zopenalex-snapshot
On Approximate Range Counting and Depth
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-9412-xopenalex-snapshot
Tight Lower Bounds for Halfspace Range Searching
inferred← citeshttps://doi.org/10.1007/s00454-018-0040-yopenalex-snapshot
Subquadratic Algorithms for Algebraic 3SUM
inferred← citeshttps://doi.org/10.1007/s00454-019-00102-0openalex-snapshot
Removing Depth-Order Cycles Among Triangles: An Algorithm Generating Triangular Fragments
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-023-00574-1openalex-snapshot
On Semialgebraic Range Reporting
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/s00454-024-00673-7openalex-snapshot
Improved Algebraic Degeneracy Testing
inferred← citeshttps://doi.org/10.1007/s00454-024-00709-yopenalex-snapshot
Algorithms for Halfplane Coverage and Related Problems
inferred← citeshttps://doi.org/10.1007/s00454-025-00792-9openalex-snapshot
Semi-Algebraic Off-line Range Searching and Biclique Partitions in the Plane
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)00005-8openalex-snapshot
Computing depth orders for fat objects and related 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)00020-8openalex-snapshot
The exact fitting problem in higher dimensions
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/j.aim.2005.11.013openalex-snapshot
Topology and combinatorics of partitions of masses by hyperplanes
inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.02.001openalex-snapshot
Triangular range counting query in 2D and its application in finding k nearest neighbors of a line segment
inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.10.001openalex-snapshot
Ray shooting and stone throwing with near-linear storage
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.2006.03.003openalex-snapshot
Computing homotopic shortest paths efficiently
inferred← citeshttps://doi.org/10.1016/j.comgeo.2007.06.004openalex-snapshot
Constructing minimum-interference networks
inferred← citeshttps://doi.org/10.1016/j.comgeo.2008.09.009openalex-snapshot
Approximate range searching: The absolute model
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.2010.04.003openalex-snapshot
A general approach for cache-oblivious range reporting and approximate range counting
inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.06.002openalex-snapshot
Covering a bichromatic point set with two disjoint monochromatic disks
inferred← citeshttps://doi.org/10.1016/j.comgeo.2016.04.001openalex-snapshot
Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points
inferred← citeshttps://doi.org/10.1016/j.comgeo.2020.101655openalex-snapshot
Trajectory planning for an articulated probe
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.2021.101756openalex-snapshot
Characterization and computation of feasible trajectories for an articulated probe with a variable-length end segment
inferred← citeshttps://doi.org/10.1016/j.comgeo.2023.102053openalex-snapshot
On reverse shortest paths in geometric proximity graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2025.102173openalex-snapshot
Minimum-width double-slabs and widest empty slabs in high dimensions
inferred← citeshttps://doi.org/10.1016/j.comgeo.2025.102196openalex-snapshot
Algorithms for computing closest points for segments
inferred← citeshttps://doi.org/10.1016/j.dam.2023.09.016openalex-snapshot
New variants of perfect non-crossing matchings
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.09.001openalex-snapshot
Enclosing weighted points with an almost-unit ball
inferred← citeshttps://doi.org/10.1016/j.is.2022.102086openalex-snapshot
Box queries over multi-dimensional streams
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115583openalex-snapshot
On k -enclosing slab problems
inferred← citeshttps://doi.org/10.1016/s0031-3203(00)00120-5openalex-snapshot
Efficient image retrieval through vantage objects
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/s0304-3975(02)00322-5openalex-snapshot
An efficient k nearest neighbors searching algorithm for a query line
inferred← citeshttps://doi.org/10.1016/s0925-7721(00)00022-5openalex-snapshot
Approximate range searching☆☆A preliminary version of this paper appeared in the Proc. of the 11th Annual ACM Symp. on Computational Geometry, 1995, pp. 172–181.
inferred← citeshttps://doi.org/10.1016/s0925-7721(02)00049-4openalex-snapshot
Reporting intersecting pairs of convex polytopes in two and three dimensions
inferred← citeshttps://doi.org/10.1016/s0925-7721(02)00127-xopenalex-snapshot
On counting point-hyperplane incidences
inferred← citeshttps://doi.org/10.1016/s0925-7721(96)00016-8openalex-snapshot
On fat partitioning, fat covering and the union size of polygons
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.1023/a:1009857410665openalex-snapshot
Fast Range Searching with Delaunay Triangulations
inferred← citeshttps://doi.org/10.1090/s0002-9947-07-04294-8openalex-snapshot
Equipartitions of measures in ℝ⁴
inferred← citeshttps://doi.org/10.1109/coase.2007.4341778openalex-snapshot
Computing All Independent Form-Closure Grasp Regions of a Rectilinear Polyhedron
inferred← citeshttps://doi.org/10.1109/focs.2008.29openalex-snapshot
Dynamic Connectivity: Connecting to Networks and Geometry
inferred← citeshttps://doi.org/10.1109/focs.2012.32openalex-snapshot
On Range Searching with Semialgebraic Sets II
inferred← citeshttps://doi.org/10.1109/focs.2017.33openalex-snapshot
Removing Depth-Order Cycles among Triangles: An Efficient Algorithm Generating Triangular Fragments
inferred← citeshttps://doi.org/10.1109/iros.2007.4399113openalex-snapshot
Computing all form-closure grasps of a rectilinear polyhedron with seven frictionless point fingers
inferred← citeshttps://doi.org/10.1109/istcs.1995.377043openalex-snapshot
Improved algorithms in geometric optimization via expanders
inferred← citeshttps://doi.org/10.1109/pccga.1999.803349openalex-snapshot
Output sensitive extraction of silhouettes from polygonal geometry
inferred← citeshttps://doi.org/10.1109/robot.2005.1570211openalex-snapshot
Output-Sensitive Computation of All Form-Closure Grasps of a Semi-Algebraic Set
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365725openalex-snapshot
A spectral approach to lower bounds
inferred← citeshttps://doi.org/10.1109/sfcs.1996.548506openalex-snapshot
New lower bounds for halfspace emptiness
inferred← citeshttps://doi.org/10.1137/060669474openalex-snapshot
On Approximating the Depth and Related Problems
inferred← citeshttps://doi.org/10.1137/070684483openalex-snapshot
Efficient Colored Orthogonal Range Counting
inferred← citeshttps://doi.org/10.1137/090751670openalex-snapshot
Dynamic Connectivity: Connecting to Networks and Geometry
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/120890855openalex-snapshot
On Range Searching with Semialgebraic Sets. II
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/21m145118xopenalex-snapshot
Algorithms for Subpath Convex Hull Queries and Ray-Shooting among Segments
inferred← citeshttps://doi.org/10.1137/s0097539702404389openalex-snapshot
Semi-Online Maintenance of Geometric Optima and Measures
inferred← citeshttps://doi.org/10.1137/s0097539703433900openalex-snapshot
Pseudo-Line Arrangements: Duality, Algorithms, and Applications
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/s0097539793252080openalex-snapshot
Ray Shooting Amidst Spheres in Three Dimensions and Related Problems
inferred← citeshttps://doi.org/10.1137/s0097539794268649openalex-snapshot
An Expander-Based Approach to Geometric Optimization
inferred← citeshttps://doi.org/10.1137/s0097539794275665openalex-snapshot
A Spectral Approach to Lower Bounds with Applications to Geometric Searching
inferred← citeshttps://doi.org/10.1137/s0097539798337212openalex-snapshot
Space-Time Tradeoffs for Emptiness Queries
inferred← citeshttps://doi.org/10.1142/s0218195903001268openalex-snapshot
COMPUTING CLOSEST POINTS FOR SEGMENTS
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/s0218195913600054openalex-snapshot
IMPROVED POINTER MACHINE AND I/O LOWER BOUNDS FOR SIMPLEX RANGE REPORTING AND RELATED PROBLEMS
inferred← citeshttps://doi.org/10.1145/1064092.1064145openalex-snapshot
Guarding a terrain by two watchtowers
inferred← citeshttps://doi.org/10.1145/1064092.1064149openalex-snapshot
Reconstructing collections of arbitrary curves
inferred← citeshttps://doi.org/10.1145/1132516.1132598openalex-snapshot
On the importance of idempotence
inferred← citeshttps://doi.org/10.1145/1137856.1137866openalex-snapshot
Colored intersection searching via sparse rectangular matrix multiplication
inferred← citeshttps://doi.org/10.1145/1247069.1247129openalex-snapshot
On approximate range counting and depth
inferred← citeshttps://doi.org/10.1145/1377676.1377693openalex-snapshot
A (slightly) faster algorithm for klee's measure problem
inferred← citeshttps://doi.org/10.1145/1542362.1542413openalex-snapshot
A general approach for cache-oblivious range reporting and approximate range counting
inferred← citeshttps://doi.org/10.1145/177424.177427openalex-snapshot
Vertical decompositions for triangles in 3-space
inferred← citeshttps://doi.org/10.1145/1810959.1810964openalex-snapshot
Tight lower bounds for halfspace range searching
inferred← citeshttps://doi.org/10.1145/220279.220293openalex-snapshot
New lower bounds for Hopcroft's problem
inferred← citeshttps://doi.org/10.1145/2213556.2213588openalex-snapshot
Nearest-neighbor searching under uncertainty
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/237218.237246openalex-snapshot
Splitting a complex of convex polytopes in any dimension
inferred← citeshttps://doi.org/10.1145/237218.237397openalex-snapshot
Fixed-dimensional linear programming queries made easy
inferred← citeshttps://doi.org/10.1145/2463664.2465219openalex-snapshot
Nearest neighbor searching under uncertainty II
inferred← citeshttps://doi.org/10.1145/262839.262988openalex-snapshot
Space-time tradeoffs for emptiness queries (extended abstract)
inferred← citeshttps://doi.org/10.1145/276884.276891openalex-snapshot
Raising roofs, crashing cycles, and playing pool
inferred← citeshttps://doi.org/10.1145/3083897openalex-snapshot
On the Hardness and Approximation of Euclidean DBSCAN
inferred← citeshttps://doi.org/10.1145/3414845openalex-snapshot
Fine-grained Complexity Analysis of Two Classic TSP Variants
inferred← citeshttps://doi.org/10.1145/3465480.3466925openalex-snapshot
Box queries over multi-dimensional streams
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/3721290openalex-snapshot
Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems
inferred← citeshttps://doi.org/10.1145/378583.378587openalex-snapshot
On the number of congruent simplices in a point
inferred← citeshttps://doi.org/10.1145/378583.378618openalex-snapshot
Efficient perspective-accurate silhouette computation and applications
inferred← citeshttps://doi.org/10.1145/3787461openalex-snapshot
Quantum Algorithms for Hopcroft's problem
inferred← citeshttps://doi.org/10.1145/513400.513411openalex-snapshot
The power of nonmonotonicity in geometric searching
inferred← citeshttps://doi.org/10.1145/997817.997844openalex-snapshot
Range counting over multidimensional data streams
inferred← citeshttps://doi.org/10.1155/2017/4323590openalex-snapshot
A Greedy Clustering Algorithm Based on Interval Pattern Concepts and the Problem of Optimal Box Positioning
inferred← citeshttps://doi.org/10.1201/9781315119335-67openalex-snapshot
Computational Geometry: Generalized (or Colored) Intersection Searching
inferred← citeshttps://doi.org/10.1201/9781420035315.ch44openalex-snapshot
The discrepancy method in computational geometry
inferred← citeshttps://doi.org/10.17169/refubium-10104openalex-snapshot
Simple reconstruction of non-simple curves and approximating the median in streams with constant storage
inferred← citeshttps://doi.org/10.17169/refubium-22903openalex-snapshot
Simple reconstruction of non-simple curves
inferred← citeshttps://doi.org/10.25781/kaust-yn9r1openalex-snapshot
Algorithms for Computing Motorcycle Graphs
inferred← citeshttps://doi.org/10.4230/lipics.esa.2025.75openalex-snapshot
An Improved Bound for Plane Covering Paths
inferred← citeshttps://doi.org/10.4230/lipics.socg.2021.25openalex-snapshot
More Dynamic Data Structures for Geometric Set Cover with Sublinear Update Time
inferred← citeshttps://doi.org/10.4230/lipics.socg.2021.8openalex-snapshot
Lower Bounds for Semialgebraic Range Searching and Stabbing Problems
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0110030openalex-snapshot
Dense point sets have sparse Delaunay triangulations
inferred← citeshttps://doi.org/10.48550/arxiv.cs/9910017openalex-snapshot
Finite-resolution hidden surface removal
inferred← citeshttps://doi.org/10.52843/cassyni.nglyd8openalex-snapshot
Recent Developments on Intersection Searching
inferred← citeshttps://doi.org/10.5555/1070432.1070556openalex-snapshot
On approximating the depth and related problems
inferred← citeshttps://doi.org/10.5555/1109557.1109611openalex-snapshot
Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting
inferred← citeshttps://doi.org/10.5555/545381.545397openalex-snapshot
Dense point sets have sparse Delaunay triangulations: or "…but not too nasty"
inferred← citeshttps://doi.org/10.5555/545381.545445openalex-snapshot
Semi-online maintenance of geometric optima and measures
inferred← citeshttps://doi.org/10.5555/644108.644209openalex-snapshot
Computing homotopic shortest paths in the plane
inferred← citeshttps://doi.org/10.5555/644108.644242openalex-snapshot
Sublinear-time approximation of Euclidean minimum spanning tree
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.