Optimal algorithms for geometric centers and depth
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4213496 (Why is no real title available?)
- scientific article; zbMATH DE number 3541764 (Why is no real title available?)
- scientific article; zbMATH DE number 1203741 (Why is no real title available?)
- scientific article; zbMATH DE number 1962801 (Why is no real title available?)
- scientific article; zbMATH DE number 1749054 (Why is no real title available?)
- scientific article; zbMATH DE number 1445286 (Why is no real title available?)
- scientific article; zbMATH DE number 6469174 (Why is no real title available?)
- A Note about the "Nowhere Denseness" of Societies Having an Equilibrium under Majority Rule
- A combinatorial bound for linear programming and related problems
- A polynomial-time algorithm for computing the yolk in fixed dimension
- A randomized linear-time algorithm to find minimum spanning trees
- A simpler minimum spanning tree verification algorithm
- A subexponential bound for linear programming
- APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS
- Algorithms for bivariate medians and a Fermat-Torricelli problem for lines.
- Algorithms for center and Tverberg points
- An optimal deterministic algorithm for computing the diameter of a three-dimensional point set
- An optimal randomized algorithm for \(d\)-variate zonoid depth
- Applications of random sampling in computational geometry. II
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Computational geometry. Algorithms and applications.
- Computing a Center-Transversal Line
- Computing a centerpoint of a finite planar set of points in linear time
- Computing depth contours of bivariate point clouds
- Cutting hyperplanes for divide-and-conquer
- Efficient algorithms for maximum regression depth
- Fast Algorithms for Geometric Consensuses
- Fast algorithms for collision and proximity problems involving moving geometric objects
- Fast implementation of depth contours using topological sweep
- Faster algorithms for computing plurality points
- Geometric applications of a randomized optimization technique
- Geometric approximation algorithms
- Geometric medians
- Improved bounds for planar k-sets and related problems
- Introduction to algorithms
- Journey to the Center of the Point Set
- Las Vegas algorithms for linear and integer programming when the dimension is small
- Limiting median lines do not suffice to determine the yolk
- Linear Optimization Queries
- Linear Programming in Linear Time When the Dimension Is Fixed
- Linear programming queries revisited
- Lower bounds for computing statistical depth.
- Minimum dilation stars
- Multivariate regression depth
- New Lower Bounds for Convex Hull Problems in Odd Dimensions
- On k-Hulls and Related Problems
- On lazy randomized incremental construction
- On the Zone Theorem for Hyperplane Arrangements
- On the zone of a surface in a hyperplane arrangement
- Optimal algorithms for some intersection radius problems
- Optimal deterministic algorithms for 2-d and 3-d shallow cuttings
- Parametric search made practical
- Point sets with many \(k\)-sets
- Reporting points in halfspaces
- Setting Parameters by Example
- Shortest path in a polygon using sublinear space
- Slowing down sorting networks to obtain faster sorting algorithms
- Small-dimensional linear programming and convex hulls made easy
- The complexity of hyperplane depth in the plane
Cited in
(6)- scientific article; zbMATH DE number 1962801 (Why is no real title available?)
- Computing instance-optimal kernels in two dimensions
- scientific article; zbMATH DE number 1445286 (Why is no real title available?)
- Geometric median in nearly linear time
- scientific article; zbMATH DE number 4213496 (Why is no real title available?)
- No-dimensional Tverberg partitions revisited
This page was built for publication: Optimal algorithms for geometric centers and depth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5864667)
