3,476 research outputs found
An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications
In 2015, Guth proved that if S is a collection of n g-dimensional semi-algebraic sets in R^d and if D >= 1 is an integer, then there is a d-variate polynomial P of degree at most D so that each connected component of R^d Z(P) intersects O(n/D^{d-g}) sets from S. Such a polynomial is called a generalized partitioning polynomial. We present a randomized algorithm that computes such polynomials efficiently - the expected running time of our algorithm is linear in |S|. Our approach exploits the technique of quantifier elimination combined with that of epsilon-samples.
We present four applications of our result. The first is a data structure for answering point-enclosure queries among a family of semi-algebraic sets in R^d in O(log n) time, with storage complexity and expected preprocessing time of O(n^{d+epsilon}). The second is a data structure for answering range search queries with semi-algebraic ranges in O(log n) time, with O(n^{t+epsilon}) storage and expected preprocessing time, where t > 0 is an integer that depends on d and the description complexity of the ranges. The third is a data structure for answering vertical ray-shooting queries among semi-algebraic sets in R^{d} in O(log^2 n) time, with O(n^{d+epsilon}) storage and expected preprocessing time. The fourth is an efficient algorithm for cutting algebraic planar curves into pseudo-segments
Automated Generation of Geometric Theorems from Images of Diagrams
We propose an approach to generate geometric theorems from electronic images
of diagrams automatically. The approach makes use of techniques of Hough
transform to recognize geometric objects and their labels and of numeric
verification to mine basic geometric relations. Candidate propositions are
generated from the retrieved information by using six strategies and geometric
theorems are obtained from the candidates via algebraic computation.
Experiments with a preliminary implementation illustrate the effectiveness and
efficiency of the proposed approach for generating nontrivial theorems from
images of diagrams. This work demonstrates the feasibility of automated
discovery of profound geometric knowledge from simple image data and has
potential applications in geometric knowledge management and education.Comment: 31 pages. Submitted to Annals of Mathematics and Artificial
Intelligence (special issue on Geometric Reasoning
On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves
A long standing conjecture of Richter and Thomassen states that the total
number of intersection points between any simple closed Jordan curves in
the plane, so that any pair of them intersect and no three curves pass through
the same point, is at least .
We confirm the above conjecture in several important cases, including the
case (1) when all curves are convex, and (2) when the family of curves can be
partitioned into two equal classes such that each curve from the first class is
touching every curve from the second class. (Two curves are said to be touching
if they have precisely one point in common, at which they do not properly
cross.)
An important ingredient of our proofs is the following statement: Let be
a family of the graphs of continuous real functions defined on
, no three of which pass through the same point. If there are
pairs of touching curves in , then the number of crossing points is
.Comment: To appear in SODA 201
- …