All closest neighbors are proper Delaunay edges generalized, and its application to parallel algorithms.
Saved in:
| Title: | All closest neighbors are proper Delaunay edges generalized, and its application to parallel algorithms. |
|---|---|
| Authors: | Maus, Arne, arnem@ifi.uio.no, Drange, Jon Moen, jonmd@ifi.uio.no |
| Source: | Norsk Informatikkonferanse; Nov2010, p1-12, 12p |
| Database: | Applied Science & Technology Source |
Be the first to leave a comment!
