Curve reconstruction from noisy samples (Q1775779): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Traveling Salesman-Based Curve Reconstruction in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for ordering unorganized points along parametrized curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provable surface reconstruction from noisy samples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252396 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Curve reconstruction: Connecting dots with good reason / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing curves with sharp corners / rank
 
Normal rank
Property / cites work
 
Property / cites work: FAST RECONSTRUCTION OF CURVES WITH SHARP CORNERS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic methods for algorithmic discrete mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Curve reconstruction, the Traveling Salesman Problem, and Menger's theorem on length / rank
 
Normal rank
Property / cites work
 
Property / cites work: A one-step crust and skeleton extraction algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Curve reconstruction from unorganized points / rank
 
Normal rank
Property / cites work
 
Property / cites work: The approximation power of moving least-squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rotational and helical surface approximation for reverse engineering / rank
 
Normal rank

Latest revision as of 10:54, 10 June 2024

scientific article
Language Label Description Also known as
English
Curve reconstruction from noisy samples
scientific article

    Statements

    Curve reconstruction from noisy samples (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    4 May 2005
    0 references
    The paper presents a new algorithm to reconstruct a collection of disjoint smooth closed curves from noisy samples. A probabilistic model of noisy samples is proposed. Moreover it is proved that the reconstruction is faithful with probability close to 1 as the number of samples increases. The problem of reconstructing surfaces from noisy samples is also discussed.
    0 references
    0 references
    0 references
    curve reconstruction
    0 references
    probabilistic analysis
    0 references
    computational geometry
    0 references
    algorithm
    0 references
    0 references
    0 references