Computing real inflection points of cubic algebraic curves Original Research Article

Shape modeling using planar cubic algebraic curves calls for computing the real inflection points of these curves since inflection points represents important shape feature. A real inflection point is also required for transforming projectively a planar cubic algebraic curve to the normal form, in order to facilitate further analysis of the curve. However, the naive method for computing the inflection points of a planar cubic algebraic curve f=0 by directly intersecting f=0 and its Hessian curve H(f)=0 requires solving a degree nine univariate polynomial equation, and thus is relatively inefficient. In this paper we present an algorithm for computing the real inflection points of a real planar cubic algebraic curve. The algorithm follows Hilbertʹs solution for computing the inflection points of a cubic algebraic curve in the complex projective plane. Hilbertʹs solution is based on invariant theory and requires solving only a quartic polynomial equation and several cubic polynomial equations. Through a detailed study with emphasis on the distinction between real and imaginary inflection points, we adapt Hilbertʹs solution to efficiently compute only the real inflection points of a cubic algebraic curve f=0, without exhaustive but unnecessary search and root testing. To compute the real inflection points of f=0, only two cubic polynomial equations need to be solved in our algorithm and it is unnecessary to solve numerically the quartic equation prescribed in Hilbertʹs solution. In addition, the invariants of f=0 are used to analyze the singularity of a singular curve, since the number of the real inflection points of f=0 depends on its singularity type.