Access Restriction

Author Agarwal, Pankaj K. ♦ Nevo, Eran ♦ Pach, Jnos ♦ Pinchasi, Rom ♦ Sharir, Micha ♦ Smorodinsky, Shakhar
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2004
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Arrangements ♦ Incidence problems ♦ Pseudo-circles
Abstract A collection of simple closed Jordan curves in the plane is called a family of $\textit{pseudo-circles}$ if any two of its members intersect at most twice. A closed curve composed of two subarcs of distinct pseudo-circles is said to be an empty lens if the closed Jordan region that it bounds does not intersect any other member of the family. We establish a linear upper bound on the number of empty lenses in an arrangement of $\textit{n}$ pseudo-circles with the property that any two curves intersect precisely twice. We use this bound to show that any collection of $\textit{n}$ $\textit{x}-monotone$ pseudo-circles can be cut into $O(n^{8/5})$ arcs so that any two intersect at most once; this improves a previous bound of $O(n^{5/3})$ due to Tamaki and Tokuyama. If, in addition, the given collection admits an algebraic representation by three real parameters that satisfies some simple conditions, then the number of cuts can be further reduced to $O(n^{3/2}(log$ $n)^{O(α(^{s}(n))}),$ where $α(\textit{n})$ is the inverse Ackermann function, and $\textit{s}$ is a constant that depends on the the representation of the pseudo-circles. For arbitrary collections of pseudo-circles, any two of which intersect exactly twice, the number of necessary cuts reduces still further to $O(n^{4/3}).$ As applications, we obtain improved bounds for the number of incidences, the complexity of a single level, and the complexity of many faces in arrangements of circles, of pairwise intersecting pseudo-circles, of arbitrary $\textit{x}-monotone$ pseudo-circles, of parabolas, and of homothetic copies of any fixed simply shaped convex curve. We also obtain a variant of the Gallai--Sylvester theorem for arrangements of pairwise intersecting pseudo-circles, and a new lower bound on the number of distinct distances under any well-behaved norm.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2004-03-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 51
Issue Number 2
Page Count 48
Starting Page 139
Ending Page 186

Open content in new tab

   Open content in new tab
Source: ACM Digital Library