Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour (Q3648777): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Jacques-Olivier Lachaud / rank
Normal rank
 
Property / author
 
Property / author: Jacques-Olivier Lachaud / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-04397-0_10 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1589343680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on minimal length polygonal approximation to a digitized contour / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-Perimeter Polygons of Digitized Silhouettes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140405 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3155868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On piecewise linear approximation of planar Jordan curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4475328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal shortest path queries in a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line construction of the convex hull of a simple polyline / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lyndon + Christoffel = digitally convex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4341774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certain words on the real projective line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics on Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorizing words over an ordered alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necklaces of beads in k colors and k-ary de Bruijn sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sturmian words, Lyndon words and trees / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:23, 2 July 2024

scientific article
Language Label Description Also known as
English
Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour
scientific article

    Statements

    Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour (English)
    0 references
    1 December 2009
    0 references
    0 references
    0 references