Department of Mathematics
 Search | Help | Login | pdf version | printable version

Math @ Duke



Publications [#235515] of Pankaj K. Agarwal

Papers Published

  1. Agarwal, PK; Sharir, M; Welzl, E, Algorithms for center and Tverberg points, ACM Transactions on Algorithms, vol. 5 no. 1 (2008), ISSN 1549-6325 [doi]
    (last updated on 2017/12/13)

    Given a set S of n points in R3, a point x in R3 is called center point of S if every closed halfspace whose bounding hyperplane passes through x contains at least ⌈n/4⌉ points from S. We present a near-quadratic algorithm for computing the center region, that is the set of all center points, of a set of n points in R3. This is nearly tight in the worst case since the center region can have (n2) complexity. We then consider sets S of 3n points in the plane which are the union of three disjoint sets consisting respectively of n red, n blue, and n green points. A point x in R2 is called a colored Tverberg point of S if there is a partition of S into n triples with one point of each color, so that x lies in all triangles spanned by these triples. We present a first polynomial-time algorithm for recognizing whether a given point is a colored Tverberg point of such a 3-colored set S. © 2008 ACM.
ph: 919.660.2800
fax: 919.660.2821

Mathematics Department
Duke University, Box 90320
Durham, NC 27708-0320