The equipartition of curves

Authors:
Costas Panagiotakis;Konstantin Athanassopoulos;Georgios Tziritas
Affiliations:
Computer Science Department, University of Crete, GR-71409 Iraklion, Greece;Department of Mathematics, University of Crete, GR-71409 Iraklion, Greece;Computer Science Department, University of Crete, GR-71409 Iraklion, Greece
Venue:
Computational Geometry: Theory and Applications
Year:
2009

Citing 6
Cited 0

Optimum polygonal approximation of digitized curves

Pattern Recognition Letters
Any dimension polygonal approximation based on equal errors principle

Pattern Recognition Letters
High order approximation of rational curves by polynomial curves

Computer Aided Geometric Design
Equivalent key frames selection based on iso-content principles

IEEE Transactions on Circuits and Systems for Video Technology
Path planning for deformable linear objects

IEEE Transactions on Robotics
MINMAX optimal video summarization

IEEE Transactions on Circuits and Systems for Video Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we analyze the problem of partitioning a continuous curve into n parts with equal successive chords, the curve EquiPartition problem (EP). The goal is to locate n-1 consecutive curve points, so that the curve can be divided into n segments with equal chords under a distance function. We adopt a level set approach to prove that for any continuous injective curve in a metric space and any number n there always exists at least one n-equipartition (EP). A new approximate algorithm, that is the first EP algorithm, inspired from the level set approach is proposed for finding all solutions with high accuracy. Finally, EP based applications are presented and special properties of their solutions are discussed.