Planar point sets determine many pairwise crossing segments

János Pach; Natan Rubin; Gábor Tardos

doi:10.1145/3313276.3316328

Planar point sets determine many pairwise crossing segments

János Pach
, Natan Rubin
, Gábor Tardos

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We show that any set of n points in general position in the plane determines n¹−o(1⁾ pairwise crossing segments. The best previously known lower bound, Ω n, was proved more than 25 years ago by Aronov, Erdős, Goddard, Kleitman, Klugerman, Pach, and Schulman. Our proof is fully constructive, and extends to dense geometric graphs.

Original language	English
Title of host publication	STOC 2019 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
Editors	Moses Charikar, Edith Cohen
Pages	1158-1166
Number of pages	9
ISBN (Electronic)	9781450367059
DOIs	https://doi.org/10.1145/3313276.3316328
State	Published - 23 Jun 2019
Event	51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019 - Phoenix, United States Duration: 23 Jun 2019 → 26 Jun 2019

Publication series

Name	Proceedings of the Annual ACM Symposium on Theory of Computing

Conference

Conference	51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019
Country/Territory	United States
City	Phoenix
Period	23/06/19 → 26/06/19

Keywords

Avoiding edges
Comparability graphs
Computational geometry
Crossing edges
Extremal combinatorics
Geometric graphs
Intersection graphs
Partial orders

ASJC Scopus subject areas

Software

Access to Document

10.1145/3313276.3316328

Cite this

@inproceedings{368e36959c024e71ab9b9d527d7d60c1,

title = "Planar point sets determine many pairwise crossing segments",

abstract = "We show that any set of n points in general position in the plane determines n1−o(1) pairwise crossing segments. The best previously known lower bound, Ω n, was proved more than 25 years ago by Aronov, Erd{\H o}s, Goddard, Kleitman, Klugerman, Pach, and Schulman. Our proof is fully constructive, and extends to dense geometric graphs.",

keywords = "Avoiding edges, Comparability graphs, Computational geometry, Crossing edges, Extremal combinatorics, Geometric graphs, Intersection graphs, Partial orders",

author = "J{\'a}nos Pach and Natan Rubin and G{\'a}bor Tardos",

note = "Publisher Copyright: {\textcopyright} 2019 Association for Computing Machinery.; 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019 ; Conference date: 23-06-2019 Through 26-06-2019",

year = "2019",

month = jun,

day = "23",

doi = "10.1145/3313276.3316328",

language = "English",

series = "Proceedings of the Annual ACM Symposium on Theory of Computing",

pages = "1158--1166",

editor = "Moses Charikar and Edith Cohen",

booktitle = "STOC 2019 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing",

}

Pach, J, Rubin, N & Tardos, G 2019, Planar point sets determine many pairwise crossing segments. in M Charikar & E Cohen (eds), STOC 2019 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. Proceedings of the Annual ACM Symposium on Theory of Computing, pp. 1158-1166, 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, United States, 23/06/19. https://doi.org/10.1145/3313276.3316328

Planar point sets determine many pairwise crossing segments. / Pach, János; Rubin, Natan; Tardos, Gábor.
STOC 2019 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. ed. / Moses Charikar; Edith Cohen. 2019. p. 1158-1166 (Proceedings of the Annual ACM Symposium on Theory of Computing).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Planar point sets determine many pairwise crossing segments

AU - Pach, János

AU - Rubin, Natan

AU - Tardos, Gábor

PY - 2019/6/23

Y1 - 2019/6/23

N2 - We show that any set of n points in general position in the plane determines n1−o(1) pairwise crossing segments. The best previously known lower bound, Ω n, was proved more than 25 years ago by Aronov, Erdős, Goddard, Kleitman, Klugerman, Pach, and Schulman. Our proof is fully constructive, and extends to dense geometric graphs.

AB - We show that any set of n points in general position in the plane determines n1−o(1) pairwise crossing segments. The best previously known lower bound, Ω n, was proved more than 25 years ago by Aronov, Erdős, Goddard, Kleitman, Klugerman, Pach, and Schulman. Our proof is fully constructive, and extends to dense geometric graphs.

KW - Avoiding edges

KW - Comparability graphs

KW - Computational geometry

KW - Crossing edges

KW - Extremal combinatorics

KW - Geometric graphs

KW - Intersection graphs

KW - Partial orders

UR - https://www.scopus.com/pages/publications/85068033615

U2 - 10.1145/3313276.3316328

DO - 10.1145/3313276.3316328

M3 - Conference contribution

T3 - Proceedings of the Annual ACM Symposium on Theory of Computing

SP - 1158

EP - 1166

BT - STOC 2019 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing

A2 - Charikar, Moses

A2 - Cohen, Edith

T2 - 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019

Y2 - 23 June 2019 through 26 June 2019

ER -

Planar point sets determine many pairwise crossing segments

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this