The Newton–Puiseux Algorithm and Triple Points for Plane Curves

Abstract

The paper is an introduction to the use of the classical Newton–Puiseux procedure, oriented towards an algorithmic description of it. This procedure allows to obtain polynomial approximations for parameterizations of branches of an algebraic plane curve at a singular point. We look for an approach that can be easily grasped and is almost self-contained. We illustrate the use of the algorithm first in a completely worked out example of a curve with a point of multiplicity 6, and secondly, in the study of triple points on reduced plane curves.