On the public citation graph
Output-sensitive results on convex hulls, extreme points, and related problems
0 signed · 145 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-50335-8_34openalex-snapshot
On the detection of a common intersection of κ convex polyhedra
inferredcites →https://doi.org/10.1007/3-540-55210-3_213openalex-snapshot
A combinatorial bound for linear programming and related problems
inferredcites →https://doi.org/10.1007/3-540-59042-0_105openalex-snapshot
Enumerating extreme points in higher dimensions
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/bf02187740openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1007/bf02189314openalex-snapshot
Cutting hyperplanes for divide-and-conquer
inferredcites →https://doi.org/10.1007/bf02573975openalex-snapshot
On ray shooting in convex polytopes
inferredcites →https://doi.org/10.1007/bf02573985openalex-snapshot
An optimal convex hull algorithm in any fixed dimension
inferredcites →https://doi.org/10.1007/bf02574699openalex-snapshot
Small-dimensional linear programming and convex hulls made easy
inferredcites →https://doi.org/10.1007/bf02712873openalex-snapshot
Optimal output-sensitive convex hull algorithms in two and three dimensions
inferredcites →https://doi.org/10.1007/bfb0038202openalex-snapshot
Smallest enclosing disks (balls and ellipsoids)
inferredcites →https://doi.org/10.1016/0020-0190(72)90045-2openalex-snapshot
An efficient algorith for determining the convex hull of a finite planar set
inferredcites →https://doi.org/10.1016/0020-0190(88)90127-5openalex-snapshot
On the detection of a common intersection of k convex objects in the plane
inferredcites →https://doi.org/10.1016/0020-0190(89)90156-7openalex-snapshot
On the average number of maxima in a set of vectors
inferredcites →https://doi.org/10.1016/0020-0190(94)00134-0openalex-snapshot
k-Violation linear programming
inferredcites →https://doi.org/10.1016/0022-0000(81)90012-xopenalex-snapshot
Maintenance of configurations in the plane
inferredcites →https://doi.org/10.1016/0196-6774(80)90015-2openalex-snapshot
Decomposable searching problems I. Static-to-dynamic transformation
inferredcites →https://doi.org/10.1016/0196-6774(85)90017-3openalex-snapshot
Finding the convex hull facet by facet
inferredcites →https://doi.org/10.1016/0304-3975(82)90120-7openalex-snapshot
Fast detection of polyhedral intersection
inferredcites →https://doi.org/10.1016/0925-7721(94)00018-qopenalex-snapshot
Derandomizing an output-sensitive convex hull algorithm in three dimensions
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.185410openalex-snapshot
Dynamic three-dimensional linear programming
inferredcites →https://doi.org/10.1109/sfcs.1994.365723openalex-snapshot
More output-sensitive geometric algorithms
inferredcites →https://doi.org/10.1109/tit.1985.1057060openalex-snapshot
On the convex layers of a planar set
inferredcites →https://doi.org/10.1112/s0025579300002850openalex-snapshot
The maximum numbers of faces of a convex polytope
inferredcites →https://doi.org/10.1137/0215019openalex-snapshot
Constructing Belts in Two-Dimensional Arrangements with Applications
inferredcites →https://doi.org/10.1137/0215021openalex-snapshot
The Ultimate Planar Convex Hull Algorithm?
inferredcites →https://doi.org/10.1137/0220016openalex-snapshot
An $O(n\log ^2 h)$ Time Algorithm for the Three-Dimensional Convex Hull Problem
inferredcites →https://doi.org/10.1145/100216.100259openalex-snapshot
Output sensitive construction of levels and Voronoi diagrams in R d of order 1 to k
inferredcites →https://doi.org/10.1145/12130.12172openalex-snapshot
Constructing higher-dimensional convex hulls at logarithmic cost per face
inferredcites →https://doi.org/10.1145/142675.142694openalex-snapshot
An efficient approach to removing geometric degeneracies
inferredcites →https://doi.org/10.1145/177424.178039openalex-snapshot
On geometric optimization with few violated constraints
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.220281openalex-snapshot
Output-sensitive results on convex hulls, extreme points, and related problems
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/321556.321564openalex-snapshot
An Algorithm for Convex Polytopes
inferredcites →https://doi.org/10.1145/322092.322095openalex-snapshot
On the Average Number of Maxima in a Set of Vectors and Applications
inferredcites →https://doi.org/10.1145/359423.359430openalex-snapshot
Convex hulls of finite sets of points in two and three dimensions
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.1145/77635.77639openalex-snapshot
Simulation of simplicity: a technique to cope with degenerate cases in geometric 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.
inferredcites →https://doi.org/10.2307/3212146openalex-snapshot
Sur L'enveloppe convexe des nuages de points aleatoires dans R n . I
inferredcites →https://doi.org/10.5555/313651.313708openalex-snapshot
Output-sensitive construction of polytopes in four dimensions and clipped Voronoi diagrams in three
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.1127openalex-snapshot
Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
inferred← citeshttps://doi.org/10.1006/jsco.1998.0271openalex-snapshot
Solving Degenerate Sparse Polynomial Systems Faster
inferred← citeshttps://doi.org/10.1007/11496199_48openalex-snapshot
Point Sets and Frame Algorithms in Management
inferred← citeshttps://doi.org/10.1007/3-540-45253-2_15openalex-snapshot
Property Testing in Computational Geometry
inferred← citeshttps://doi.org/10.1007/978-3-030-67899-9_14openalex-snapshot
A Worst-Case Optimal Algorithm to Compute the Minkowski Sum of Convex Polytopes
inferred← citeshttps://doi.org/10.1007/978-3-319-53375-9_6openalex-snapshot
An Online Data Validation Algorithm for Electronic Nose
inferred← citeshttps://doi.org/10.1007/978-3-540-46515-7_21openalex-snapshot
Grouping and Querying: A Paradigm to Get Output-Sensitive Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_24openalex-snapshot
Approximating Points by a Piecewise Linear Function: I
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_25openalex-snapshot
Approximating Points by a Piecewise Linear Function: II. Dealing with Outliers
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_61openalex-snapshot
Outlier Respecting Points Approximation
inferred← citeshttps://doi.org/10.1007/978-3-662-05148-1_2openalex-snapshot
Some Algorithmic Problems in Polytope Theory
inferred← citeshttps://doi.org/10.1007/bf02712873openalex-snapshot
Optimal output-sensitive convex hull algorithms in two and three dimensions
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/pl00009410openalex-snapshot
Incremental Convex Hull Algorithms Are Not Output Sensitive
inferred← citeshttps://doi.org/10.1007/pl00009478openalex-snapshot
Geometric Applications of a Randomized Optimization Technique
inferred← citeshttps://doi.org/10.1007/s00453-012-9658-yopenalex-snapshot
Approximating Points by a Piecewise Linear Function
inferred← citeshttps://doi.org/10.1007/s00453-012-9738-zopenalex-snapshot
Outlier Respecting Points Approximation
inferred← citeshttps://doi.org/10.1007/s00454-009-9177-zopenalex-snapshot
On Approximate Range Counting and Depth
inferred← citeshttps://doi.org/10.1007/s00454-014-9629-yopenalex-snapshot
A New Approach to Output-Sensitive Construction of Voronoi Diagrams and Delaunay Triangulations
inferred← citeshttps://doi.org/10.1007/s00454-015-9677-yopenalex-snapshot
On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures
inferred← citeshttps://doi.org/10.1007/s10107-015-0944-8openalex-snapshot
Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs
inferred← citeshttps://doi.org/10.1007/s10479-014-1707-2openalex-snapshot
A characterization theorem and an algorithm for a convex hull problem
inferred← citeshttps://doi.org/10.1007/s10479-016-2385-zopenalex-snapshot
Combinatorial redundancy detection
inferred← citeshttps://doi.org/10.1007/s10479-020-03557-0openalex-snapshot
Robust vertex enumeration for convex hulls in high dimensions
inferred← citeshttps://doi.org/10.1016/0020-0190(96)00116-0openalex-snapshot
Output-sensitive peeling of convex and maximal layers
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.cad.2015.07.013openalex-snapshot
A Total Order Heuristic-Based Convex Hull Algorithm for Points in the Plane
inferred← citeshttps://doi.org/10.1016/j.comgeo.2011.12.006openalex-snapshot
Competing output-sensitive frame algorithms
inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.03.004openalex-snapshot
Convex hull of points lying on lines in o ( n log n ) time after preprocessing
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.02.001openalex-snapshot
Convex hulls of spheres and convex hulls of disjoint convex polytopes
inferred← citeshttps://doi.org/10.1016/j.robot.2016.09.004openalex-snapshot
Partial convex hull algorithms for efficient grasp quality evaluation
inferred← citeshttps://doi.org/10.1016/j.swevo.2021.100915openalex-snapshot
Efficient user-oriented Pareto fronts and Pareto archives based on spatial data structures
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.05.004openalex-snapshot
Space-efficient planar convex hull algorithms
inferred← citeshttps://doi.org/10.1109/focs.2009.34openalex-snapshot
Instance-Optimal Geometric Algorithms
inferred← citeshttps://doi.org/10.1109/icra.2015.7139789openalex-snapshot
Fast grasp quality evaluation with partial convex hull computation
inferred← citeshttps://doi.org/10.1109/ijcnn.2014.6889699openalex-snapshot
Finding convex hull vertices in metric space
inferred← citeshttps://doi.org/10.1109/robot.2010.5509297openalex-snapshot
A fast n-dimensional ray-shooting algorithm for grasping force optimization
inferred← citeshttps://doi.org/10.1109/sfcs.1996.548506openalex-snapshot
New lower bounds for halfspace emptiness
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743509openalex-snapshot
Random sampling, halfspace range reporting, and construction of (≤k)-levels in three dimensions
inferred← citeshttps://doi.org/10.1109/sfcs.2002.1181981openalex-snapshot
Low-dimensional linear programming with violations
inferred← citeshttps://doi.org/10.1109/sffcs.1999.814581openalex-snapshot
Dynamic planar convex hull operations in near-logarithmic amortized time
inferred← citeshttps://doi.org/10.1137/1.9781611972863.5openalex-snapshot
An Experimental Study of Old and New Depth Measures
inferred← citeshttps://doi.org/10.1137/1.9781611974782.18openalex-snapshot
Optimal Approximate Polytope Membership
inferred← citeshttps://doi.org/10.1137/1.9781611977066.6openalex-snapshot
Finding Relevant Points for Nearest-Neighbor Classification
inferred← citeshttps://doi.org/10.1137/16m1061096openalex-snapshot
Approximate Polytope Membership Queries
inferred← citeshttps://doi.org/10.1137/s0097539703439404openalex-snapshot
Low-Dimensional Linear Programming with Violations
inferred← citeshttps://doi.org/10.1137/s0097539797315410openalex-snapshot
New Lower Bounds for Convex Hull Problems in Odd Dimensions
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.1142/s0218195901000511openalex-snapshot
ON ENUMERATING AND SELECTING DISTANCES
inferred← citeshttps://doi.org/10.1142/s0218195901000651openalex-snapshot
COMPUTATIONAL GEOMETRY COLUMN 42
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/s0218195911003779openalex-snapshot
FINDING SIMPLICES CONTAINING THE ORIGIN IN TWO AND THREE DIMENSIONS
inferred← citeshttps://doi.org/10.1145/1247069.1247129openalex-snapshot
On approximate range counting and depth
inferred← citeshttps://doi.org/10.1145/1998196.1998199openalex-snapshot
Convex hull of imprecise points in o(n log n) time after preprocessing
inferred← citeshttps://doi.org/10.1145/1998196.1998233openalex-snapshot
Kinetic convex hulls and delaunay triangulations in the black-box model
inferred← citeshttps://doi.org/10.1145/1998196.1998262openalex-snapshot
Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes
inferred← citeshttps://doi.org/10.1145/237218.237225openalex-snapshot
New lower bounds for convex hull problems in odd dimensions
inferred← citeshttps://doi.org/10.1145/237218.237347openalex-snapshot
On computing Voronoi diagrams by divide-prune-and-conquer
inferred← citeshttps://doi.org/10.1145/2462356.2462372openalex-snapshot
A new approach to output-sensitive voronoi diagrams and delaunay triangulations
inferred← citeshttps://doi.org/10.1145/2493132.2462372openalex-snapshot
A new approach to output-sensitive voronoi diagrams and delaunay triangulations
inferred← citeshttps://doi.org/10.1145/2582112.2582166openalex-snapshot
On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures
inferred← citeshttps://doi.org/10.1145/262839.262988openalex-snapshot
Space-time tradeoffs for emptiness queries (extended abstract)
inferred← citeshttps://doi.org/10.1145/276884.276915openalex-snapshot
Geometric applications of a randomized optimization technique
inferred← citeshttps://doi.org/10.1145/301250.301395openalex-snapshot
On the complexity of diophantine geometry in low dimensions (extended abstract)
inferred← citeshttps://doi.org/10.1145/3046673openalex-snapshot
Instance-Optimal Geometric Algorithms
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/3448016.3452832openalex-snapshot
On m-Impact Regions and Standing Top-k Influence Problems
inferred← citeshttps://doi.org/10.1145/3531054openalex-snapshot
On Finding Rank Regret Representatives
inferred← citeshttps://doi.org/10.1145/363647.363652openalex-snapshot
Dynamic planar convex hull operations in near-logarithmic amortized time
inferred← citeshttps://doi.org/10.11650/tjm/260104openalex-snapshot
Methods for Identifying All Extreme Points of Convex Hulls in Spaces of Dimension Greater than 3 Revisited
inferred← citeshttps://doi.org/10.1177/14759217211010238openalex-snapshot
A novel intelligent inspection robot with deep stereo vision for three-dimensional concrete damage detection and quantification
inferred← citeshttps://doi.org/10.1214/ejp.v8-137openalex-snapshot
Berry-Esseen Bounds for the Number of Maxima in Planar Regions
inferred← citeshttps://doi.org/10.1287/ijoc.1040.0109openalex-snapshot
Algorithms for the Frame of a Finitely Generated Unbounded Polyhedron
inferred← citeshttps://doi.org/10.14279/depositonce-543openalex-snapshot
The maximum feasible subsystem problem and vertex-facet incidences of polyhedra
inferred← citeshttps://doi.org/10.1556/012.2024.04308openalex-snapshot
Two-Sided Convexity Testing with Certificates
inferred← citeshttps://doi.org/10.20382/jocg.v3i1a11openalex-snapshot
Kinetic convex hulls, Delaunay triangulations and connectivity structures in the black-box model
inferred← citeshttps://doi.org/10.3233/fi-2011-406openalex-snapshot
On the Fermat-Weber Point of a Polygonal Chain and its Generalizations
inferred← citeshttps://doi.org/10.3929/ethz-a-006250404openalex-snapshot
Extreme points in medium and high dimensions
inferred← citeshttps://doi.org/10.4230/lipics.esa.2021.24openalex-snapshot
An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility
inferred← citeshttps://doi.org/10.46298/dmtcs.3381openalex-snapshot
Distribution-sensitive set multi-partitioning
inferred← citeshttps://doi.org/10.48550/arxiv.1004.2958openalex-snapshot
On the Fermat-Weber Point of a Polygonal Chain
inferred← citeshttps://doi.org/10.48550/arxiv.1210.8234openalex-snapshot
The hyperbolic Voronoi diagram in arbitrary dimension
inferred← citeshttps://doi.org/10.48550/arxiv.1505.00184openalex-snapshot
Instance Optimal Geometric Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1701.03693openalex-snapshot
Multivariate Analysis for Computing Maxima in High Dimensions
inferred← citeshttps://doi.org/10.48550/arxiv.2011.14549openalex-snapshot
Persistent Reductions in Regularized Loss Minimization for Variable Selection
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0108021openalex-snapshot
Computational Geometry Column 42
inferred← citeshttps://doi.org/10.5555/1873601.1873673openalex-snapshot
An improved construction of progression-free sets
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.