Subquadratic algorithms for some 3SUM-hard geometric problems in the algebraic decision-tree model

Boris Aronov; Mark de Berg; Jean Cardinal; Esther Ezra; John Iacono; Micha Sharir

doi:10.1016/j.comgeo.2022.101945

Subquadratic algorithms for some 3SUM-hard geometric problems in the algebraic decision-tree model

Boris Aronov, Mark de Berg (Corresponding author), Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir

Research output: Contribution to journal › Article › Academic › peer-review

4 Citations (Scopus)

136 Downloads (Pure)

Abstract

We present subquadratic algorithms in the algebraic decision-tree model for several 3SUM-hard geometric problems, all of which can be reduced to the following question: Given two sets A, B, each consisting of n pairwise disjoint segments in the plane, and a set C of n triangles in the plane, we want to count, for each triangle Δ∈C, the number of intersection points between the segments of A and those of B that lie in Δ. We present solutions in the algebraic decision-tree model whose cost is O(n^60/31+ε), for any ε>0. Our approach is based on a primal-dual range searching mechanism, which exploits the multi-level polynomial partitioning machinery recently developed by Agarwal et al. (2021) [3]. A key step in the procedure is a variant of point location in arrangements, say of lines in the plane, which is based solely on the order type of the lines, a “handicap” that turns out to be beneficial for speeding up our algorithm.

Original language	English
Article number	101945
Number of pages	21
Journal	Computational Geometry
Volume	109
DOIs	https://doi.org/10.1016/j.comgeo.2022.101945
Publication status	Published - Feb 2023

Funding

Work by B.A. was partially supported by NSF grants CCF-15-40656 and CCF-20-08551 , and by grant 2014/170 from the U.S-Israel Binational Science Foundation . Work by M.d.B. was partially supported by the Dutch Research Council (NWO) through Gravitation Grant NETWORKS (project no. 024.002.003 ). Work by J.C. was partially supported by the F.R.S.-FNRS ( Fonds National de la Recherche Scientifique ) under CDR Grant J.0146.18 . Work by E.E. was partially supported by NSF CAREER under grant CCF:AF-1553354 and by grant 824/17 from the Israel Science Foundation . Work by J.I. was partially supported by Fonds de la Recherche Scientifique FNRS under grant no. MISU F 6001 1 . Work by M.S. was partially supported by ISF grant 260/18 , by grant 1367/2016 from the German-Israeli Science Foundation ( GIF ), and by Blavatnik Research Fund in Computer Science at Tel Aviv University.

Funders	Funder number
National Science Foundation	CCF-20-08551, 2014/170, CCF-15-40656
Fonds De La Recherche Scientifique - FNRS	J.0146.18, 824/17, AF-1553354
Nederlandse Organisatie voor Wetenschappelijk Onderzoek	024.002.003
Israel Science Foundation	1367/2016, 260/18
Tel Aviv University

Keywords

3SUM-hard problems
Algebraic decision-tree model
Order type
Point location
Polynomial partitions

Access to Document

10.1016/j.comgeo.2022.101945

pdfFinal published version, 670 KBLicence: CC BY

Cite this

@article{64a4fab0b058425b8dea86f653f4ccce,

title = "Subquadratic algorithms for some 3SUM-hard geometric problems in the algebraic decision-tree model",

abstract = "We present subquadratic algorithms in the algebraic decision-tree model for several 3SUM-hard geometric problems, all of which can be reduced to the following question: Given two sets A, B, each consisting of n pairwise disjoint segments in the plane, and a set C of n triangles in the plane, we want to count, for each triangle Δ∈C, the number of intersection points between the segments of A and those of B that lie in Δ. We present solutions in the algebraic decision-tree model whose cost is O(n60/31+ε), for any ε>0. Our approach is based on a primal-dual range searching mechanism, which exploits the multi-level polynomial partitioning machinery recently developed by Agarwal et al. (2021) [3]. A key step in the procedure is a variant of point location in arrangements, say of lines in the plane, which is based solely on the order type of the lines, a “handicap” that turns out to be beneficial for speeding up our algorithm.",

keywords = "3SUM-hard problems, Algebraic decision-tree model, Order type, Point location, Polynomial partitions",

author = "Boris Aronov and {de Berg}, Mark and Jean Cardinal and Esther Ezra and John Iacono and Micha Sharir",

year = "2023",

month = feb,

doi = "10.1016/j.comgeo.2022.101945",

language = "English",

volume = "109",

journal = "Computational Geometry",

issn = "0925-7721",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Subquadratic algorithms for some 3SUM-hard geometric problems in the algebraic decision-tree model

AU - Aronov, Boris

AU - de Berg, Mark

AU - Cardinal, Jean

AU - Ezra, Esther

AU - Iacono, John

AU - Sharir, Micha

PY - 2023/2

Y1 - 2023/2

N2 - We present subquadratic algorithms in the algebraic decision-tree model for several 3SUM-hard geometric problems, all of which can be reduced to the following question: Given two sets A, B, each consisting of n pairwise disjoint segments in the plane, and a set C of n triangles in the plane, we want to count, for each triangle Δ∈C, the number of intersection points between the segments of A and those of B that lie in Δ. We present solutions in the algebraic decision-tree model whose cost is O(n60/31+ε), for any ε>0. Our approach is based on a primal-dual range searching mechanism, which exploits the multi-level polynomial partitioning machinery recently developed by Agarwal et al. (2021) [3]. A key step in the procedure is a variant of point location in arrangements, say of lines in the plane, which is based solely on the order type of the lines, a “handicap” that turns out to be beneficial for speeding up our algorithm.

AB - We present subquadratic algorithms in the algebraic decision-tree model for several 3SUM-hard geometric problems, all of which can be reduced to the following question: Given two sets A, B, each consisting of n pairwise disjoint segments in the plane, and a set C of n triangles in the plane, we want to count, for each triangle Δ∈C, the number of intersection points between the segments of A and those of B that lie in Δ. We present solutions in the algebraic decision-tree model whose cost is O(n60/31+ε), for any ε>0. Our approach is based on a primal-dual range searching mechanism, which exploits the multi-level polynomial partitioning machinery recently developed by Agarwal et al. (2021) [3]. A key step in the procedure is a variant of point location in arrangements, say of lines in the plane, which is based solely on the order type of the lines, a “handicap” that turns out to be beneficial for speeding up our algorithm.

KW - 3SUM-hard problems

KW - Algebraic decision-tree model

KW - Order type

KW - Point location

KW - Polynomial partitions

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

U2 - 10.1016/j.comgeo.2022.101945

DO - 10.1016/j.comgeo.2022.101945

M3 - Article

SN - 0925-7721

VL - 109

JO - Computational Geometry

JF - Computational Geometry

M1 - 101945

ER -

Subquadratic algorithms for some 3SUM-hard geometric problems in the algebraic decision-tree model

Abstract

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this