Algorithms for the shape of semialgebraic sets. A new approach
[For the entire collection see Zbl 0758.00016.] This paper is a very interesting contribution to the study of an important algorithm problem which is to determine the shape of a semi- algebraic set from its syntactical description. While theoretically the problem has been already affirmatively solved and general algorithms for it are designed, the need for more efficient methods for curves and surfaces is clear. The classical approach is based on elimination theory (resultants and Sturm sequence). A very efficient implementation of this approach has been performed recently by \textit{H. Hong} in RISC (Research Institut for Symbolic Computation), Linz, for curves. -- The authors suggest to ``eliminate elimination in the sense that rather than computing discriminants, they prefer to compute Gröbner bases of critical points. The paper ends by some very interesting examples. I must remark, though, that the comparison with the elimination method is slightly biased and that if one replaces Sturm sequence by Sturm-Habicht sequences and lexicographical Gröbner bases by Chow forms (also called \(u\) resultant) the advantage of computations proposed by the authors is not as obvious as it seems in the paper.
- An efficient method for analyzing the topology of plane real algebraic curves.
- Efficient topology determination of implicitly defined algebraic plane curves.
- Algorithms to compute the topology of orientable real algebraic surfaces
- Computing with semi-algebraic sets: relaxation techniques and effective boundaries
- Computing the topology of a real algebraic plane curve whose defining equations are available only ``by values
- Determination of the tangents for a real plane algebraic curve
- Evaluating the boundary and covering degree of planar Minkowski sums and other geometrical convolutions
- Topology of real algebraic space curves
- Boundary evaluation algorithms for Minkowski combinations of complex sets using topological analysis of implicit curves
- Computation with semialgebraic sets represented by cylindrical algebraic formulas
- Semialgebraic Range Reporting and Emptiness Searching with Applications
- Guaranteed consistency of surface intersections and trimmed surfaces using a coupled topology resolution and domain decomposition scheme
This page was built for publication: Algorithms for the shape of semialgebraic sets. A new approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4038735)