Approximating center points with iterated radon points

Proceedings of the 9th Annual Symposium on Computational Geometry

Volumn , Issue , 1993, Pages 91-98

  Clarkson, K L ^a   Eppstein, David ^a   Miller, Gary L ^a   Sturtivant, Carl ^a   Teng, Shang Hua ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; ITERATIVE METHODS; LINEAR PROGRAMMING; POLYNOMIALS; PROBABILITY; RANDOM PROCESSES;

APPROXIMATING CENTER POINT; CONSTANT FACTOR; GEOMETRIC ALGORITHMS; ITERATED RADON POINT; LINEAR INEQUALITIES; MESH PARTITIONING METHOD; OPTIMALLY PARALLELIZED; SUBEXPONENTIAL;

GEOMETRY;

EID: 0027805281     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/160985.161004     Document Type: Conference Paper

References (24)