Fast computation of smallest enclosing circle with center on a query line segment (Q975487)
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: Fast computation of smallest enclosing circle with center on a query line segment |
scientific article; zbMATH DE number 5719210
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast computation of smallest enclosing circle with center on a query line segment |
scientific article; zbMATH DE number 5719210 |
Statements
Fast computation of smallest enclosing circle with center on a query line segment (English)
0 references
9 June 2010
0 references
1-center problem
0 references
furthest point Voronoi diagram
0 references
geometric duality
0 references
computational geometry
0 references
algorithms
0 references
