Algorithms for center and tverberg points

Pankaj K. Agarwal*, Micha Sharir, Emo Welzl

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

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 ω(n2) 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.

Original languageEnglish
Pages61-67
Number of pages7
DOIs
StatePublished - 2004
EventProceedings of the Twentieth Annual Symposium on Computational Geometry (SCG'04) - Brooklyn, NY, United States
Duration: 9 Jun 200411 Jun 2004

Conference

ConferenceProceedings of the Twentieth Annual Symposium on Computational Geometry (SCG'04)
Country/TerritoryUnited States
CityBrooklyn, NY
Period9/06/0411/06/04

Keywords

  • Center Points
  • Colored Tverberg's Theorem
  • j-Facets

Fingerprint

Dive into the research topics of 'Algorithms for center and tverberg points'. Together they form a unique fingerprint.

Cite this