Speeding up simplification of polygonal curves using nested approximations (Q710621): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4412272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218406 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving fitting quality of polygonal approximation by using the dynamic programming technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Segmentation of Discrete Curves into Fuzzy Segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3805737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduced-search dynamic programming for approximation of polygonal curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum polygonal approximation of digitized curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming algorithm optimization for spoken word recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the optimal polygonal approximation of digitized curves / 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

Revision as of 08:15, 3 July 2024

scientific article
Language Label Description Also known as
English
Speeding up simplification of polygonal curves using nested approximations
scientific article

    Statements

    Identifiers