On the public citation graph
Efficient randomized algorithms for some geometric optimization problems
0 signed · 109 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.1994.1038openalex-snapshot
Applications of Parametric Searching in Geometric Optimization
inferredcites →https://doi.org/10.1007/3-540-57155-8_283openalex-snapshot
An optimal algorithm for roundness determination on convex polygons
inferredcites →https://doi.org/10.1007/978-3-642-83539-1_9openalex-snapshot
Davenport-Schinzel Sequences and their Geometric Applications
inferredcites →https://doi.org/10.1007/bf02108667openalex-snapshot
Generalised regression problems in metrology
inferredcites →https://doi.org/10.1007/bf02187740openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1007/bf02187783openalex-snapshot
Combinatorial complexity bounds for arrangements of curves and spheres
inferredcites →https://doi.org/10.1007/bf02570705openalex-snapshot
On lazy randomized incremental construction
inferredcites →https://doi.org/10.1007/bf02573973openalex-snapshot
Diameter, width, closest line pair, and parametric searching
inferredcites →https://doi.org/10.1007/bf02574383openalex-snapshot
New bounds for lower envelopes in three dimensions, with applications to visibility in terrains
inferredcites →https://doi.org/10.1007/bf02574384openalex-snapshot
Almost tight upper bounds for lower envelopes in higher dimensions
inferredcites →https://doi.org/10.1007/bfb0035760openalex-snapshot
A singly-exponential stratification scheme for real semi-algebraic varieties and its applications
inferredcites →https://doi.org/10.1016/0020-0190(85)90044-4openalex-snapshot
Constructing the visibility graph for n-line segments in O(n2) time
inferredcites →https://doi.org/10.1016/0020-0190(90)90167-vopenalex-snapshot
Computing the longest diagonal of a simple polygon
inferredcites →https://doi.org/10.1016/0020-0190(91)90177-jopenalex-snapshot
Randomized optimal algorithm for slope selection
inferredcites →https://doi.org/10.1016/0020-0190(93)90234-zopenalex-snapshot
Optimal slope selection via expanders
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.1016/s0747-7171(08)80065-xopenalex-snapshot
An algorithm for generalized point location and its applications
inferredcites →https://doi.org/10.1137/s0097539792229404openalex-snapshot
On Collision-Free Placements of Simplices and the Closest Pair of Lines in 3-Space
inferredcites →https://doi.org/10.1137/s0097539794265724openalex-snapshot
Computing Envelopes in Four Dimensions with Applications
inferredcites →https://doi.org/10.1142/s0218195992000020openalex-snapshot
A RANDOMIZED ALGORITHM FOR SLOPE SELECTION
inferredcites →https://doi.org/10.1145/160985.161137openalex-snapshot
An expander-based approach to geometric optimization
inferredcites →https://doi.org/10.1145/177424.177427openalex-snapshot
Vertical decompositions for triangles in 3-space
inferredcites →https://doi.org/10.1145/177424.178081openalex-snapshot
Computing envelopes in four dimensions with applications
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/220279.220299openalex-snapshot
The overlay of lower envelopes in three dimensions and its applications
inferredcites →https://doi.org/10.1145/2422.322418openalex-snapshot
Linear Programming in Linear Time When the Dimension Is Fixed
inferredcites →https://doi.org/10.1145/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
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.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-45749-6_9openalex-snapshot
Approximation Algorithms for k-Line Center
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-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-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-30139-6_11openalex-snapshot
Computing a Minimum-Width Square Annulus in Arbitrary Orientation
inferred← citeshttps://doi.org/10.1007/978-3-319-45738-3_19openalex-snapshot
Circles in the Water: Towards Island Group Labeling
inferred← citeshttps://doi.org/10.1007/978-3-319-75172-6_5openalex-snapshot
Minimum-Width Annulus with Outliers: Circular, Square, and Rectangular Cases
inferred← citeshttps://doi.org/10.1007/978-3-319-75172-6_6openalex-snapshot
Minimum-Width Square Annulus Intersecting Polygons
inferred← citeshttps://doi.org/10.1007/978-3-540-30551-4_23openalex-snapshot
Geometric Optimization Problems Over Sliding Windows
inferred← citeshttps://doi.org/10.1007/978-3-642-19867-0_20openalex-snapshot
Analytical Description of Digital Circles
inferred← citeshttps://doi.org/10.1007/978-3-642-21204-8_38openalex-snapshot
Minimum Width Rectangular Annulus
inferred← citeshttps://doi.org/10.1007/978-3-642-55566-4_4openalex-snapshot
Computing the Hausdorff Distance of Geometric Patterns and Shapes
inferred← citeshttps://doi.org/10.1007/pl00009392openalex-snapshot
Fitting a Set of Points by a Circle
inferred← citeshttps://doi.org/10.1007/pl00009455openalex-snapshot
Motion Planning for a Convex Polygon in a Polygonal Environment
inferred← citeshttps://doi.org/10.1007/pl00009478openalex-snapshot
Geometric Applications of a Randomized Optimization Technique
inferred← citeshttps://doi.org/10.1007/s00453-005-1166-xopenalex-snapshot
Approximation Algorithms for a k-Line Center
inferred← citeshttps://doi.org/10.1007/s00454-001-0039-6openalex-snapshot
Exact and Approximation Algorithms for Minimum-Width Cylindrical Shells
inferred← citeshttps://doi.org/10.1007/s00454-022-00433-5openalex-snapshot
Bipartite Diameter and Other Measures Under Translation
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.1007/s004540010062openalex-snapshot
Approximation Algorithms for Minimum-Width Annuli and Shells
inferred← citeshttps://doi.org/10.1007/s10957-020-01689-8openalex-snapshot
Certified Efficient Global Roundness Evaluation
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/j.comgeo.2020.101697openalex-snapshot
On the minimum-area rectangular and square annulus problem
inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101887openalex-snapshot
Rearranging a sequence of points onto a line
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.2026.102258openalex-snapshot
Constrained two-line center problems
inferred← citeshttps://doi.org/10.1016/j.dam.2021.03.009openalex-snapshot
Window queries for intersecting objects, maximal points and approximations using coresets
inferred← citeshttps://doi.org/10.1016/j.ipl.2019.01.004openalex-snapshot
Minimum-width annulus with outliers: Circular, square, and rectangular cases
inferred← citeshttps://doi.org/10.1016/j.orl.2009.02.007openalex-snapshot
An optimal algorithm for finding an enclosing planar rectilinear annulus of minimum width
inferred← citeshttps://doi.org/10.1016/j.orl.2019.07.006openalex-snapshot
Computing a minimum-width cubic and hypercubic shell
inferred← citeshttps://doi.org/10.1016/j.orl.2023.07.002openalex-snapshot
An optimal algorithm for the minimum-width cubic shell problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.02.041openalex-snapshot
Minimum-width rectangular annulus
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.11.010openalex-snapshot
Computing a minimum-width square annulus in arbitrary orientation
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.11.031openalex-snapshot
Minimum width color spanning annulus
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.05.045openalex-snapshot
Minimum-width double-strip and parallelogram annulus
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115583openalex-snapshot
On k -enclosing slab problems
inferred← citeshttps://doi.org/10.1016/j.ymssp.2006.03.014openalex-snapshot
Adaptive-randomised self-calibration of electro-mechanical shutters for space imaging
inferred← citeshttps://doi.org/10.1016/s0196-6774(02)00295-xopenalex-snapshot
Approximation algorithms for projective clustering
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(03)00017-8openalex-snapshot
A (1+ε)-approximation algorithm for 2-line-center
inferred← citeshttps://doi.org/10.1016/s0925-7721(98)00025-xopenalex-snapshot
Offset-polygon annulus placement problems
inferred← citeshttps://doi.org/10.1109/is.2004.1344820openalex-snapshot
Self-calibration of electro-mechanical shutters for space imaging by means of adaptive-randomized techniques
inferred← citeshttps://doi.org/10.1109/isvd.2009.20openalex-snapshot
Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space
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.1109/sfcs.2001.959881openalex-snapshot
Approximate shape fitting via linearization
inferred← citeshttps://doi.org/10.1109/tvcg.2004.1260767openalex-snapshot
Incremental penetration depth estimation between convex polytopes using dual-space expansion
inferred← citeshttps://doi.org/10.1111/j.1467-8659.2009.01548.xopenalex-snapshot
Bounding Volume Hierarchies of Slab Cut Balls
inferred← citeshttps://doi.org/10.1137/16m1079695openalex-snapshot
Peeling Potatoes Near-Optimally in Near-Linear Time
inferred← citeshttps://doi.org/10.1137/s0097539794265724openalex-snapshot
Computing Envelopes in Four Dimensions with 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.1142/s0218195902000840openalex-snapshot
COMPUTING ROUNDNESS IS EASY IF THE SET IS ALMOST ROUND
inferred← citeshttps://doi.org/10.1142/s0218195906001975openalex-snapshot
GEOMETRIC OPTIMIZATION PROBLEMS OVER SLIDING WINDOWS
inferred← citeshttps://doi.org/10.1142/s0218195998000242openalex-snapshot
Computing the Angularity Tolerance
inferred← citeshttps://doi.org/10.1142/s021819599900008xopenalex-snapshot
ON THE WIDTH AND ROUNDNESS OF A SET OF POINTS IN THE PLANE
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/2582112.2582159openalex-snapshot
Peeling Potatoes Near-Optimally in Near-Linear Time
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/304893.304984openalex-snapshot
Computing roundness is easy if the set is almost round
inferred← citeshttps://doi.org/10.1145/304893.304992openalex-snapshot
Approximation and exact algorithms for minimum-width annuli and shells
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.2139/ssrn.5399790openalex-snapshot
Constrained Two-Line Center Problems
inferred← citeshttps://doi.org/10.22215/etd/2019-13545openalex-snapshot
Time Windowed Data Structures
inferred← citeshttps://doi.org/10.3390/sym14020359openalex-snapshot
On the Minimum-Area Parallelogram Annulus Problem
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.48550/arxiv.1609.04148openalex-snapshot
Color Spanning Annulus: Square, Rectangle and Equilateral Triangle
inferred← citeshttps://doi.org/10.5555/1109557.1109610openalex-snapshot
Finding large sticks and potatoes in polygons
inferred← citeshttps://doi.org/10.5555/338219.338600openalex-snapshot
Exact and approximation algorithms for minimum-width cylindrical shells
inferred← citeshttps://doi.org/10.5555/338219.338601openalex-snapshot
Evaluating the cylindricity of a nominally cylindrical point set
inferred← citeshttps://doi.org/10.5555/338219.338603openalex-snapshot
Approximation algorithms for projective clustering
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.