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
3540423060, 9783540423065
DOI
10.1007/3-540-47738-1
LCC
QA167 .J33 2001
Open Library ID
OL18160951M
Language
english
Format
PDF
Filesize
7 MB (7550878 bytes)
Series
Lecture Notes in Computer Science 2098
Edition
1
Pages
388\389
Library
Kolxo3
Time added
2011-01-23 12: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