On Computing a Set of Points Meeting Every Cell Defined by a Family of Polynomials on a Variety

@article{Basu1997OnCA,
  title={On Computing a Set of Points Meeting Every Cell Defined by a Family of Polynomials on a Variety},
  author={Saugata Basu and Richard Pollack and Marie-Françoise Roy},
  journal={J. Complex.},
  year={1997},
  volume={13},
  pages={28-37}
}
IRMAR (URA CNRS 305), Universit´e de Rennes, Campus de Beaulieu 35042 Rennes cedex, FranceReceived August 1, 1996We consider a family of s polynomials, P = f P ; ... ;P g;in k variables withcoefficients in a real closed field R; each of degree at most d; and an algebraic varietyV of real dimension k which is defined as the zero set of a polynomial Q of degreeat most d . The number of semi-algebraically connected components of all non-emptysign conditions on P over V is bounded by s ( O ( d )) . In… 
COMPUTING ROADMAPS OF SEMI-ALGEBRAIC SETS ON A VARIETY
Let R be a real closed field, Z(Q) a real algebraic variety defined as the zero set of a polynomial Q ∈ R[X1, . . . , Xk] and S a semi-algebraic subset of Z(Q), defined by a Boolean formula with
Computing the euler–poincaré characteristics of sign conditions
TLDR
A new, improved algorithm for computing the Euler–Poincaré characteristic of the realization of each realizable sign condition of a family of polynomials restricted to a real variety is described and it is shown that any locally closed semi-algebraic set can be computed with the same complexity.
Complexity of computing semi-algebraic descriptions of the connected components of a semi-algebraic set
TLDR
This improves the previously best known bound of (sd) O(1) for this problem due to Canny, Grigor'ev, Vorobjov and Heintz, Roy and Solern o.
Efficient computation of a semi-algebraic basis of the first homology group of a semi-algebraic set
TLDR
An algorithm for computing a semi-algebraic basis for the first homology group, H1(S,F), with coefficients in a field F, of any given semi- algebraic set S ⊂ R defined by a closed formula is given, which generalizes well known algorithms having singly exponential complexity.
On a real analog of Bezout inequality and the number of connected components of sign conditions
Let R be a real closed field and Q1,…,Qℓ∈R[X1,…,Xk] such that for each i,1⩽i⩽ℓ , deg(Qi)⩽di . For 1⩽i⩽ℓ , denote by Qi={Q1,…,Qi} , Vi the real variety defined by Qi , and ki an upper bound on the
A near-linear algorithm for projective clustering integer points
TLDR
The main result is a randomized algorithm that for any e > 0 runs in time O(mn polylog(mn)) and outputs a solution that with high probability is within (1 + e) of the optimal solution.
Convex transversals
Computing Largest Common Point Sets under Approximate Congruence
TLDR
The problem of computing a largest common point set between two point sets under Ɛ-congruence with the bottleneck matching metric can be solved under a rational arithmetic model in a straightforward manner if the set of transformations is extended to general affine transformations under the L∞-norm.
Some quantitative results in real algebraic geometry
Real algebraic geometry is the study of semi-algebraic sets, subsets of $\R^k$ defined by Boolean combinations of polynomial equalities and inequalities. The focus of this thesis is to study
Deformation Techniques for Efficient Polynomial Equation Solving
TLDR
It is shown that it is possible to “move” the given particular solution along the parameter space in order to reconstruct—by means of an arithmetic circuit—the coordinates of the solutions of the system for an arbitrary parameter instance.
...
...

References

SHOWING 1-10 OF 16 REFERENCES
A New Algorithm to Find a Point in Every Cell Defined by a Family of Polynomials
TLDR
A new algorithm is presented which computes a point in each connected component of each non-empty sign condition over P1,…,P s which is nearly optimal in the sense that the size of the output can be as large as s(O(sd/k) k .
On the number of cells defined by a family of polynomials on a variety
Let R be a real closed field and a variety of real dimension k ′ which is the zero set of a polynomial Q ∈ R [ X 1 ,…, X k ] of degree at most d . Given a family of s polynomials = { P 1 ,…, P s }⊂ R
On the Combinatorial and Algebraic Complexity of Quantifier Elimination
TLDR
An improved bound on the radius of a ball centered at the origin, which is guaranteed to intersect every connected component of the sign partition induced by a family of polynomials is given.
Algebraic curves
TLDR
All singularities are analyzed cOITectly and the methods presented find application in solid modeling and robotics.
On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I
TLDR
The objective of this study was to demonstrate the ability of the H2O2 “spatially aggregates” to be modelled on the surface of the EMT molecule and show the property of both EMT and “navel-gauging”.
The complexity of elementary algebra and geometry
Abstract The theory of real closed fields can be decided in exponential space or parallel exponential time. In fixed dimension, the theory can be decided in NC .
Géométrie algébrique réelle
G ́ eométrie algébrique r éelle,
  • 1987
...
...