✦ LIBER ✦

[Lecture Notes in Computer Science] Algorithms and Computation Volume 7074 || Generating Realistic Roofs over a Rectilinear Polygon

✍ Scribed by Asano, Takao; Nakano, Shin-ichi; Okamoto, Yoshio; Watanabe, Osamu

Book ID: 120270649
Publisher: Springer Berlin Heidelberg
Year: 2011
Weight: 240 KB
Category: Article
ISBN: 3642255914
DOI: 10.1007/978-3-642-25591-5_8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computation Volume 7074 || Compact Representation of Posets

✍ Asano, Takao; Nakano, Shin-ichi; Okamoto, Yoshio; Watanabe, Osamu 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg ⚖ 231 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computation Volume 7074 || Two Fixed-Parameter Algorithms for the Cocoloring Problem

✍ Asano, Takao; Nakano, Shin-ichi; Okamoto, Yoshio; Watanabe, Osamu 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 195 KB

This Book Constitutes The Refereed Proceedings Of The 22nd International Symposium On Algorithms And Computation, Isaac 2011, Held In Yokohama, Japan In December 2011. The 76 Revised Full Papers Presented Together With Two Invited Talks Were Carefully Reviewed And Selected From 187 Submissions For I

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computation Volume 650 || Generalized assignment problems

✍ Ibaraki, Toshihide; Inagaki, Yasuyoshi; Iwama, Kazuo; Nishizeki, Takao; Yamashit 📂 Article 📅 1992 🏛 Springer Berlin Heidelberg ⚖ 809 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computation Volume 762 || Finding shortest non-crossing rectilinear paths in plane regions

✍ Ng, K. W.; Raghavan, P.; Balasubramanian, N. V.; Chin, F. Y. L. 📂 Article 📅 1993 🏛 Springer Berlin Heidelberg ⚖ 566 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computation Volume 1741 || An O(1) Time Algorithm for Generating Multiset Permutations

✍ Aggarwal, Alok; Rangan, C. Pandu 📂 Article 📅 1999 🏛 Springer Berlin Heidelberg ⚖ 117 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computation Volume 650 || Approximation of polygonal curves with minimum number of line segments

✍ Ibaraki, Toshihide; Inagaki, Yasuyoshi; Iwama, Kazuo; Nishizeki, Takao; Yamashit 📂 Article 📅 1992 🏛 Springer Berlin Heidelberg ⚖ 576 KB