Constructive implicit fitting (Q2581842): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Higher-order interpolation and least-squares approximation using implicit algebraic surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spline approximations of real algebraic surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple constrained deformations for geometric modeling and interactive design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-dimensional alpha shapes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4494289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The displacement method for implicit blending surfaces in solid models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real functions for representation of rigid solids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized families of polynomials for bounded algebraic curve and surface fitting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blending algebraic surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4320129 / rank
 
Normal rank

Latest revision as of 15:04, 11 June 2024

scientific article
Language Label Description Also known as
English
Constructive implicit fitting
scientific article

    Statements

    Constructive implicit fitting (English)
    0 references
    0 references
    10 January 2006
    0 references
    The authors derive a constructive method for fitting both an explicit and an implicit curve or surface to a set of scattered points. The data are first partitioned with geometric primitives into small data sets such that each sub-data set can be well fitted by a simple shape. These simple shapes are then blended to form an overall fitting for the given data. The method has the following features. (1) A preset accuracy can always be achieved if the data set is sufficiently finely partitioned. (2) A large data set can be dealt with as several small data sets, which can significantly reduce the complexity of the shape to be fitted. (3) The technique can be used to increase the fitting speed by using simple fitting techniques for each sub-data set. (4) The degree of smoothness of the fitted function can be adjusted to be as smooth as one wishes. (5) The fitting technique provides direct support for parallel computation in curve and surface fitting. When a large data set is partitioned into smaller data sets, these small data sets can then be fitted simultaneously over a parallel system.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    smooth unit step functions
    0 references
    curve fitting
    0 references
    surface fitting
    0 references
    implicit curves
    0 references
    implicit surfaces
    0 references
    parallel computation
    0 references
    0 references