On the public citation graph
Diameter, width, closest line pair, and parametric searching
0 signed · 108 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.1006/jagm.1993.1043openalex-snapshot
Computing a Segment Center for a Planar Point Set
inferredcites →https://doi.org/10.1006/jagm.1996.0060openalex-snapshot
On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
inferredcites →https://doi.org/10.1007/bf01182771openalex-snapshot
Algorithms for bichromatic line-segment problems and polyhedral terrains
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/bf02189317openalex-snapshot
On the zone of a surface in a hyperplane arrangement
inferredcites →https://doi.org/10.1007/bf02574698openalex-snapshot
Euclidean minimum spanning trees and bichromatic closest pairs
inferredcites →https://doi.org/10.1016/0020-0190(91)90177-jopenalex-snapshot
Randomized optimal algorithm for slope selection
inferredcites →https://doi.org/10.1016/0304-3975(91)90261-yopenalex-snapshot
A singly exponential stratification scheme for real semi-algebraic varieties and its applications
inferredcites →https://doi.org/10.1090/dimacs/006/14openalex-snapshot
Computing the center of planar point sets
inferredcites →https://doi.org/10.1109/sfcs.1991.185345openalex-snapshot
An optimal convex hull algorithm and new results on cuttings
inferredcites →https://doi.org/10.1137/0212002openalex-snapshot
Optimal Search in Planar Subdivisions
inferredcites →https://doi.org/10.1137/0215023openalex-snapshot
Optimal Point Location in a Monotone Subdivision
inferredcites →https://doi.org/10.1145/103418.103470openalex-snapshot
Approximations and optimal geometric divide-and-conquer
inferredcites →https://doi.org/10.1145/109648.109668openalex-snapshot
Extremal polygon containment problems
inferredcites →https://doi.org/10.1145/12130.12173openalex-snapshot
Further applications of random sampling to computational geometry
inferredcites →https://doi.org/10.1145/129712.129763openalex-snapshot
Ray shooting and parametric search
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/73007.73044openalex-snapshot
Lines in space-combinators, algorithms and applications
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.5555/127787.127865openalex-snapshot
Planar geometric location problems and maintaining the width of a planar set
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.2000.1107openalex-snapshot
Incremental and Decremental Maintenance of Planar Width
inferred← citeshttps://doi.org/10.1007/3-540-44985-x_29openalex-snapshot
Computing the Penetration Depth of Two Convex Polytopes in 3D
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-48481-7_32openalex-snapshot
On Computing the Diameter of a Point Set in High Dimensional Euclidean Space
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-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-540-45058-0_20openalex-snapshot
Computation on Parametric Curves with Applications in Localization and Grasping
inferred← citeshttps://doi.org/10.1007/978-3-642-54423-1_8openalex-snapshot
Optimal Algorithms for Constrained 1-Center Problems
inferred← citeshttps://doi.org/10.1007/bf01293483openalex-snapshot
Dynamic half-space range reporting and its applications
inferred← citeshttps://doi.org/10.1007/bf02574015openalex-snapshot
On range searching with semialgebraic sets
inferred← citeshttps://doi.org/10.1007/bf02574384openalex-snapshot
Almost tight upper bounds for lower envelopes in higher dimensions
inferred← citeshttps://doi.org/10.1007/bf02711511openalex-snapshot
A near-linear algorithm for the planar segment-center problem
inferred← citeshttps://doi.org/10.1007/bf02712871openalex-snapshot
Efficient randomized algorithms for some geometric optimization problems
inferred← citeshttps://doi.org/10.1007/bf02712875openalex-snapshot
New lower bounds for Hopcroft's problem
inferred← citeshttps://doi.org/10.1007/bfb0015247openalex-snapshot
Algorithmic techniques for geometric optimization
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/bfb0054308openalex-snapshot
Faster non-linear parametric search with applications to optimization and dynamic geometry
inferred← citeshttps://doi.org/10.1007/pl00009478openalex-snapshot
Geometric Applications of a Randomized Optimization Technique
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/s004540010086openalex-snapshot
An efficient algorithm for the three-dimensional diameter problem
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00111-uopenalex-snapshot
On the complexity of some basic problems in computational convexity: I. Containment problems
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90234-zopenalex-snapshot
Optimal slope selection via expanders
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00190-aopenalex-snapshot
On enclosing k points by a circle
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00022-4openalex-snapshot
Computing grasp functions
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/0925-7721(95)00052-6openalex-snapshot
All convex polyhedra can be clamped with parallel jaw grippers
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.comgeo.2005.03.002openalex-snapshot
Extremal point queries with lines and line segments and related problems
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.ipl.2013.04.011openalex-snapshot
A note on searching line arrangements and applications
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115583openalex-snapshot
On k -enclosing slab problems
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00049-5openalex-snapshot
Linear approximation of simple objects
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00258-4openalex-snapshot
On computing the diameter of a point set in high dimensional Euclidean space
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00647-1openalex-snapshot
Continuous location of dimensional structures
inferred← citeshttps://doi.org/10.1016/s0925-7721(96)00010-7openalex-snapshot
Intersection of unit-balls and diameter of a point set in R3
inferred← citeshttps://doi.org/10.1016/s0925-7721(97)00025-4openalex-snapshot
Optimal slope selection via cuttings
inferred← citeshttps://doi.org/10.1109/focs.2012.32openalex-snapshot
On Range Searching with Semialgebraic Sets II
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366837openalex-snapshot
Almost tight upper bounds for lower envelopes in higher dimensions
inferred← citeshttps://doi.org/10.1109/sfcs.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.2001.959880openalex-snapshot
Almost tight upper bounds for vertical decompositions in four dimensions
inferred← citeshttps://doi.org/10.1137/s0097539794265724openalex-snapshot
Computing Envelopes in Four Dimensions with Applications
inferred← citeshttps://doi.org/10.1137/s0097539794268649openalex-snapshot
An Expander-Based Approach to Geometric Optimization
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.1142/s0218195902000748openalex-snapshot
APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
inferred← citeshttps://doi.org/10.1145/1017460.1017461openalex-snapshot
Almost tight upper bounds for vertical decompositions in four dimensions
inferred← citeshttps://doi.org/10.1145/142675.142703openalex-snapshot
Incidence and nearest-neighbor problems for lines in 3-space
inferred← citeshttps://doi.org/10.1145/160985.160990openalex-snapshot
On lines missing polyhedral sets in 3-space
inferred← citeshttps://doi.org/10.1145/160985.161135openalex-snapshot
Finding a minimum weight K -link path in graphs with Monge property and applications
inferred← citeshttps://doi.org/10.1145/167088.167217openalex-snapshot
A deterministic algorithm for the three-dimensional diameter problem
inferred← citeshttps://doi.org/10.1145/177424.178040openalex-snapshot
Efficient piecewise-linear function approximation using the uniform metric
inferred← citeshttps://doi.org/10.1145/177424.178081openalex-snapshot
Computing envelopes in four dimensions with applications
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/220279.220293openalex-snapshot
New lower bounds for Hopcroft's problem
inferred← citeshttps://doi.org/10.1145/220279.220314openalex-snapshot
Efficient randomized algorithms for some geometric optimization problems
inferred← citeshttps://doi.org/10.1145/263867.263869openalex-snapshot
Approximating shortest paths on a convex polytope in three dimensions
inferred← citeshttps://doi.org/10.1145/276884.276887openalex-snapshot
Multi-criteria geometric optimization problems in layered manufacturing
inferred← citeshttps://doi.org/10.1145/276884.276915openalex-snapshot
Geometric applications of a randomized optimization technique
inferred← citeshttps://doi.org/10.1145/299917.299918openalex-snapshot
Efficient algorithms for geometric optimization
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/336154.336216openalex-snapshot
Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus
inferred← citeshttps://doi.org/10.1145/347792.347816openalex-snapshot
Computing the width of a three-dimensional point set
inferred← citeshttps://doi.org/10.1177/0278364904045478openalex-snapshot
Computation on Parametric Curves with an Application in Grasping
inferred← citeshttps://doi.org/10.17771/pucrio.acad.52179openalex-snapshot
PARAMETRIC SEARCH FOR VARIANTS OF NESTED RESOURCE ALLOCATION PROBLEMS
inferred← citeshttps://doi.org/10.22215/etd/2016-11514openalex-snapshot
On Proximity Problems In Euclidean Spaces
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amr.591-593.688openalex-snapshot
The Optimized Iterative Projection Method to Determine the Width of an Arbitrary 3D Object
inferred← citeshttps://doi.org/10.5555/313559.313614openalex-snapshot
Efficient randomized algorithms for the repeated median line estimator
inferred← citeshttps://doi.org/10.5555/314464.314482openalex-snapshot
A near-linear algorithm for the planar segment center problem
inferred← citeshttps://doi.org/10.5555/314613.314693openalex-snapshot
An efficient algorithm for the three-dimensional diameter problem
inferred← citeshttps://doi.org/10.5555/642992.642999openalex-snapshot
Penetration depth of two convex polytopes in 3D
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.