menu
{ "item_title" : "Discrete and Computational Geometry and Graphs", "item_author" : [" Jin Akiyama", "Hiro Ito", "Toshinori Sakai "], "item_description" : "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.", "item_img_path" : "https://covers1.booksamillion.com/covers/bam/3/31/913/286/3319132865_b.jpg", "price_data" : { "retail_price" : "54.99", "online_price" : "54.99", "our_price" : "54.99", "club_price" : "54.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Discrete and Computational Geometry and Graphs|Jin Akiyama

Discrete and Computational Geometry and Graphs : 16th Japanese Conference, Jcdcgg 2013, Tokyo, Japan, September 17-19, 2013, Revised Selected Papers

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

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.

This item is Non-Returnable

Details

  • ISBN-13: 9783319132860
  • ISBN-10: 3319132865
  • Publisher: Springer
  • Publish Date: December 2014
  • Dimensions: 9.21 x 6.14 x 0.42 inches
  • Shipping Weight: 0.63 pounds
  • Page Count: 191

Related Categories

You May Also Like...

    1

BAM Customer Reviews