Testing congruence and symmetry for general 3-dimensional objects. (Q1421026): Difference between revisions

The problem of congruences and symmetry testing in 3-dimensional space is optimally solved only for (labelled) finite point sets and convex polytopes [see \textit{X. Jiang, K.Yu} and \textit{H. Bunke}, Visual Comput. 12, No. 4, 193--201(1996; Zbl 0846.68100); \textit{P. Brass} and \textit{C. Knauer}, Proceedings of the 18th European Workshop on Computational Geometry, Warszawa, Miedzeszyn, Poland (2002)]. The authors give an algorithm to test conguence or symmetry of a very general class of geometric objects in \(O (n \log n)\) time. In particular, it is shown that the algorithm can handle geometric objects in 3-space like Bézier curves and tensor product surfaces.