Efficient algorithms for 3-D polygonal approximation based on LISE criterion (Q1860236): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3813185 / rank
 
Normal rank
Property / cites work
 
Property / cites work: APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218406 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiently approximating polygonal paths in three and higher dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fitting polygonal functions to a set of points in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3805737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum polygonal approximation of digitized curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: A non-parametric sequential method for polygonal approximation of digital curves / rank
 
Normal rank

Revision as of 13:05, 5 June 2024

scientific article
Language Label Description Also known as
English
Efficient algorithms for 3-D polygonal approximation based on LISE criterion
scientific article

    Statements

    Efficient algorithms for 3-D polygonal approximation based on LISE criterion (English)
    0 references
    0 references
    20 February 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    algorithms
    0 references
    dynamic programming
    0 references
    integral square error criterion
    0 references
    3-D polygonal approximation
    0 references
    sampling technique
    0 references
    shortest path
    0 references