Authors: Jan Hakenberg
Comments: 9 Pages.
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
Authors: Yuly Shipilevsky
Comments: 1 Page.
We prove that in Cartesian Coordinate System,
the cosine of the angle between lines,
belonging to two coordinate planes and both lines go through the origin with the corresponding angles to the same common axis is equal to multiplication of cosines of these angles.