A method of curve partitioning using arc-chord distance

Abstract Several authors have studied methods of curve partitioning based on selecting points at which the distance of the curve from its chord(s) is a local maximum. This note presents a modified method of this type that seems to yield generally reasonable results. The problem of selecting appropriate arc lengths in methods of this type is also briefly discussed.