Computational Geometry and Graph Theory : International Conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007. Revised Selected Papers / edited by Hiro Ito, Mikio Kano, Naoki Katoh, Yushi Uno.

Format:

Book

Contributor:

Ito, Hiro, editor.

Kanō, Mikio, 1949- editor.

Katoh, Naoki, editor.

Uno, Yūshi, editor.

SpringerLink (Online service)

Series:

Computer Science (Springer-11645)

LNCS sublibrary. Image processing, computer vision, pattern recognition, and graphics ; SL 6, 4535.

Image Processing, Computer Vision, Pattern Recognition, and Graphics ; 4535

Language:

English

Subjects (All):

Computer graphics.

Computer science--Mathematics.

Computer science.

Algorithms.

Data structures (Computer science).

Convex geometry.

Discrete geometry.

Computer Graphics.

Discrete Mathematics in Computer Science.

Algorithm Analysis and Problem Complexity.

Data Structures.

Convex and Discrete Geometry.

Local Subjects:

Computer Graphics.

Discrete Mathematics in Computer Science.

Algorithm Analysis and Problem Complexity.

Data Structures.

Convex and Discrete Geometry.

Physical Description:

1 online resource (XII, 237 pages).

Edition:

First edition 2008.

Contained In:

Springer eBooks

Place of Publication:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2008.

System Details:

text file PDF

Summary:

This book constitutes the thoroughly refereed post-conference proceedings of the Kyoto Conference on Computational Geometry and Graph Theory, KyotoCGGT 2007, held in Kyoto, Japan, in June 2007, in honor of Jin Akiyama and Vašek Chvátal, on the occasion of their 60th birthdays. The 19 revised full papers, presented together with 5 invited papers, were carefully selected during two rounds of reviewing and improvement from more than 60 talks at the conference. All aspects of Computational Geometry and Graph Theory are covered, including tilings, polygons, impossible objects, coloring of graphs, Hamilton cycles, and factors of graphs.

Contents:

Dudeney Transformation of Normal Tiles

Chromatic Numbers of Specified Isohedral Tilings

Transforming Graphs with the Same Degree Sequence

The Forest Number of (n,m)-Graphs

Computing Simple Paths on Points in Simple Polygons

Deflating the Pentagon

Enumeration of Polyominoes, Polyiamonds and Polyhexes for Isohedral Tilings with Rotational Symmetry

Solvable Trees

Ramsey Numbers on a Union of Identical Stars Versus a Small Cycle

A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets

Fast Skew Partition Recognition

Some Results on Fractional Graph Theory

Seven Types of Random Spherical Triangle in S n and Their Probabilities

(3,2)-Track Layout of Bipartite Graph Subdivisions

Bartholdi Zeta Functions of Branched Coverings of Digraphs

On Super Edge-Magic Strength and Deficiency of Graphs

The Number of Flips Required to Obtain Non-crossing Convex Cycles

Divide and Conquer Method for k-Set Polygons

Coloring Axis-Parallel Rectangles

Domination in Cubic Graphs of Large Girth

Chvátal-Erd?s Theorem: Old Theorem with New Aspects

Computer-Aided Creation of Impossible Objects and Impossible Motions

The Hamiltonian Number of Cubic Graphs

SUDOKU Colorings of the Hexagonal Bipyramid Fractal.

Other Format:

Printed edition:

ISBN:

978-3-540-89550-3

9783540895503

Access Restriction:

Restricted for use by site license.