15,176 research outputs found
Topology of 2D and 3D Rational Curves
In this paper we present algorithms for computing the topology of planar and
space rational curves defined by a parametrization. The algorithms given here
work directly with the parametrization of the curve, and do not require to
compute or use the implicit equation of the curve (in the case of planar
curves) or of any projection (in the case of space curves). Moreover, these
algorithms have been implemented in Maple; the examples considered and the
timings obtained show good performance skills.Comment: 26 pages, 19 figure
Formalized proof, computation, and the construction problem in algebraic geometry
An informal discussion of how the construction problem in algebraic geometry
motivates the search for formal proof methods. Also includes a brief discussion
of my own progress up to now, which concerns the formalization of category
theory within a ZFC-like environment
Computing the First Betti Numberand Describing the Connected Components of Semi-algebraic Sets
In this paper we describe a singly exponential algorithm for computing the
first Betti number of a given semi-algebraic set. Singly exponential algorithms
for computing the zero-th Betti number, and the Euler-Poincar\'e
characteristic, were known before. No singly exponential algorithm was known
for computing any of the individual Betti numbers other than the zero-th one.
We also give algorithms for obtaining semi-algebraic descriptions of the
semi-algebraically connected components of any given real algebraic or
semi-algebraic set in single-exponential time improving on previous results
- …