Journey to the center of the point set

Sariel Har-Peled, Mitchell Jones

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We revisit an algorithm of Clarkson et al. [1], that computes (roughly) a 1/(4d2)-centerpoint in Õ(d9) time, for a point set in ℝd, where Õ hides polylogarithmic terms. We present an improved algorithm that computes (roughly) a 1/d2-centerpoint with running time Õ(d7). While the improvements are (arguably) mild, it is the first progress on this well known problem in over twenty years. The new algorithm is simpler, and the running time bound follows by a simple random walk argument, which we believe to be of independent interest. We also present several new applications of the improved centerpoint algorithm.

Original languageEnglish (US)
Title of host publication35th International Symposium on Computational Geometry, SoCG 2019
EditorsGill Barequet, Yusu Wang
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959771047
DOIs
StatePublished - Jun 1 2019
Event35th International Symposium on Computational Geometry, SoCG 2019 - Portland, United States
Duration: Jun 18 2019Jun 21 2019

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume129
ISSN (Print)1868-8969

Conference

Conference35th International Symposium on Computational Geometry, SoCG 2019
CountryUnited States
CityPortland
Period6/18/196/21/19

Keywords

  • Centerpoints
  • Computational geometry
  • Random walks

ASJC Scopus subject areas

  • Software

Cite this

Har-Peled, S., & Jones, M. (2019). Journey to the center of the point set. In G. Barequet, & Y. Wang (Eds.), 35th International Symposium on Computational Geometry, SoCG 2019 [41] (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 129). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2019.41

Journey to the center of the point set. / Har-Peled, Sariel; Jones, Mitchell.

35th International Symposium on Computational Geometry, SoCG 2019. ed. / Gill Barequet; Yusu Wang. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2019. 41 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 129).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Har-Peled, S & Jones, M 2019, Journey to the center of the point set. in G Barequet & Y Wang (eds), 35th International Symposium on Computational Geometry, SoCG 2019., 41, Leibniz International Proceedings in Informatics, LIPIcs, vol. 129, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 35th International Symposium on Computational Geometry, SoCG 2019, Portland, United States, 6/18/19. https://doi.org/10.4230/LIPIcs.SoCG.2019.41
Har-Peled S, Jones M. Journey to the center of the point set. In Barequet G, Wang Y, editors, 35th International Symposium on Computational Geometry, SoCG 2019. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2019. 41. (Leibniz International Proceedings in Informatics, LIPIcs). https://doi.org/10.4230/LIPIcs.SoCG.2019.41
Har-Peled, Sariel ; Jones, Mitchell. / Journey to the center of the point set. 35th International Symposium on Computational Geometry, SoCG 2019. editor / Gill Barequet ; Yusu Wang. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2019. (Leibniz International Proceedings in Informatics, LIPIcs).
@inproceedings{8aa12f1df747467ab58324b5fb6e7e42,
title = "Journey to the center of the point set",
abstract = "We revisit an algorithm of Clarkson et al. [1], that computes (roughly) a 1/(4d2)-centerpoint in {\~O}(d9) time, for a point set in ℝd, where {\~O} hides polylogarithmic terms. We present an improved algorithm that computes (roughly) a 1/d2-centerpoint with running time {\~O}(d7). While the improvements are (arguably) mild, it is the first progress on this well known problem in over twenty years. The new algorithm is simpler, and the running time bound follows by a simple random walk argument, which we believe to be of independent interest. We also present several new applications of the improved centerpoint algorithm.",
keywords = "Centerpoints, Computational geometry, Random walks",
author = "Sariel Har-Peled and Mitchell Jones",
year = "2019",
month = "6",
day = "1",
doi = "10.4230/LIPIcs.SoCG.2019.41",
language = "English (US)",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Gill Barequet and Yusu Wang",
booktitle = "35th International Symposium on Computational Geometry, SoCG 2019",

}

TY - GEN

T1 - Journey to the center of the point set

AU - Har-Peled, Sariel

AU - Jones, Mitchell

PY - 2019/6/1

Y1 - 2019/6/1

N2 - We revisit an algorithm of Clarkson et al. [1], that computes (roughly) a 1/(4d2)-centerpoint in Õ(d9) time, for a point set in ℝd, where Õ hides polylogarithmic terms. We present an improved algorithm that computes (roughly) a 1/d2-centerpoint with running time Õ(d7). While the improvements are (arguably) mild, it is the first progress on this well known problem in over twenty years. The new algorithm is simpler, and the running time bound follows by a simple random walk argument, which we believe to be of independent interest. We also present several new applications of the improved centerpoint algorithm.

AB - We revisit an algorithm of Clarkson et al. [1], that computes (roughly) a 1/(4d2)-centerpoint in Õ(d9) time, for a point set in ℝd, where Õ hides polylogarithmic terms. We present an improved algorithm that computes (roughly) a 1/d2-centerpoint with running time Õ(d7). While the improvements are (arguably) mild, it is the first progress on this well known problem in over twenty years. The new algorithm is simpler, and the running time bound follows by a simple random walk argument, which we believe to be of independent interest. We also present several new applications of the improved centerpoint algorithm.

KW - Centerpoints

KW - Computational geometry

KW - Random walks

UR - http://www.scopus.com/inward/record.url?scp=85068081374&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85068081374&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.SoCG.2019.41

DO - 10.4230/LIPIcs.SoCG.2019.41

M3 - Conference contribution

AN - SCOPUS:85068081374

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - 35th International Symposium on Computational Geometry, SoCG 2019

A2 - Barequet, Gill

A2 - Wang, Yusu

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

ER -