Finding breaking curves in 3D surfaces

Xavier Orriols, Xavier Binefa

    Producció científica: Contribució a revistaArticleRecercaAvaluat per experts

    7 Cites (Scopus)

    Resum

    In this paper we present a recursive least squares technique for extracting the breaking curve of a 3D range open surface. Unlike differential operators-based methods, the algorithm we propose is robust to noise and is applied to unorganized point sets. No assumptions such as smoothness and/or continuity on the boundary's shape are performed. The method we present deals with large amount of data under a low computational cost, since no local computation is performed. A global approach is given to the technique in order to make it more robust, faster and simpler than individual point plus neighbours approaches. © Springer-Verlag Berlin Heidelberg 2003.
    Idioma originalAnglès
    Pàgines (de-a)681-688
    RevistaLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volum2652
    Estat de la publicacióPublicada - 1 de des. 2003

    Fingerprint

    Navegar pels temes de recerca de 'Finding breaking curves in 3D surfaces'. Junts formen un fingerprint únic.

    Com citar-ho