✦ LIBER ✦

A fast Voronoi-diagram algorithm with quaternary tree bucketing

✍ Scribed by Takao Ohya; Masao Iri; Kazuo Murota

Book ID: 113162727
Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 374 KB
Volume: 18
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(84)90116-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Fast Robust Algorithm for Computing Di

A Fast Robust Algorithm for Computing Discrete Voronoi Diagrams

✍ Mirko Velić; Dave May; Louis Moresi 📂 Article 📅 2008 🏛 Springer Netherlands 🌐 English ⚖ 536 KB

A new fast algorithm for computing the d

A new fast algorithm for computing the distance between two disjoint convex polygons based on Voronoi diagram

✍ Cheng-lei Yang; Meng Qi; Xiang-xu Meng; Xue-qing Li; Jia-ye Wang 📂 Article 📅 2006 🏛 SP Zhejiang University Press 🌐 English ⚖ 376 KB

A new vibrational genetic algorithm enha

A new vibrational genetic algorithm enhanced with a Voronoi diagram for path planning of autonomous UAV

✍ Y. Volkan Pehlivanoglu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 875 KB

[Lecture Notes in Computer Science] Comp

[Lecture Notes in Computer Science] Computational Science — ICCS 2001 Volume 2073 || Robust and Fast Algorithm for a Circle Set Voronoi Diagram in a Plane

✍ Alexandrov, Vassil N.; Dongarra, Jack J.; Juliano, Benjoe A.; Renner, René S.; T 📂 Article 📅 2001 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 411 KB

Lncs Volumes 2073 And 2074 Contain The Proceedings Of The International Conference On Computational Science, Iccs 2001, Held In San Francisco, California, May 27-31, 2001. The Two Volumes Consist Of More Than 230 Contributed And Invited Papers That Reflect The Aims Of The Conference To Bring Togethe