2019
DOI: 10.48550/arxiv.1901.01870
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Coresets for $(k,l)$-Clustering under the Fréchet Distance

Abstract: Clustering is the task of partitioning a given set of geometric objects. This is thoroughly studied when the objects are points in the euclidean space. There are also several approaches for points in general metric spaces. In this thesis we consider clustering polygonal curves, i.e., curves composed of line segments, under the Fréchet distance. We obtain clusterings by minimizing an objective function, which yields a set of centers that induces a partition of the input.The objective functions we consider is th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 28 publications
(44 reference statements)
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?