Discrete and Computational Geometry and Graphs: 16th Japanese Conference, JCDCGG 2013, Tokyo, Japan, September 17-19, 2013, Revised Selected Papers by Jin AkiyamaDiscrete and Computational Geometry and Graphs: 16th Japanese Conference, JCDCGG 2013, Tokyo, Japan, September 17-19, 2013, Revised Selected Papers by Jin Akiyama

Discrete and Computational Geometry and Graphs: 16th Japanese Conference, JCDCGG 2013, Tokyo, Japan…

byJin AkiyamaEditorHiro Ito, Toshinori Sakai

Paperback | December 3, 2014

Pricing and Purchase Info

$70.50 online 
$82.95 list price save 15%
Earn 353 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

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.

Title:Discrete and Computational Geometry and Graphs: 16th Japanese Conference, JCDCGG 2013, Tokyo, Japan…Format:PaperbackDimensions:191 pagesPublished:December 3, 2014Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3319132865

ISBN - 13:9783319132860

Reviews

Table of Contents

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.