Discrete and Computational Geometry. Japanese Conference, JCDCG 2000, Tokyo, Japan, November, 2225, 2000. Revised Papers (Lecture Notes in Computer Science Vol. 2098)
Kurzbeschreibung This book constitutes the thoroughly refereed postproceedings 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. Synopsis This text constitutes the thoroughly refereed postproceedings 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, divisible dissections, convex polygon packings, symmetric subsets, convex decompositions, graph drawing, graph computations, point sets, approximation, Delauny diagrams, triangulations, chromatic...
Diskrete Geometrie > Discrete and Computational Geometry. Japanese Conference, JCDCG 2000, Tokyo, Japan, November, 2225, 2000. Revised Papers (Lecture Notes in Computer Science Vol. 2098) 
