1 option
Discrete and Computational Geometry and Graphs : 16th Japanese Conference, JCDCGG 2013, Tokyo, Japan, September 17-19, 2013, Revised Selected Papers / edited by Jin Akiyama, Hiro Ito, Toshinori Sakai.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 8845
- Theoretical Computer Science and General Issues, 2512-2029 ; 8845
- Language:
- English
- Subjects (All):
- Computer graphics.
- Computer science-Mathematics.
- Discrete mathematics.
- Algorithms.
- Artificial intelligence-Data processing.
- Convex geometry.
- Discrete geometry.
- Computer Graphics.
- Discrete Mathematics in Computer Science.
- Data Science.
- Convex and Discrete Geometry.
- Local Subjects:
- Computer Graphics.
- Discrete Mathematics in Computer Science.
- Algorithms.
- Data Science.
- Convex and Discrete Geometry.
- Physical Description:
- 1 online resource (VIII, 191 pages) : 104 illustrations
- Edition:
- 1st ed. 2014.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2014.
- System Details:
- text file PDF
- Summary:
- 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.
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-319-13287-7
- 9783319132877
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.