A new fast algorithm for computing the distance between two disjoint convex polygons based on Voronoi diagram (Q863827)
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 5120865
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new fast algorithm for computing the distance between two disjoint convex polygons based on Voronoi diagram |
scientific article; zbMATH DE number 5120865 |
Statements
A new fast algorithm for computing the distance between two disjoint convex polygons based on Voronoi diagram (English)
0 references
2 February 2007
0 references
Computational geometry
0 references
Polygon
0 references
Voronoi diagram
0 references
Distance computation
0 references
0.8485483527183533
0 references
0.8174612522125244
0 references
0.8080852031707764
0 references
0.8015522360801697
0 references
