Curve Decimation in SE(2) and SE(3)

Authors: Jan Hakenberg

We generalize the Ramer-Douglas-Peucker algorithm to operate on a sequence of elements from a Lie group. As the original, the new algorithm bounds the approximation error, and has an expected runtime complexity of O(n log n). We apply the curve decimation to data recorded from a car-like robot in SE(2), as well as from a drone in SE(3). The results show that many samples of the original sequence can be dropped while maintaining a high-quality approximation to the original trajectory.

Comments: 9 Pages.

Download: PDF

Submission history

[v1] 2019-09-08 14:35:08

Unique-IP document downloads: 28 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus