Computing a minimum-width square annulus in arbitrary orientation (Q1705772)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6851118
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing a minimum-width square annulus in arbitrary orientation |
scientific article; zbMATH DE number 6851118 |
Statements
Computing a minimum-width square annulus in arbitrary orientation (English)
0 references
16 March 2018
0 references
In this paper the problem of computing a minimum-width square annulus in arbitrary orientation that encloses a given set of \(n\) points in the plane is addressed. A square annulus is the region between two concetric squares. In this paper an algorithm that finds such a square annulus over all orientations is presented. This algorithm works in \(O(n^{3} \log n)\) time.
0 references
computational geometry
0 references
covering problem
0 references
square annulus
0 references
arbitrary orientation
0 references
0 references
0 references
0 references
0.994305431842804
0 references
0.8904791474342346
0 references
0.8796830773353577
0 references
0.8702404499053955
0 references
