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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.comgeo.2003.07.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2005741374 / rank
 
Normal rank

Revision as of 02:17, 20 March 2024

scientific article
Language Label Description Also known as
English
Testing congruence and symmetry for general 3-dimensional objects.
scientific article

    Statements

    Testing congruence and symmetry for general 3-dimensional objects. (English)
    0 references
    0 references
    0 references
    23 January 2004
    0 references
    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.
    0 references
    0 references
    0 references
    computational geometry
    0 references
    three dimensional congruence
    0 references
    symmetry
    0 references
    congruences and symmetry testing
    0 references
    algorithm
    0 references
    geometric objects
    0 references
    Bézier curves
    0 references
    tensor product surfaces
    0 references
    0 references