ENGLISH

Discrete and Computational Geometry: Japanese Conference, JCDCG 2000 Tokyo, Japan, November 22–25, 2000 Revised Papers

By Jin Akiyama , Gisaku Nakamura (auth.) , Mikio Kano , Masatsugu Urabe (eds.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2001
ISBN
978-3-540-42306-5, 978-3-540-47738-9, 3-540-42306-0
DOI
10.1007/3-540-47738-1
Language
english
Format
PDF
Filesize
17 MB (18293149 bytes)
Series
Lecture Notes in Computer Science 2098
Edition
1
Pages
388\390
Time added
2014-01-18 08:00:00
Algorithm Analysis and Problem Complexity; Discret

Description

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.

Similar books