On the public citation graph
Computing a centerpoint of a finite planar set of points in linear time
0 signed · 73 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/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1016/0196-6774(85)90011-2openalex-snapshot
Partitioning with two lines in the plane
inferredcites →https://doi.org/10.1109/sfcs.1982.74openalex-snapshot
Linear-time algorithms for linear programming in R3 and related problems
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.1145/103418.103470openalex-snapshot
Approximations and optimal geometric divide-and-conquer
inferredcites →https://doi.org/10.1145/7531.7537openalex-snapshot
Slowing down sorting networks to obtain faster sorting algorithms
inferredcites →https://doi.org/10.2307/2325168openalex-snapshot
Algorithms in Combinatorial Geometry.
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/11533719_50openalex-snapshot
A PTAS for a Disc Covering Problem Using Width-Bounded Separators
inferred← citeshttps://doi.org/10.1007/11775096_15openalex-snapshot
Sublinear Time Width-Bounded Separators and Their Application to the Protein Side-Chain Packing Problem
inferred← citeshttps://doi.org/10.1007/11944836_11openalex-snapshot
Computing a Center-Transversal Line
inferred← citeshttps://doi.org/10.1007/978-3-030-01325-7_30openalex-snapshot
Gathering in the Plane of Location-Aware Robots in the Presence of Spies
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-319-53925-6_20openalex-snapshot
Computing the Center Region and Its Variants
inferred← citeshttps://doi.org/10.1007/978-3-319-62127-2_21openalex-snapshot
Balanced Line Separators of Unit Disk Graphs
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/s00446-014-0240-5openalex-snapshot
Multidimensional agreement in Byzantine systems
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-006-1239-xopenalex-snapshot
The Lifting Model for Reconfiguration
inferred← citeshttps://doi.org/10.1007/s00454-009-9163-5openalex-snapshot
Intersecting Convex Sets by Rays
inferred← citeshttps://doi.org/10.1007/s00454-013-9528-7openalex-snapshot
Approximating Tverberg Points in Linear Time for Any Fixed Dimension
inferred← citeshttps://doi.org/10.1007/s00454-018-9979-yopenalex-snapshot
Computational Aspects of the Colorful Carathéodory Theorem
inferred← citeshttps://doi.org/10.1007/s00454-025-00725-6openalex-snapshot
No-Dimensional Tverberg Partitions Revisited
inferred← citeshttps://doi.org/10.1007/s10878-006-7132-yopenalex-snapshot
A PTAS for a disc covering problem using width-bounded separators
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.2010.03.002openalex-snapshot
Centerpoints and Tverberg's technique
inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.04.006openalex-snapshot
Approximate centerpoints with proofs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2014.05.002openalex-snapshot
Small strong epsilon nets
inferred← citeshttps://doi.org/10.1016/j.comgeo.2016.02.002openalex-snapshot
Discrete Voronoi games and ϵ-nets, in two and three dimensions
inferred← citeshttps://doi.org/10.1016/j.comgeo.2020.101653openalex-snapshot
Packing plane spanning trees into a point set
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.11.048openalex-snapshot
Space-efficient algorithm for computing a centerpoint of a set of points in R2
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.06.026openalex-snapshot
Computing the center region and its variants
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.06.034openalex-snapshot
Gathering in the plane of location-aware robots in the presence of spies
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00017-3openalex-snapshot
Approximate center points in dense point sets
inferred← citeshttps://doi.org/10.1017/9781108539180openalex-snapshot
Forbidden Configurations in Discrete Geometry
inferred← citeshttps://doi.org/10.1038/s41540-024-00365-1openalex-snapshot
Positive-unlabeled learning identifies vaccine candidate antigens in the malaria parasite Plasmodium falciparum
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/aivr56993.2022.00042openalex-snapshot
Digital Twins for Distributed Collaborative Work in Shared Production
inferred← citeshttps://doi.org/10.1109/cdc42340.2020.9304098openalex-snapshot
Interplay Between Resilience and Accuracy in Resilient Vector Consensus in Multi-Agent Networks
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00104openalex-snapshot
Computing Approximate Centerpoints in Polynomial Time
inferred← citeshttps://doi.org/10.1109/mmar.2014.6957353openalex-snapshot
The average 6 DOF path estimation with the use of initial approximation curve
inferred← citeshttps://doi.org/10.1109/tro.2022.3178296openalex-snapshot
Byzantine Resilient Distributed Learning in Multirobot Systems
inferred← citeshttps://doi.org/10.1137/21m1423324openalex-snapshot
Optimal Algorithms for Geometric Centers and Depth
inferred← citeshttps://doi.org/10.1145/1064092.1064103openalex-snapshot
The lifting model for reconfiguration
inferred← citeshttps://doi.org/10.1145/1377676.1377740openalex-snapshot
Intersecting convex sets by rays
inferred← citeshttps://doi.org/10.1145/1435375.1435380openalex-snapshot
Algorithms for center and Tverberg points
inferred← citeshttps://doi.org/10.1145/1542362.1542395openalex-snapshot
Approximate center points with proofs
inferred← citeshttps://doi.org/10.1145/160985.161004openalex-snapshot
Approximating center points with iterated radon points
inferred← citeshttps://doi.org/10.1145/2261250.2261294openalex-snapshot
Approximating Tverberg points in linear time for any fixed dimension
inferred← citeshttps://doi.org/10.1145/2484239.2484256openalex-snapshot
Byzantine vector consensus in complete graphs
inferred← citeshttps://doi.org/10.1145/299917.299918openalex-snapshot
Efficient algorithms for geometric optimization
inferred← citeshttps://doi.org/10.1145/997817.997830openalex-snapshot
Algorithms for center and Tverberg points
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.15607/rss.2020.xvi.021openalex-snapshot
Resilient Distributed Diffusion for Multi-Robot Systems Using Centerpoint
inferred← citeshttps://doi.org/10.22215/etd/2004-06005openalex-snapshot
Algorithms for bivariate zonoid depth
inferred← citeshttps://doi.org/10.23919/acc45564.2020.9147441openalex-snapshot
Resilient Vector Consensus in Multi-Agent Networks Using Centerpoints
inferred← citeshttps://doi.org/10.25781/kaust-yn9r1openalex-snapshot
Algorithms for Computing Motorcycle Graphs
inferred← citeshttps://doi.org/10.4230/lipics.esa.2021.51openalex-snapshot
Improved Approximation Algorithms for Tverberg Partitions
inferred← citeshttps://doi.org/10.4230/lipics.socg.2020.55openalex-snapshot
A Quasi-Polynomial Algorithm for Well-Spaced Hyperbolic TSP
inferred← citeshttps://doi.org/10.4230/lipics.socg.2021.12openalex-snapshot
On Undecided LP, Clustering and Active Learning
inferred← citeshttps://doi.org/10.48550/arxiv.0912.1580openalex-snapshot
Computing Hulls And Centerpoints In Positive Definite Space
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.48550/arxiv.2003.05497openalex-snapshot
Resilient Distributed Vector Consensus Using Centerpoints
inferred← citeshttps://doi.org/10.5555/338219.338233openalex-snapshot
An optimal algorithm for hyperplane depth in the plane
inferred← citeshttps://doi.org/10.5555/982792.982853openalex-snapshot
An optimal randomized algorithm for maximum Tukey depth
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.