Polygonal path simplification with angle constraints (Q2571211)
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 path simplification with angle constraints |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polygonal path simplification with angle constraints |
scientific article |
Statements
Polygonal path simplification with angle constraints (English)
0 references
1 November 2005
0 references
The authors consider simplification problems in \(\mathbb R^2\) and \(\mathbb R^3\) for paths that have angle constraints. The resulting geometric algorithms run times that are nearly a linear factor better than graph-theoretic solutions that are based on known techniques; this leads to algorithms that match the running times for unconstrained problems. A key step in the solutions, the authors formulate and solve an offline ball exclusion search problem, which may be of interest in its own right.
0 references
path simplification
0 references
angle constraint
0 references
computational geometry
0 references
off-line search
0 references
