Title
An adapted version of the Bentley-Ottmann algorithm for invariants of plane curves singularities
Abstract
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.
Year
DOI
Venue
2011
10.1007/978-3-642-21931-3_10
ICCSA (3)
Keywords
Field
DocType
plane complex algebraic curve,three-dimensional graph,space algebraic curve,milnor number,alexander polynomial,plane curves singularity,bentley-ottmann algorithm,intersection point,space euclidean
Strength of a graph,Mathematical optimization,Combinatorics,Path (graph theory),Algebraic curve,Plane curve,Algebraic graph theory,Mathematics,Planar graph,Complement graph,Topological graph
Conference
Volume
ISSN
Citations 
6784
0302-9743
3
PageRank 
References 
Authors
0.42
5
3
Name
Order
Citations
PageRank
Mădălina Hodorog1193.43
Bernard Mourrain21074113.70
Josef Schicho312121.43