# Shape determination for real curves and surfaces

@article{Gianni1983ShapeDF, title={Shape determination for real curves and surfaces}, author={Patrizia M. Gianni and Carlo Traverso}, journal={Annali dell’Universit{\`a} di Ferrara}, year={1983}, volume={29}, pages={87-109} }

RiassuntoSi descrivono algoritmi per determinare la forma di una curva algebrica reale piana, e la topologia di una superficie reale inP3.La forma di una curvaC si ottiene proiettandoC suP1, ed esaminando la posizione relativa dei punti critici rispetto alle immagini inverse dei valori critici. La forma di una superficieS si ottiene esaminando la variazione della forma in un fascio di sezioni piane, e ricavandone l'omologia razionale delle componenti connesse diS.SummaryIn this paper we…

## 23 Citations

A BSP-based algorithm for dimensionally nonhomogeneous planar implicit curves with topological guarantees

- Computer Science, MathematicsTOGS
- 2009

The Generalized False Position (FP) method is generalized to determine two types of zeros: crossing zeros and extremal zeros (local minima and maxima without function sign variation).

A delineability-based method for computing critical sets of algebraic surfaces

- MathematicsJ. Symb. Comput.
- 2007

Computation of the Topology Types of the Level Curves of Real Algebraic Surfaces

- Mathematics, Computer Science
- 2006

This paper addresses the problem of determining the z-values where the topology type of the level curves of an algebraic surface may change, i.e. not necessarily bounded or smooth, by analyzing the real roots of a univariate polynomial.

Algorithms to compute the topology of orientable real algebraic surfaces

- MathematicsJ. Symb. Comput.
- 2003

Computing the topology of a real algebraic plane curve whose defining equations are available only "by values"

- Mathematics, Computer ScienceComput. Aided Geom. Des.
- 2013

The adjacency graph of a real algebraic surface

- Computer ScienceApplicable Algebra in Engineering, Communication and Computing
- 2005

An algorithm is presented that answers the question of recognizing the mutual positions of the connected components of a non-singularreal projective surface S in the real projective 3-space through the computation of the adjacency graph of the surface; it allows to decide whether each connected component is contractible or not.

Topology of 2D and 3D rational curves

- Computer Science, MathematicsComput. Aided Geom. Des.
- 2010

Se p 20 09 Topology of 2 D and 3 D Rational Curves

- Mathematics, Computer Science
- 2009

Algorithm for computing the topology of planar and space rational curves defined by a parametrization is presented, and these algorithms have been implemented in Maple.

Condition and homology in semialgebraic geometry

- Mathematics, Computer Science
- 2019

This PhD thesis shows how to obtain a numerical algorithm running in single exponential time with very high probability, which improves the state-of-the-art.

EFFECTIVE METHODS TO COMPUTE THE TOPOLOGY OF REAL ALGEBRAIC SURFACES WITH ISOLATED SINGULARITIES

- Mathematics
- 2005

Given a real algebraic surface S in 3 , we propose a constructive procedure to de- termine the topology of S and to compute non-trivial topological invariants for the pair ( 3 ;S) under the…

## References

SHOWING 1-5 OF 5 REFERENCES

THE TOPOLOGY OF REAL PROJECTIVE ALGEBRAIC VARIETIES

- Mathematics
- 1974

This article is a survey of the results on Hilbert's 16th problem from 1876 to the present. 1. HARNACK'S THEOREM. The number of branches of a non-singular curve of order m in RP2 does not exceed…

On Computing the Exact Determinant of Matrices with Polynomial Entries

- Computer ScienceJACM
- 1975

The problem of computing the determinant of a matrix of polynomials is considered. Four algorithms are comparedexpansion by minors, Gausslan elimination over the integers, a method based on…

Computing polynomial resultants: Bezout's determinant vs. Collins' reduced P.R.S. algorithm

- Computer ScienceCACM
- 1969

Detailed tests performed on sample problems conclusively show that Bezout's determinant is superior in all respects except for univariate polynomials, in which case Collins' reduced p.r.s. algorithm is somewhat faster.

Quantifier elimination for real closed fields by cylindrical algebraic decomposition

- Philosophy
- 1975

Tarski in 1948, ( Tarski 1951) published a quantifier elimination method for the elementary theory of real closed fields, which provides a decision method, which enables one to decide whether any sentence of the theory is true or false.

Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition

- Mathematics, Computer ScienceAutomata Theory and Formal Languages
- 1975