A novel superellipse segmentation of planar curves

Abstract

Superellipse is a flexible primitive and it can represent a large variety of shapes. This paper presents a novel superellipse segmentation of planar curves based on the types of breakpoints. In the proposed method, the breakpoints are divided into corners and smooth joints, and the types of the segments on both sides of a breakpoint are identified. Using these breakpoint types can effectively reduce the computational cost, and reserve the important features of planar curves. Tests show that the proposed method has a number of interesting properties including being scale invariant, threshold-free, and efficient.