Fast computation of smallest enclosing circle with center on a query line segment (Q975487): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:48, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast computation of smallest enclosing circle with center on a query line segment |
scientific article |
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
