319 research outputs found
On Range Searching with Semialgebraic Sets II
Let be a set of points in . We present a linear-size data
structure for answering range queries on with constant-complexity
semialgebraic sets as ranges, in time close to . It essentially
matches the performance of similar structures for simplex range searching, and,
for , significantly improves earlier solutions by the first two authors
obtained in~1994. This almost settles a long-standing open problem in range
searching.
The data structure is based on the polynomial-partitioning technique of Guth
and Katz [arXiv:1011.4105], which shows that for a parameter , , there exists a -variate polynomial of degree such that
each connected component of contains at most points
of , where is the zero set of . We present an efficient randomized
algorithm for computing such a polynomial partition, which is of independent
interest and is likely to have additional applications
On the Number of Zeros of Abelian Integrals: A Constructive Solution of the Infinitesimal Hilbert Sixteenth Problem
We prove that the number of limit cycles generated by a small
non-conservative perturbation of a Hamiltonian polynomial vector field on the
plane, is bounded by a double exponential of the degree of the fields. This
solves the long-standing tangential Hilbert 16th problem. The proof uses only
the fact that Abelian integrals of a given degree are horizontal sections of a
regular flat meromorphic connection (Gauss-Manin connection) with a
quasiunipotent monodromy group.Comment: Final revisio
Computing the First Few Betti Numbers of Semi-algebraic Sets in Single Exponential Time
In this paper we describe an algorithm that takes as input a description of a
semi-algebraic set , defined by a Boolean formula with atoms of
the form for
and outputs the first Betti numbers of ,
The complexity of the algorithm is where where s =
#({\mathcal P}) and which is
singly exponential in for any fixed constant. Previously, singly
exponential time algorithms were known only for computing the Euler-Poincar\'e
characteristic, the zero-th and the first Betti numbers
On the complexity of range searching among curves
Modern tracking technology has made the collection of large numbers of
densely sampled trajectories of moving objects widely available. We consider a
fundamental problem encountered when analysing such data: Given polygonal
curves in , preprocess into a data structure that answers
queries with a query curve and radius for the curves of that
have \Frechet distance at most to .
We initiate a comprehensive analysis of the space/query-time trade-off for
this data structuring problem. Our lower bounds imply that any data structure
in the pointer model model that achieves query time, where is
the output size, has to use roughly space in
the worst case, even if queries are mere points (for the discrete \Frechet
distance) or line segments (for the continuous \Frechet distance). More
importantly, we show that more complex queries and input curves lead to
additional logarithmic factors in the lower bound. Roughly speaking, the number
of logarithmic factors added is linear in the number of edges added to the
query and input curve complexity. This means that the space/query time
trade-off worsens by an exponential factor of input and query complexity. This
behaviour addresses an open question in the range searching literature: whether
it is possible to avoid the additional logarithmic factors in the space and
query time of a multilevel partition tree. We answer this question negatively.
On the positive side, we show we can build data structures for the \Frechet
distance by using semialgebraic range searching. Our solution for the discrete
\Frechet distance is in line with the lower bound, as the number of levels in
the data structure is , where denotes the maximal number of vertices
of a curve. For the continuous \Frechet distance, the number of levels
increases to
- …