This e-book constitutes the completely refereed post-proceedings of the japanese convention on Discrete Computational Geometry, JCDCG 2001, held in Tokyo, Japan in November 2001. The 35 revised papers offered have been rigorously reviewed and chosen. one of the issues coated are polygons and polyhedrons, divissible dissections, convex polygon packings, symmetric subsets, convex decompositions, graph drawing, graph computations, element units, approximation, Delauny diagrams, triangulations, chromatic numbers, complexity, layer routing, effective algorithms, and illumination difficulties.

Show description

Read or Download Discrete and Computational Geometry PDF

Similar Combinatorics books

Bent Functions: Results and Applications to Cryptography

Bent features: effects and functions to Cryptography bargains a special survey of the items of discrete arithmetic referred to as Boolean bent capabilities. As those maximal, nonlinear Boolean features and their generalizations have many theoretical and functional functions in combinatorics, coding thought, and cryptography, the textual content offers an in depth survey in their major effects, proposing a scientific review in their generalizations and functions, and contemplating open difficulties in class and systematization of bent features.

A First Course in Combinatorial Mathematics (Oxford Applied Mathematics and Computing Science Series)

Now in a brand new moment variation, this quantity offers a transparent and concise remedy of an more and more very important department of arithmetic. a special introductory survey entire with easy-to-understand examples and pattern difficulties, this article contains details on such simple combinatorial instruments as recurrence kin, producing capabilities, prevalence matrices, and the non-exclusion precept.

Winning Solutions (Problem Books in Mathematics)

This publication offers the mathematical instruments and problem-solving adventure had to effectively compete in high-level challenge fixing competitions. each one part provides very important historical past details after which offers numerous labored examples and workouts to assist bridge the space among what the reader may possibly already comprehend and what's required for high-level competitions.

Combinatorial Designs: A Tribute to Haim Hanani (Annals of Discrete Mathematics)

Haim Hanani pioneered the suggestions for developing designs and the speculation of pairwise balanced designs, major on to Wilson's life Theorem. He additionally led the way in which within the learn of resolvable designs, protecting and packing difficulties, latin squares, 3-designs and different combinatorial configurations.

Extra info for Discrete and Computational Geometry

Show sample text content

Rated 4.66 of 5 – based on 41 votes