A Polyhedral Homotopy Algorithm For Real Zeros

We design a homotopy continuation algorithm, that is based on numerically tracking Viro's patchworking method, for finding real zeros of sparse polynomial systems. The algorithm is targeted for polynomial systems with coefficients satisfying certain concavity conditions. It operates entirely over the real numbers and tracks the optimal number of solution paths. In more technical terms; we design an algorithm that correctly counts and finds the real zeros of polynomial systems that are located in the unbounded components of the complement of the underlying A-discriminant amoeba.Comment: some cosmetic changes are done and a couple of typos are fixed to improve readability, mathematical contents remain unchange

Separation-Sensitive Collision Detection for Convex Objects

We develop a class of new kinetic data structures for collision detection between moving convex polytopes; the performance of these structures is sensitive to the separation of the polytopes during their motion. For two convex polygons in the plane, let $D$ be the maximum diameter of the polygons, and let $s$ be the minimum distance between them during their motion. Our separation certificate changes $O(\log(D/s))$ times when the relative motion of the two polygons is a translation along a straight line or convex curve, $O(\sqrt{D/s})$ for translation along an algebraic trajectory, and $O(D/s)$ for algebraic rigid motion (translation and rotation). Each certificate update is performed in $O(\log(D/s))$ time. Variants of these data structures are also shown that exhibit \emph{hysteresis}---after a separation certificate fails, the new certificate cannot fail again until the objects have moved by some constant fraction of their current separation. We can then bound the number of events by the combinatorial size of a certain cover of the motion path by balls.Comment: 10 pages, 8 figures; to appear in Proc. 10th Annual ACM-SIAM Symposium on Discrete Algorithms, 1999; see also http://www.uiuc.edu/ph/www/jeffe/pubs/kollide.html ; v2 replaces submission with camera-ready versio

On Range Searching with Semialgebraic Sets II

Let $P$ be a set of $n$ points in $\R^d$. We present a linear-size data structure for answering range queries on $P$ with constant-complexity semialgebraic sets as ranges, in time close to $O(n^{1-1/d})$. It essentially matches the performance of similar structures for simplex range searching, and, for $d\ge 5$, 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 $r$, $1 < r \le n$, there exists a $d$-variate polynomial $f$ of degree $O(r^{1/d})$ such that each connected component of $\R^d\setminus Z(f)$ contains at most $n/r$ points of $P$, where $Z(f)$ is the zero set of $f$. We present an efficient randomized algorithm for computing such a polynomial partition, which is of independent interest and is likely to have additional applications

The algebra of the box spline

In this paper we want to revisit results of Dahmen and Micchelli on box-splines which we reinterpret and make more precise. We compare these ideas with the work of Brion, Szenes, Vergne and others on polytopes and partition functions.Comment: 69 page

The length operator in Loop Quantum Gravity

The dual picture of quantum geometry provided by a spin network state is discussed. From this perspective, we introduce a new operator in Loop Quantum Gravity - the length operator. We describe its quantum geometrical meaning and derive some of its properties. In particular we show that the operator has a discrete spectrum and is diagonalized by appropriate superpositions of spin network states. A series of eigenstates and eigenvalues is presented and an explicit check of its semiclassical properties is discussed.Comment: 33 pages, 12 figures; NPB versio