Efficient algorithms for 3-D polygonal approximation based on LISE criterion (Q1860236): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0031-3203(01)00226-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2039228183 / rank | |||
Normal rank | |||
Latest revision as of 12:12, 30 July 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
0 references
