On 3SUM-hard Problems in the Decision Tree Model

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We describe subquadratic algorithms, in the algebraic decision-tree model of computation, for detecting whether there exists a triple of points, belonging to three respective sets A, B, and C of points in the plane, that satisfy a pair of polynomial equations. In particular, this has an application to detect collinearity among three sets A, B, C of n points each, in the complex plane, when each of the sets A, B, C lies on some constant-degree algebraic curve. In another development, we present a subquadratic algorithm, in the algebraic decision-tree model, for the following problem: Given a pair of sets A, B each consisting of n pairwise disjoint line segments in the plane, and a third set C of arbitrary line segments in the plane, determine whether A× B× C contains a triple of concurrent segments. This is one of four 3sum-hard geometric problems recently studied by Chan (2020). The results reported in this extended abstract are based on the recent studies of the author with Aronov and Sharir (2020, 2021).

Original languageEnglish
Title of host publicationConnecting with Computability - 17th Conference on Computability in Europe, CiE 2021, Proceedings
EditorsLiesbeth De Mol, Andreas Weiermann, Florin Manea, David Fernández-Duque
PublisherSpringer Science and Business Media Deutschland GmbH
Pages178-188
Number of pages11
ISBN (Print)9783030800482
DOIs
StatePublished - 2021
Event17th Conference on Computability in Europe, CiE 2021 - Virtual, Online
Duration: 5 Jul 20219 Jul 2021

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12813 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference17th Conference on Computability in Europe, CiE 2021
CityVirtual, Online
Period5/07/219/07/21

Bibliographical note

Publisher Copyright:
© 2021, Springer Nature Switzerland AG.

Keywords

  • 3SUM-hard problems
  • Algebraic decision tree model
  • Collinearity testing
  • Segment concurrency

Fingerprint

Dive into the research topics of 'On 3SUM-hard Problems in the Decision Tree Model'. Together they form a unique fingerprint.

Cite this