On the \(\mathcal{O}_\beta\)-hull of a planar point set (Q1699299)
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: On the O_-hull of a planar point set |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the \(\mathcal{O}_\beta\)-hull of a planar point set |
scientific article |
Statements
On the \(\mathcal{O}_\beta\)-hull of a planar point set (English)
0 references
19 February 2018
0 references
The authors present an algorithm to maintain the \(\mathcal{O}_\beta\)-hull of a planar point set while \(\beta\) runs from z to \(\pi\) and extend the result to solve related optimization problems. The values of \(\beta\) that maximize the area and the perimeter of \(\mathcal{O}_\beta H(P)\) are found. A variation of the 2-fitting problem is solved by fitting a two-joint not-necessarily orthogonal polygon chain to a point set.
0 references
restricted-orientation geometry
0 references
convex hull
0 references
area optimization
0 references
perimeter optimization
0 references
fitting
0 references
0.7769922614097595
0 references
0.7757143378257751
0 references
0.7419295310974121
0 references
0.7244191765785217
0 references
0.7206284403800964
0 references
