Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 2016

Discrete and Computational Geometry and Graphs

18th Japan Conference, JCDCGG 2015, Kyoto, Japan, September 14-16, 2015, Revised Selected Papers

Editors:

  1. Jin Akiyama

    1. Tokyo University of Science , Tokyo, Japan

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Hiro Ito

    1. The University of Electro-Communications , Tokyo, Japan

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Toshinori Sakai

    1. Tokai University , Tokyo, Japan

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Yushi Uno

    1. Osaka Prefecture University , Sakai, Japan

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 9943)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): JCDCGGG: Japanese Conference on Discrete and Computational Geometry, Graphs, and Games

Conference proceedings info: JCDCGG 2015.

Sections

Buy it now

eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (26 papers)

  1. Front Matter

    Pages I-X
    PDF

  2. A Note on the Number of General 4-holes in (Perturbed) Grids

    • O. Aichholzer, T. Hackl, P. Valtr, B. Vogtenhuber
    Pages 1-12

  3. Reversible Nets of Polyhedra

    • Jin Akiyama, Stefan Langerman, Kiyoko Matsunaga
    Pages 13-23

  4. Geometric p-Center Problems with Centers Constrained to Two Lines

    • Binay Bhattacharya, Ante Ćustić, Sandip Das, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
    Pages 24-36

  5. Dissection with the Fewest Pieces is Hard, Even to Approximate

    • Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Jayson Lynch, Pasin Manurangsi, Mikhail Rudoy et al.
    Pages 37-48

  6. Mario Kart Is Hard

    • Jeffrey Bosboom, Erik D. Demaine, Adam Hesterberg, Jayson Lynch, Erik Waingarten
    Pages 49-59

  7. Single-Player and Two-Player Buttons & Scissors Games

    • Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn, Adam Hesterberg, Michael Hoffmann et al.
    Pages 60-72

  9. Continuous Flattening of Orthogonal Polyhedra

    • Erik D. Demaine, Martin L. Demaine, Jin-ichi Itoh, Chie Nara
    Pages 85-93

  10. Bust-a-Move/Puzzle Bobble Is NP-complete

    • Erik D. Demaine, Stefan Langerman
    Pages 94-104

  11. Minimum Rectilinear Polygons for Given Angle Sequences

    • William S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff
    Pages 105-119

  12. Continuous Folding of Regular Dodecahedra

    • Takashi Horiyama, Jin-ichi Itoh, Naoki Katoh, Yuki Kobayashi, Chie Nara
    Pages 120-131

  13. Escher-like Tilings with Weights

    • Shinji Imahori, Shizuka Kawade, Yoko Yamakata
    Pages 132-142

  14. Number of Ties and Undefeated Signs in a Generalized Janken

    • Hiro Ito, Yoshinao Shiono
    Pages 143-154

  15. \(\gamma \)-Labeling of a Cycle with One Chord

    • Supaporn Saduakdee, Varanoot Khemmani
    Pages 155-166

  16. Box Pleating is Hard

    • Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Takashi Horiyama, Thomas C. Hull, Jason S. Ku et al.
    Pages 167-179

  17. Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces

    • Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, André van Renssen et al.
    Pages 180-192

  18. Simultaneous Approximation of Polynomials

    • Andrei Kupavskii, János Pach
    Pages 193-203

  19. Distance Geometry on the Sphere

    • Leo Liberti, Grzegorz Swirszcz, Carlile Lavor
    Pages 204-215

  20. The Sigma Chromatic Number of the Circulant Graphs \(C_n(1,2)\), \(C_n(1,3)\), and \(C_{2n}(1,n)\)

    • Paul Adrian D. Luzon, Mari-Jo P. Ruiz, Mark Anthony C. Tolentino
    Pages 216-227
Back to top

Other Volumes

  1. Discrete and Computational Geometry and Graphs

Back to top

About this book

This book constitutes the thoroughly refereed post-conference proceedings of the 18th Japanese Conference on Discrete and Computational Geometry and Graphs, JDCDGG 2015, held in Kyoto, Japan, in September 2015.

The total of 25 papers included in this volume was carefully reviewed and selected from 64 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.

This proceedings are dedicated to Naoki Katoh on the occasion of his retirement from Kyoto University.

Back to top

Keywords

Back to top

Editors and Affiliations

  • Tokyo University of Science , Tokyo, Japan

    Jin Akiyama

  • The University of Electro-Communications , Tokyo, Japan

    Hiro Ito

  • Tokai University , Tokyo, Japan

    Toshinori Sakai

  • Osaka Prefecture University , Sakai, Japan

    Yushi Uno

Back to top

Bibliographic Information

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Search

Navigation