On the public citation graph
On k -Hulls 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.1016/0020-0190(85)90080-8openalex-snapshot
A parallel median algorithm
inferredcites →https://doi.org/10.1016/0022-0000(81)90012-xopenalex-snapshot
Maintenance of configurations in the plane
inferredcites →https://doi.org/10.1016/0097-3165(85)90017-2openalex-snapshot
On the number of line separations of a finite set in the plane
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/0304-3975(78)90051-8openalex-snapshot
Finding the intersection of two convex polyhedra
inferredcites →https://doi.org/10.1016/b978-0-7204-2262-7.50018-1openalex-snapshot
Dissection Graphs of Planar Point Sets
inferredcites →https://doi.org/10.1080/00029890.1961.11989615openalex-snapshot
How to Cut A Cake Fairly
inferredcites →https://doi.org/10.1080/00029890.1983.11971254openalex-snapshot
Determining a Fair Border
inferredcites →https://doi.org/10.1137/0212052openalex-snapshot
Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
inferredcites →https://doi.org/10.1137/0215019openalex-snapshot
Constructing Belts in Two-Dimensional Arrangements with Applications
inferredcites →https://doi.org/10.1137/0215023openalex-snapshot
Optimal Point Location in a Monotone Subdivision
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/7531.7537openalex-snapshot
Slowing down sorting networks to obtain faster sorting algorithms
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.1007/0-387-25592-3_3openalex-snapshot
Data Depth and Maximum Feasible Subsystems
inferred← citeshttps://doi.org/10.1007/11821069_30openalex-snapshot
k-Sets of Convex Inclusion Chains of Planar Point Sets
inferred← citeshttps://doi.org/10.1007/11944836_11openalex-snapshot
Computing a Center-Transversal Line
inferred← citeshttps://doi.org/10.1007/3-540-19487-8_7openalex-snapshot
Intersecting line segments, ray shooting, and other applications of geometric partitioning techniques
inferred← citeshttps://doi.org/10.1007/3-540-51542-9_15openalex-snapshot
Computing the center of area of a polygon
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/978-1-4613-0251-3_7openalex-snapshot
Exact parallel algorithms for the location depth and the maximum feasible subsystem problems
inferred← citeshttps://doi.org/10.1007/978-1-4613-8369-7_3openalex-snapshot
Automatic Mesh Partitioning
inferred← citeshttps://doi.org/10.1007/978-3-030-39219-2_38openalex-snapshot
Algorithms for Radon Partitions with Tolerance
inferred← citeshttps://doi.org/10.1007/978-3-0348-7958-3_25openalex-snapshot
Computational Geometry and Statistical Depth Measures
inferred← citeshttps://doi.org/10.1007/978-3-540-89550-3_18openalex-snapshot
Divide and Conquer Method for k-Set Polygons
inferred← citeshttps://doi.org/10.1007/978-3-642-46992-3_60openalex-snapshot
ISODEPTH: A Program for Depth Contours
inferred← citeshttps://doi.org/10.1007/978-3-642-57338-5_19openalex-snapshot
Computing a High Depth Point in the Plane
inferred← citeshttps://doi.org/10.1007/bf01910633openalex-snapshot
Algorithms for computing the center of area of a convex polygon
inferred← citeshttps://doi.org/10.1007/bf02187740openalex-snapshot
Applications of random sampling in computational geometry, II
inferred← citeshttps://doi.org/10.1007/bf02187784openalex-snapshot
The complexity and construction of many faces in arrangements of lines and of segments
inferred← citeshttps://doi.org/10.1007/bf02187805openalex-snapshot
Partitioning arrangements of lines I: An efficient deterministic algorithm
inferred← citeshttps://doi.org/10.1007/bf02187809openalex-snapshot
Partitioning arrangements of lines II: Applications
inferred← citeshttps://doi.org/10.1007/bf02187829openalex-snapshot
An upper bound on the number of planarK-sets
inferred← citeshttps://doi.org/10.1007/bf02570713openalex-snapshot
On geometric optimization with few violated constraints
inferred← citeshttps://doi.org/10.1007/bf02573973openalex-snapshot
Diameter, width, closest line pair, and parametric searching
inferred← citeshttps://doi.org/10.1007/bf02574382openalex-snapshot
Computing a centerpoint of a finite planar set of points in linear time
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/bfb0028271openalex-snapshot
Parametric search and locating supply centers in trees
inferred← citeshttps://doi.org/10.1007/pl00009354openalex-snapshot
Improved Bounds for Planar k -Sets and Related Problems
inferred← citeshttps://doi.org/10.1007/pl00009396openalex-snapshot
Geometric Lower Bounds for Parametric Matroid Optimization
inferred← citeshttps://doi.org/10.1007/s00373-007-0716-1openalex-snapshot
Some Combinatorial and Algorithmic Applications of the Borsuk–Ulam Theorem
inferred← citeshttps://doi.org/10.1007/s00440-018-0850-0openalex-snapshot
Concentration of the empirical level sets of Tukey’s halfspace depth
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/s00454-001-0005-3openalex-snapshot
An Improved Bound for k-Sets in Three Dimensions
inferred← citeshttps://doi.org/10.1007/s00454-001-0022-2openalex-snapshot
Recognition of Flat Orbifolds and the Classification of Tilings in R 3
inferred← citeshttps://doi.org/10.1007/s00454-003-0011-xopenalex-snapshot
The Complexity of Hyperplane Depth in the Plane
inferred← citeshttps://doi.org/10.1007/s00454-007-9013-2openalex-snapshot
Robust Shape Fitting via Peeling and Grating Coresets
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00134-0openalex-snapshot
k-Violation linear programming
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/0304-3975(87)90009-0openalex-snapshot
Partitioning point sets in arbitrary dimension
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00021-6openalex-snapshot
Point location in zones of k-flats in arrangements
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.2007.05.007openalex-snapshot
Algorithms for bivariate zonoid depth
inferred← citeshttps://doi.org/10.1016/j.comgeo.2008.09.008openalex-snapshot
Dynamic ham-sandwich cuts in the plane
inferred← citeshttps://doi.org/10.1016/j.comgeo.2009.07.001openalex-snapshot
Finding the Θ-guarded region
inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.04.006openalex-snapshot
Approximate centerpoints with proofs
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.2012.06.002openalex-snapshot
Covering a bichromatic point set with two disjoint monochromatic disks
inferred← citeshttps://doi.org/10.1016/j.csda.2006.09.004openalex-snapshot
Point set stratification and Delaunay depth
inferred← citeshttps://doi.org/10.1016/j.csda.2006.12.039openalex-snapshot
Computing the least quartile difference estimator in the plane
inferred← citeshttps://doi.org/10.1016/j.dam.2012.03.009openalex-snapshot
Minimizing the error of linear separators on linearly inseparable data
inferred← citeshttps://doi.org/10.1016/j.dam.2021.09.014openalex-snapshot
Algorithms for Radon partitions with tolerance
inferred← citeshttps://doi.org/10.1016/j.ipl.2013.07.023openalex-snapshot
Order-k α-hulls and α-shapes
inferred← citeshttps://doi.org/10.1016/j.orl.2003.10.004openalex-snapshot
Sorting weighted distances with applications to objective function evaluations in single facility location problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.12.001openalex-snapshot
k -Capture in multiagent pursuit evasion, or the lion and the hyenas
inferred← citeshttps://doi.org/10.1023/a:1023208625954openalex-snapshot
Efficient computation of location depth contours by methods of computational geometry
inferred← citeshttps://doi.org/10.1080/10618600.2023.2257781openalex-snapshot
On Exact Computation of Tukey Depth Central Regions
inferred← citeshttps://doi.org/10.1090/dimacs/072/10openalex-snapshot
Geometric measures of data depth
inferred← citeshttps://doi.org/10.1090/dimacs/072/15openalex-snapshot
Statistical data depth and the graphics hardware
inferred← citeshttps://doi.org/10.1109/34.16713openalex-snapshot
A bibliography on digital and computational convexity (1961-1988)
inferred← citeshttps://doi.org/10.1109/iccv.2009.5459423openalex-snapshot
Mode-detection via median-shift
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63458openalex-snapshot
An upper bound on the number of planar k-sets
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63523openalex-snapshot
Dynamically computing the maxima of decomposable functions, with applications
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646104openalex-snapshot
Improved bounds on planar k-sets and k-levels
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/tc.1987.5009474openalex-snapshot
An Improved Algorithm for Constructing kth-Order Voronoi Diagrams
inferred← citeshttps://doi.org/10.1109/tvcg.2013.224openalex-snapshot
Visual Analytics for Spatial Clustering: Using a Heuristic Approach for Guided Exploration
inferred← citeshttps://doi.org/10.1111/cgf.70529openalex-snapshot
A practical algorithm for weighted k ‐hulls
inferred← citeshttps://doi.org/10.1137/0401038openalex-snapshot
Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
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/12089702xopenalex-snapshot
Self-Improving Algorithms for Coordinatewise Maxima and Convex Hulls
inferred← citeshttps://doi.org/10.1137/21m1423324openalex-snapshot
Optimal Algorithms for Geometric Centers and Depth
inferred← citeshttps://doi.org/10.1137/s0097539794277871openalex-snapshot
Unoriented $Theta$-Maxima in the Plane: Complexity and Algorithms
inferred← citeshttps://doi.org/10.1137/s0097539795281840openalex-snapshot
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
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/s0218195902000967openalex-snapshot
PARAMETRIC POLYMATROID OPTIMIZATION AND ITS GEOMETRIC APPLICATIONS
inferred← citeshttps://doi.org/10.1145/103516.103518openalex-snapshot
Maintenance of geometric extrema
inferred← citeshttps://doi.org/10.1145/142675.142702openalex-snapshot
Diameter, width, closest line pair, and parametric searching
inferred← citeshttps://doi.org/10.1145/1542362.1542395openalex-snapshot
Approximate center points with proofs
inferred← citeshttps://doi.org/10.1145/160985.160994openalex-snapshot
An optimal algorithm for the (≤ k)-levels, with applications to separation and transversal problems
inferred← citeshttps://doi.org/10.1145/160985.161002openalex-snapshot
Geometric partitioning made easier, even in parallel
inferred← citeshttps://doi.org/10.1145/160985.161003openalex-snapshot
Computing a centerpoint of a finite planar set of points in linear time
inferred← citeshttps://doi.org/10.1145/160985.161004openalex-snapshot
Approximating center points with iterated radon points
inferred← citeshttps://doi.org/10.1145/160985.161141openalex-snapshot
Dehn-Sommerville relations, upper bound theorem, and levels in arrangements
inferred← citeshttps://doi.org/10.1145/177424.177521openalex-snapshot
Constructing levels in arrangements and higher order Voronoi diagrams
inferred← citeshttps://doi.org/10.1145/177424.177648openalex-snapshot
Cutting dense point sets in half
inferred← citeshttps://doi.org/10.1145/177424.178039openalex-snapshot
On geometric optimization with few violated constraints
inferred← citeshttps://doi.org/10.1145/1810959.1810978openalex-snapshot
Shape approximation using k-order alpha-hulls
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/220279.220293openalex-snapshot
New lower bounds for Hopcroft's problem
inferred← citeshttps://doi.org/10.1145/225058.225284openalex-snapshot
Geometric lower bounds for parametric matroid optimization
inferred← citeshttps://doi.org/10.1145/299917.299918openalex-snapshot
Efficient algorithms for geometric optimization
inferred← citeshttps://doi.org/10.1145/336154.336173openalex-snapshot
An improved bound for k -sets in three dimensions
inferred← citeshttps://doi.org/10.1145/378583.378675openalex-snapshot
Notes on computing peaks in k-levels and parametric spanning trees
inferred← citeshttps://doi.org/10.1145/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
inferred← citeshttps://doi.org/10.1145/73393.73399openalex-snapshot
The complexity of many faces in arrangements of lines of segments
inferred← citeshttps://doi.org/10.1145/73393.73429openalex-snapshot
Algorithms for vertical and orthogonal L1 linear approximation of points
inferred← citeshttps://doi.org/10.1214/18-sts669openalex-snapshot
Methods for Estimation of Convex Sets
inferred← citeshttps://doi.org/10.1353/ajm.2003.0038openalex-snapshot
The second hull of a knotted curve
inferred← citeshttps://doi.org/10.14288/1.0051487openalex-snapshot
Geometric facility location under continuous motion: bounded-velocity approximations to the mobile Euclidean k-centre and k-median problems
inferred← citeshttps://doi.org/10.17877/de290r-17openalex-snapshot
Effiziente Algorithmen und Komplexität in der robusten Statistik
inferred← citeshttps://doi.org/10.22028/d291-26536openalex-snapshot
General analysis tool box for controlled perturbation algorithms and complexity and computation of Θ-guarded regions
inferred← citeshttps://doi.org/10.22215/etd/2004-06005openalex-snapshot
Algorithms for bivariate zonoid depth
inferred← citeshttps://doi.org/10.3929/ethz-a-010295887openalex-snapshot
Integer Convex Minimization in Low Dimensions
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2011.649openalex-snapshot
On the computational complexity of Ham-Sandwich cuts, Helly sets, and related problems
inferred← citeshttps://doi.org/10.48550/arxiv.0806.2090openalex-snapshot
Finding the theta-Guarded Region
inferred← citeshttps://doi.org/10.48550/arxiv.1109.1517openalex-snapshot
Dynamic Maintenance of Half-Space Depth for Points and Contours
inferred← citeshttps://doi.org/10.5555/1070432.1070452openalex-snapshot
The interface between computational and combinatorial geometry
inferred← citeshttps://doi.org/10.5555/1109557.1109579openalex-snapshot
Robust shape fitting via peeling and grating coresets
inferred← citeshttps://doi.org/10.5555/338219.338233openalex-snapshot
An optimal algorithm for hyperplane depth in the plane
inferred← citeshttps://doi.org/10.5555/338219.338602openalex-snapshot
Approximation algorithms for layered manufacturing
inferred← citeshttps://doi.org/10.5555/365411.365565openalex-snapshot
Fast implementation of depth contours using topological sweep
inferred← citeshttps://doi.org/10.5555/545381.545456openalex-snapshot
Hardware-assisted computation of depth contours
inferred← citeshttps://doi.org/10.5555/982792.982853openalex-snapshot
An optimal randomized algorithm for maximum Tukey depth
inferred← citeshttps://doi.org/10.70675/75f898dfzfaacz4592za6e3z8ee996f080b5openalex-snapshot
K-set Polygons and Centroid Triangulations
inferred← citeshttps://doi.org/10.7282/t32z174fopenalex-snapshot
Some results in computational and combinatorial geometry
inferred← citeshttps://doi.org/10.82308/7359openalex-snapshot
On computing geometric estimators of location
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.