Efficient algorithms for 3-D polygonal approximation based on LISE criterion (Q1860236): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:23, 1 February 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
20 February 2003
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
