An On-Line Algorithm for Constructing Sweep Planes in Regular Position
CG '91 Proceedings of the International Workshop on Computational Geometry - Methods, Algorithms and Applications
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Computation of the topology of real algebraic space curves
Journal of Symbolic Computation
GENOM3CK: a library for genus computation of plane complex algebraic curves using knot theory
ACM Communications in Computer Algebra
A Symbolic-Numeric Algorithm for Computing the Alexander Polynomial of a Plane Curve Singularity
SYNASC '10 Proceedings of the 2010 12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
A regularization approach for estimating the type of a plane curve singularity
Theoretical Computer Science
Rational Hausdorff divisors: A new approach to the approximate parametrization of curves
Journal of Computational and Applied Mathematics
Hi-index | 0.00 |
We report on an adapted version of the Bentley-Ottmann algorithm for computing all the intersection points among the edges of the projection of a three-dimensional graph. This graph is given as a set of vertices together with their space Euclidean coordinates, and a set of edges connecting them. More precisely, the three-dimensional graph represents the approximation of a closed and smooth implicitly defined space algebraic curve, that allows us a simplified treatment of the events encountered in the Bentley-Ottmann algorithm. As applications, we use the adapted algorithm to compute invariants for each singularity of a plane complex algebraic curve, i.e. the Alexander polynomial, the Milnor number, the delta-invariant, etc.