Ebook: Discrete and Computational Geometry: Japanese Conference, JCDCG 2000 Tokyo, Japan, November 22–25, 2000 Revised Papers
- Genre: Mathematics // Computational Mathematics
- Tags: Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science, Computer Graphics, Combinatorics, Convex and Discrete Geometry
- Series: Lecture Notes in Computer Science 2098
- Year: 2001
- Publisher: Springer-Verlag Berlin Heidelberg
- Edition: 1
- Language: English
- pdf
This book constitutes the thoroughly refereed post-proceedings of the Japanese Conference on Discrete Computational Geometry, JCDCG 2001, held in Tokyo, Japan in November 2001. The 35 revised papers presented were carefully reviewed and selected. Among the topics covered are polygons and polyhedrons, divissible dissections, convex polygon packings, symmetric subsets, convex decompositions, graph drawing, graph computations, point sets, approximation, Delauny diagrams, triangulations, chromatic numbers, complexity, layer routing, efficient algorithms, and illumination problems.
Proceedings of the Japanese Conference, JCDCG, held in Tokyo, Japan, November 22-25, 2001. Thirty-five papers were presented. Revised papers. Softcover.
Proceedings of the Japanese Conference, JCDCG, held in Tokyo, Japan, November 22-25, 2001. Thirty-five papers were presented. Revised papers. Softcover.
Download the book Discrete and Computational Geometry: Japanese Conference, JCDCG 2000 Tokyo, Japan, November 22–25, 2000 Revised Papers for free or read online
Continue reading on any device:
Last viewed books
Related books
{related-news}
Comments (0)