Largest bounding box, smallest diameter, and related problems on imprecise points (Q2269143): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 06:31, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Largest bounding box, smallest diameter, and related problems on imprecise points |
scientific article |
Statements
Largest bounding box, smallest diameter, and related problems on imprecise points (English)
0 references
16 March 2010
0 references
By modeling ``imprecise points'' by regions, the authors study extremal values of various basic geometric measures on point sets such as the diameter, width, closest pair, smallest enclosing circle and smallest enclosing bounding box. Efficient algorithms for most of these problems are given.
0 references
bounding box
0 references
smallest enclosing circle
0 references
diameter
0 references
width
0 references
data imprecision
0 references
geometric measures on point sets
0 references
algorithms
0 references
