Methods for matching sets of 3D lines depend on whether line lengths are finite or infinite. In terms of line lengths, three basic cases arise in matching sets of lines: (1) finite to finite, (2) finite to infinite, and (3) infinite to infinite. For cases 1 and 2, which have not been treated in the literature, we present convergent iterative algorithms that (almost) always find the best match. For case 3, O.D. Faugeras and M. Hebert (FH) (1986) have proposed a popular iterative method that cannot be guaranteed to converge. We present an alternative approach that does converge. However, we also show that neither the FH solution, nor our solution is invariant with respect to coordinate transforms, which renders any best match meaningless. Thus, a satisfactory solution to case 3 does not yet exist. We discuss the underlying problem, which is the representation of infinite lines, and suggest alternatives that may lead to an invariant solution.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    An open problem in matching sets of 3D lines


    Contributors:


    Publication date :

    2001-01-01


    Size :

    712348 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    An Open Problem in Matching Sets of 3D Lines

    Kamgar-Parsi, B. / IEEE | British Library Conference Proceedings | 2001


    An Invariant, Closed-Form Solution for Matching Sets of 3D Lines

    Kamgar-Parsi, B. / IEEE Computer Society | British Library Conference Proceedings | 2004


    An invariant, closed-form solution for matching sets of 3D lines

    Kamgar-Parsi, B. / Kamgar-Parsi, Be. | IEEE | 2004


    Affine Matching of Planar Sets

    Nagao, K. / Grimson, W. E. L. | British Library Online Contents | 1998


    Problem Sets

    Abzug, Malcolm J. | AIAA | 1998