Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour (Q3648777): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| 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 | |||
Revision as of 03:20, 20 March 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
