• Login
    View Item 
    •   Eurographics DL Home
    • Computer Graphics Forum
    • Volume 35 (2016)
    • 35-Issue 5
    • View Item
    •   Eurographics DL Home
    • Computer Graphics Forum
    • Volume 35 (2016)
    • 35-Issue 5
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Crawl through Neighbors: A Simple Curve Reconstruction Algorithm

    Thumbnail
    View/Open
    v35i5pp177-186.pdf (30.33Mb)
    Date
    2016
    Author
    Parakkat, Amal Dev
    Muthuganapathy, Ramanathan
    Pay-Per-View via TIB Hannover:

    Try if this item/paper is available.

    Metadata
    Show full item record
    Abstract
    Given a planar point set sampled from an object boundary, the process of approximating the original shape is called curve reconstruction. In this paper, a novel non-parametric curve reconstruction algorithm based on Delaunay triangulation has been proposed and it has been theoretically proved that the proposed method reconstructs the original curve under e-sampling. Starting from an initial Delaunay seed edge, the algorithm proceeds by finding an appropriate neighbouring point and adding an edge between them. Experimental results show that the proposed algorithm is capable of reconstructing curves with different features like sharp corners, outliers, multiple objects, objects with holes, etc. The proposed method also works for open curves. Based on a study by a few users, the paper also discusses an application of the proposed algorithm for reconstructing hand drawn skip stroke sketches, which will be useful in various sketch based interfaces.
    BibTeX
    @article {10.1111:cgf.12974,
    journal = {Computer Graphics Forum},
    title = {{Crawl through Neighbors: A Simple Curve Reconstruction Algorithm}},
    author = {Parakkat, Amal Dev and Muthuganapathy, Ramanathan},
    year = {2016},
    publisher = {The Eurographics Association and John Wiley & Sons Ltd.},
    ISSN = {1467-8659},
    DOI = {10.1111/cgf.12974}
    }
    URI
    http://dx.doi.org/10.1111/cgf.12974
    Collections
    • 35-Issue 5
    • SGP16: Eurographics Symposium on Geometry Processing (CGF 35-5)

    Eurographics Association copyright © 2013 - 2023 
    Send Feedback | Contact - Imprint | Data Privacy Policy | Disable Google Analytics
    Theme by @mire NV
    System hosted at  Graz University of Technology.
    TUGFhA
     

     

    Browse

    All of Eurographics DLCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    Statistics

    View Usage Statistics

    BibTeX | TOC

    Create BibTeX Create Table of Contents

    Eurographics Association copyright © 2013 - 2023 
    Send Feedback | Contact - Imprint | Data Privacy Policy | Disable Google Analytics
    Theme by @mire NV
    System hosted at  Graz University of Technology.
    TUGFhA