On the public citation graph

Depth in an Arrangement of Hyperplanes

https://doi.org/10.1007/pl00009452
0 signed · 52 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/978-94-011-2546-8_20openalex-snapshot
A Rank-Invariant Method of Linear and Polynomial Regression Analysis
inferredcites →https://doi.org/10.1007/bf02574017openalex-snapshot
Algorithms for ham-sandwich cuts
inferredcites →https://doi.org/10.1007/pl00009190openalex-snapshot
Efficient Randomized Algorithms for the Repeated Median Line Estimator
inferredcites →https://doi.org/10.1016/0012-365x(92)90658-3openalex-snapshot
Geometric medians
inferredcites →https://doi.org/10.1016/0020-0190(91)90177-jopenalex-snapshot
Randomized optimal algorithm for slope selection
inferredcites →https://doi.org/10.1016/0097-3165(82)90061-9openalex-snapshot
Helly-type theorems for pseudoline arrangements in P2
inferredcites →https://doi.org/10.1017/s0305004100034071openalex-snapshot
On 3N points in a plane
inferredcites →https://doi.org/10.1023/a:1008945009397openalex-snapshot
Computing location depth and regression depth in higher dimensions
inferredcites →https://doi.org/10.1080/01621459.1984.10477105openalex-snapshot
Least Median of Squares Regression
inferredcites →https://doi.org/10.1080/01621459.1990.10475313openalex-snapshot
Computing Least Median of Squares Regression Lines and Guided Topological Sweep
inferredcites →https://doi.org/10.1090/dimacs/006/14openalex-snapshot
Computing the center of planar point sets
inferredcites →https://doi.org/10.1090/pspum/007/0157289openalex-snapshot
Helly’s theorem and its relatives
inferredcites →https://doi.org/10.1093/biomet/69.1.242openalex-snapshot
Robust regression using repeated medians
inferredcites →https://doi.org/10.1112/jlms/s1-20.4.226openalex-snapshot
On An Invariant of Plane Regions and Mass Distributions
inferredcites →https://doi.org/10.1112/jlms/s1-21.4.291openalex-snapshot
A Theorem on General Measure
inferredcites →https://doi.org/10.1112/jlms/s1-41.1.123openalex-snapshot
A Generalization of Radon's Theorem
inferredcites →https://doi.org/10.1137/0218055openalex-snapshot
An Optimal-Time Algorithm for Slope Selection
inferredcites →https://doi.org/10.1142/s0218195992000020openalex-snapshot
A RANDOMIZED ALGORITHM FOR SLOPE SELECTION
inferredcites →https://doi.org/10.1142/s021819599600023xopenalex-snapshot
APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS
inferredcites →https://doi.org/10.1145/160985.161004openalex-snapshot
Approximating center points with iterated radon points
inferredcites →https://doi.org/10.1214/aos/1176348890openalex-snapshot
Breakdown Properties of Location Estimates Based on Halfspace Depth and Projected Outlyingness
inferredcites →https://doi.org/10.2307/2325168openalex-snapshot
Algorithms in Combinatorial Geometry.
inferredcites →https://doi.org/10.2307/2335877openalex-snapshot
Robust Regression Using Repeated Medians
inferredcites →https://doi.org/10.5555/314161.314349openalex-snapshot
A practical approximation algorithm for the LMS line estimator

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/0-387-25592-3_3openalex-snapshot
Data Depth and Maximum Feasible Subsystems
inferred← citeshttps://doi.org/10.1007/11944836_11openalex-snapshot
Computing a Center-Transversal Line
inferred← citeshttps://doi.org/10.1007/3-540-36494-3_6openalex-snapshot
Optimization in Arrangements
inferred← citeshttps://doi.org/10.1007/978-3-0348-8326-9_11openalex-snapshot
Similarities Between Location Depth and Regression Depth
inferred← citeshttps://doi.org/10.1007/978-3-642-37487-6_17openalex-snapshot
Indexing Reverse Top-k Queries in Two Dimensions
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/978-981-13-1132-1_2openalex-snapshot
K-Data Depth Based Clustering Algorithm
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-9046-6openalex-snapshot
Efficient Algorithms for Maximum Regression Depth
inferred← citeshttps://doi.org/10.1007/s00454-009-9163-5openalex-snapshot
Intersecting Convex Sets by Rays
inferred← citeshttps://doi.org/10.1007/s00454-010-9294-8openalex-snapshot
Tverberg-Type Theorems for Intersecting by Rays
inferred← citeshttps://doi.org/10.1007/s10474-022-01249-8openalex-snapshot
COUNTEREXAMPLES TO THE COLORFUL TVERBERG CONJECTURE FOR HYPERPLANES
inferred← citeshttps://doi.org/10.1090/bull/1634openalex-snapshot
Tverberg’s theorem is 50 years old: A survey
inferred← citeshttps://doi.org/10.1090/dimacs/072/10openalex-snapshot
Geometric measures of data depth
inferred← citeshttps://doi.org/10.1137/1.9781611972863.5openalex-snapshot
An Experimental Study of Old and New Depth Measures
inferred← citeshttps://doi.org/10.1145/1377676.1377740openalex-snapshot
Intersecting convex sets by rays
inferred← citeshttps://doi.org/10.1145/304893.304901openalex-snapshot
Efficient algorithms for maximum regression depth
inferred← citeshttps://doi.org/10.1145/336154.336218openalex-snapshot
Multivariate regression depth
inferred← citeshttps://doi.org/10.1201/9781315119601openalex-snapshot
Handbook of Discrete and Computational Geometry, Third Edition
inferred← citeshttps://doi.org/10.1214/21-sts827openalex-snapshot
Choosing Among Notions of Multivariate Depth Statistics
inferred← citeshttps://doi.org/10.1214/aos/1043351254openalex-snapshot
On depth and deep points: a calculus
inferred← citeshttps://doi.org/10.13140/rg.2.1.4009.1364openalex-snapshot
Statistical depth meets computational geometry: a short survey
inferred← citeshttps://doi.org/10.26754/uz.978-84-92774-11-1openalex-snapshot
XIII Encuentros de Geometría Computacional. Zaragoza, 29 de junio al 1 de julio de 2009
inferred← citeshttps://doi.org/10.48550/arxiv.1205.0837openalex-snapshot
Indexing Reverse Top-k Queries
inferred← citeshttps://doi.org/10.48550/arxiv.1207.6329openalex-snapshot
Computing optimal k-regret minimizing sets with top-k depth contours
inferred← citeshttps://doi.org/10.70675/614fcf92zed08z4709za655za8565e2422f0openalex-snapshot
Functional anomaly detection and robust estimation
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.