On the public citation graph
Selecting distances in the plane
0 signed · 83 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-19488-6_118openalex-snapshot
Arrangements of curves in the plane — topology, combinatorics, and algorithms
inferredcites →https://doi.org/10.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/bf00263295openalex-snapshot
Some techniques for geometric searching with implicit set representations
inferredcites →https://doi.org/10.1007/bf01182774openalex-snapshot
Planar geometric location problems
inferredcites →https://doi.org/10.1007/bf02187740openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1007/bf02579170openalex-snapshot
Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes
inferredcites →https://doi.org/10.1007/bfb0105127openalex-snapshot
Finding the maximum, merging and sorting in a parallel computation model
inferredcites →https://doi.org/10.1016/0196-6774(81)90010-9openalex-snapshot
Finding the maximum, merging, and sorting in a parallel computation model
inferredcites →https://doi.org/10.1016/0196-6774(85)90011-2openalex-snapshot
Partitioning with two lines in the plane
inferredcites →https://doi.org/10.1016/s0019-9958(86)80023-7openalex-snapshot
Deterministic coin tossing with applications to optimal parallel list ranking
inferredcites →https://doi.org/10.1016/s0022-0000(73)80033-9openalex-snapshot
Time bounds for selection
inferredcites →https://doi.org/10.1109/tc.1979.1675432openalex-snapshot
Algorithms for Reporting and Counting Geometric Intersections
inferredcites →https://doi.org/10.1137/0211059openalex-snapshot
On Constructing Minimum Spanning Trees in k -Dimensional Spaces and Related Problems
inferredcites →https://doi.org/10.1137/0214061openalex-snapshot
An Efficient Parallel Biconnectivity Algorithm
inferredcites →https://doi.org/10.1137/0215023openalex-snapshot
Optimal Point Location in a Monotone Subdivision
inferredcites →https://doi.org/10.1137/0220045openalex-snapshot
Parallel Transitive Closure and Point Location in Planar Structures
inferredcites →https://doi.org/10.1145/103418.103470openalex-snapshot
Approximations and optimal geometric divide-and-conquer
inferredcites →https://doi.org/10.1145/2157.322410openalex-snapshot
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
inferredcites →https://doi.org/10.1145/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1145/7531.7537openalex-snapshot
Slowing down sorting networks to obtain faster sorting algorithms
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.1006/jagm.1996.0028openalex-snapshot
Selection in Monotone Matrices and Computingkth Nearest Neighbors
inferred← citeshttps://doi.org/10.1007/11775096_16openalex-snapshot
Polygonal Curve Approximation Using Grid Points with Application to a Triangular Mesh Generation with Small Number of Different Edge Lengths
inferred← citeshttps://doi.org/10.1007/3-540-44849-7_11openalex-snapshot
An Improved Algorithm for Point Set Pattern Matching under Rigid Motion
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_89openalex-snapshot
Dynamic Algorithms for Approximating Interdistances
inferred← citeshttps://doi.org/10.1007/3-540-45253-2_11openalex-snapshot
Exact Point Pattern Matching and the Number of Congruent Triangles in a Three-Dimensional Pointset
inferred← citeshttps://doi.org/10.1007/3-540-45749-6_8openalex-snapshot
Translating a Planar Object to Maximize Point Containment
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-58218-5_2openalex-snapshot
Selection in monotone matrices and computing k th nearest neighbors
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-4615-0013-1_6openalex-snapshot
Randomized Algorithms for Geometric Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-12200-2_40openalex-snapshot
Matching Points with Things
inferred← citeshttps://doi.org/10.1007/bf01182774openalex-snapshot
Planar geometric location problems
inferred← citeshttps://doi.org/10.1007/bf02573973openalex-snapshot
Diameter, width, closest line pair, and parametric searching
inferred← citeshttps://doi.org/10.1007/bfb0015247openalex-snapshot
Algorithmic techniques for geometric optimization
inferred← citeshttps://doi.org/10.1007/pl00009388openalex-snapshot
Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets
inferred← citeshttps://doi.org/10.1007/s00453-001-0016-8openalex-snapshot
Geometry Helps in Bottleneck Matching and Related Problems
inferred← citeshttps://doi.org/10.1007/s00453-001-0114-7openalex-snapshot
Fast Algorithms for Approximating Distances
inferred← citeshttps://doi.org/10.1007/s00453-003-1043-4openalex-snapshot
Combinatorial and Experimental Methods for Approximate Point Pattern Matching
inferred← citeshttps://doi.org/10.1007/s00453-025-01305-zopenalex-snapshot
Improved Algorithms for Distance Selection and Related Problems
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00009-7openalex-snapshot
Algorithms for proximity problems in higher dimensions
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/b978-044482537-7/50021-8openalex-snapshot
Closest-Point Problems in Computational Geometry
inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.04.005openalex-snapshot
Non-crossing matchings of points with geometric objects
inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.11.005openalex-snapshot
The 2-center problem in three dimensions
inferred← citeshttps://doi.org/10.1016/j.comgeo.2014.12.003openalex-snapshot
Shortest paths in intersection graphs of unit disks
inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101966openalex-snapshot
Intersecting disks using two congruent disks
inferred← citeshttps://doi.org/10.1016/j.comgeo.2023.101986openalex-snapshot
Bottleneck matching in the plane
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.disopt.2004.12.004openalex-snapshot
One-way and round-trip center location problems
inferred← citeshttps://doi.org/10.1016/j.jda.2003.12.001openalex-snapshot
Selecting distances in arrangements of hyperplanes spanned by points
inferred← citeshttps://doi.org/10.1016/j.patcog.2006.01.003openalex-snapshot
Simple algorithms for partial point set pattern matching under rigid motion
inferred← citeshttps://doi.org/10.1016/j.patcog.2009.05.014openalex-snapshot
Approximate input sensitive algorithms for point pattern matching
inferred← citeshttps://doi.org/10.1093/bioinformatics/btl316openalex-snapshot
Optimization of probe coverage for high-resolution oligonucleotide aCGH
inferred← citeshttps://doi.org/10.1109/34.761267openalex-snapshot
Approximate geometric pattern matching under rigid motions
inferred← citeshttps://doi.org/10.1109/istcs.1995.377043openalex-snapshot
Improved algorithms in geometric optimization via expanders
inferred← citeshttps://doi.org/10.1137/1.9781611973105.12openalex-snapshot
Computing the Discrete Fréchet Distance in Subquadratic Time
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/130920526openalex-snapshot
Computing the Discrete Fréchet Distance in Subquadratic Time
inferred← citeshttps://doi.org/10.1137/s0097539703433900openalex-snapshot
Pseudo-Line Arrangements: Duality, Algorithms, and Applications
inferred← citeshttps://doi.org/10.1137/s0097539794268649openalex-snapshot
An Expander-Based Approach to Geometric Optimization
inferred← citeshttps://doi.org/10.1142/s0218195901000511openalex-snapshot
ON ENUMERATING AND SELECTING DISTANCES
inferred← citeshttps://doi.org/10.1145/237218.237399openalex-snapshot
Improvements on bottleneck matching and related problems using geometry
inferred← citeshttps://doi.org/10.1145/262839.262989openalex-snapshot
Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets
inferred← citeshttps://doi.org/10.1145/276884.276916openalex-snapshot
On enumerating and selecting distances
inferred← citeshttps://doi.org/10.1145/299917.299918openalex-snapshot
Efficient algorithms for geometric optimization
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.17169/refubium-8271openalex-snapshot
Stabbing and Covering Geometric Objects in the Plane
inferred← citeshttps://doi.org/10.22028/d291-23759openalex-snapshot
Geometric algorithms for object placement and planarity in a terrain
inferred← citeshttps://doi.org/10.5555/2627817.2627829openalex-snapshot
Computing the discrete Fréchet distance in subquadratic time
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.