Discrete and Computational Geometry and Graphs

16th Japanese Conference, JCDCGG 2013, Tokyo, Japan, September 17-19, 2013, Revised Selected Papers

AvJin Akiyama,Hiro Ito

Häftad, Engelska, 2014

Del 8845 i serien Lecture Notes in Computer Science

535 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This book constitutes the thoroughly refereed post-conference proceedings of the 16th Japanese Conference on Discrete and computational Geometry and Graphs, JDCDGG 2013, held in Tokyo, Japan, in September 2013.The total of 16 papers included in this volume was carefully reviewed and selected from 58 submissions. The papers feature advances made in the field of computational geometry and focus on emerging technologies, new methodology and applications, graph theory and dynamics.

Produktinformation

Utgivningsdatum:2014-12-03
Mått:155 x 235 x 12 mm
Vikt:312 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:191
Förlag:Springer International Publishing AG
ISBN:9783319132860

Utforska kategorier

Programmeringsböcker inom Data och IT

Innehållsförteckning

Covering Partial Cubes with Zones.- The Non-confusing Travel Groupoids on a Finite Connected Graph.- Decomposing Octilinear Polygons into Triangles and Rectangles.- On Wrapping Spheres and Cubes with Rectangular Paper.- On Polygonal Paths with Bounded Discrete-Curvature: The Inflection-Free Case.- Online Weight Balancing on the Unit Circle.- Transformability and Reversibility of Unfoldings of Doubly-Covered Polyhedra.- Computational Complexity of the r-visibility Guard Set Problem for Polyominoes.- Properly Colored Geometric Matchings and 3-Trees Without Crossings on Multicolored Points in the Plane.- Generating Polygons with Triangles.- Cross-Intersecting Families of Vectors.- The Double Multicompetition Number of a Multigraph.- Computational Geometry in the Human Brain.- A Characterization of Link-2 LR-visibility Polygons with Applications.- Imaginary Hypercubes.- More Results on Clique-chromatic Numbers of Graphs with No Long Path.