Algorithms for Center and Tverberg Points (2004)
Cached
Download Links
- [www.cis.upenn.edu]
- [www.math.tau.ac.il]
- [www.cs.tau.ac.il]
- [www.math.tau.ac.il]
- [biogeometry.duke.edu]
- DBLP
Other Repositories/Bibliography
by
Pankaj K. Agarwal
,
Micha Sharir
,
Emo Welzl
| Venue: | SCG'04 |
| Citations: | 5 - 1 self |
BibTeX
@MISC{Agarwal04algorithmsfor,
author = {Pankaj K. Agarwal and Micha Sharir and Emo Welzl},
title = {Algorithms for Center and Tverberg Points},
year = {2004}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present a near-quadratic algorithm for computing the center region of a set of n points in three dimensions. This is nearly tight in the worst case since the center region can have Ω(n 2) complexity. We then consider the problem of recognizing whether a given point q is a colored Tverberg point of a set of n colored points in the plane, and present the first polynomial-time algorithm for this problem.
