Polygonal chain approximation: A query based approach (Q706723)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Polygonal chain approximation: A query based approach |
scientific article; zbMATH DE number 2132543
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polygonal chain approximation: A query based approach |
scientific article; zbMATH DE number 2132543 |
Statements
Polygonal chain approximation: A query based approach (English)
0 references
9 February 2005
0 references
The paper deals with the min-\# problem (given a polygonal path and a positive approximation error \(\epsilon\), find an \(\varepsilon\)-approximating path with the smallest number of vertices). A new query based approach is used for solving the problem with infinite beam criterion. A greedy heuristic is proposed to speed-up the computation. Finally comparison are done for three algorithms based on different approaches: iterative, breadth first traversal, respectively priority queues.
0 references
polygonal paths
0 references
approximate polygonal chains
0 references
computational geometry
0 references
min-\# problem
0 references
infinite beam criterion
0 references
0 references
0.9769077301025392
0 references
0.82671058177948
0 references
0.8267104625701904
0 references
