Finding breaking curves in 3D surfaces

Xavier Orriols, Xavier Binefa

    Research output: Contribution to journalArticleResearchpeer-review

    5 Citations (Scopus)

    Abstract

    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.
    Original languageEnglish
    Pages (from-to)681-688
    JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume2652
    Publication statusPublished - 1 Dec 2003

    Fingerprint Dive into the research topics of 'Finding breaking curves in 3D surfaces'. Together they form a unique fingerprint.

    Cite this