✦ LIBER ✦

[Lecture Notes in Computer Science] Algorithms and Data Structures Volume 4619 || Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points

✍ Scribed by Dehne, Frank; Sack, Jörg-Rüdiger; Zeh, Norbert

Book ID: 120640846
Publisher: Springer Berlin Heidelberg
Year: 2007
Tongue: German
Weight: 426 KB
Category: Article
ISBN: 3540739513
DOI: 10.1007/978-3-540-73951-7_39

No coin nor oath required. For personal study only.

✦ Synopsis

This Book Constitutes The Refereed Proceedings Of The 10th International Workshop On Algorithms And Data Structures, Wads 2007, Held In Halifax, Canada, In August 2007. The Papers Present Original Research On The Theory And Application Of Algorithms And Data Structures In All Areas, Including Combinatorics, Computational Geometry, Databases, Graphics, Parallel And Distributed Computing.

📜 SIMILAR VOLUMES

Largest bounding box, smallest diameter,

Largest bounding box, smallest diameter, and related problems on imprecise points

✍ Maarten Löffler; Marc van Kreveld 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 352 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Data Structures Volume 4619 || Optimal Algorithms for the Weighted p-Center Problems on the Real Line for Small p

✍ Dehne, Frank; Sack, Jörg-Rüdiger; Zeh, Norbert 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg ⚖ 497 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Data Structures Volume 4619 || Spherical LSH for Approximate Nearest Neighbor Search on Unit Hypersphere

✍ Dehne, Frank; Sack, Jörg-Rüdiger; Zeh, Norbert 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg ⚖ 492 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Data Structures Volume 955 || Improved length bounds for the shortest superstring problem

✍ Akl, Selim G.; Dehne, Frank; Sack, Jörg-Rüdiger; Santoro, Nicola 📂 Article 📅 1995 🏛 Springer Berlin Heidelberg ⚖ 740 KB