with as few segments as possible.

Ian Anderson Donald A. Preece

Published in: Discret. Math. (2005)

Keyphrases

computational complexity
data sets
knowledge base
equal length
pairwise
line segments
polygonal approximation