Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Computational Geometry, Graphs and Applications

International Conference,CGGA 2010, Dalian, China, November 3-6, 2010, Revised, Selected Papers

  • Conference proceedings
  • © 2011

Overview

Editors:
  1. Jin Akiyama

    1. Research Institute of Education, Tokai University, Tokio, Japan

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Jiang Bo

    1. School of Computer Science and Technology, Dalian Maritime University, Dalian, China

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Mikio Kano

    1. Ibaraki University, Hitachi, Japan

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Xuehou Tan

    1. Tokai University, Hiratsuka, Japan

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Up-to-date results
  • Fast track conference proceedings
  • State-of-the art report

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

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

Included in the following conference series:

Conference proceedings info: CGGA 2010.

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

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as 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

Licence this eBook for your library

Institutional subscriptions

Table of contents (22 papers)

  1. Front Matter

    Download chapter PDF

  2. Determination of All Tessellation Polyhedra with Regular Polygonal Faces

    • Jin Akiyama, Takayasu Kuwata, Stefan Langerman, Kenji Okawa, Ikuro Sato, Geoffrey C. Shephard
    Pages 1-11

  3. Regular Graphs with Maximum Forest Number

    • Avapa Chantasartrassmee, Narong Punnim
    Pages 12-18

  4. Semi Voronoi Diagrams

    • Yongxi Cheng, Bo Li, Yinfeng Xu
    Pages 19-26

  5. Making Polygons by Simple Folds and One Straight Cut

    • Erik D. Demaine, Martin L. Demaine, Andrea Hawksley, Hiro Ito, Po-Ru Loh, Shelly Manber et al.
    Pages 27-43

  6. Common Unfoldings of Polyominoes and Polycubes

    • Greg Aloupis, Prosenjit K. Bose, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Karim Douïeb et al.
    Pages 44-54

  7. Affine Equivalent Classes of Parallelohedra

    • Nikolai Dolbilin, Jin-ichi Itoh, Chie Nara
    Pages 55-60

  8. Fréchet-Distance on Road Networks

    • Chenglin Fan, Jun Luo, Binhai Zhu
    Pages 61-72

  9. Acute Triangulations of the Cuboctahedral Surface

    • Xiao Feng, Liping Yuan
    Pages 73-83

  10. Edge Clique Partition of K 4-Free and Planar Graphs

    • Rudolf Fleischer, Xiaotian Wu
    Pages 84-95

  11. Generation of Polyiamonds for p6 Tiling by the Reverse Search

    • Takashi Horiyama, Shogo Yamane
    Pages 96-107

  12. Continuous Flattening of Platonic Polyhedra

    • Jin-ichi Itoh, Chie Nara
    Pages 108-121

  13. Minimal Embedding of Hypercubic Graphs on Surface

    • Kazuaki Kobayashi, Takako Kodate
    Pages 122-129

  14. A Morphology Method for Determining the Number of Clusters Present in Spectral Co-clustering Documents and Words

    • Na Liu, Mingyu Lu
    Pages 130-141

  15. A Property about the Convex Lattice Set in ℤ2

    • Junfeng Luo, Lin Si, Zitong Wang, Lu Qu
    Pages 142-146

  16. On the Diameter of a Circle to Hold a Cube

    • Hiroshi Maehara
    Pages 147-153

  17. An A* Algorithm Framework for the Point-to-Point Time-Dependent Shortest Path Problem

    • Tatsuya Ohshima, Pipaporn Eumthurapojn, Liang Zhao, Hiroshi Nagamochi
    Pages 154-163

  18. Monotonic Polygons and Paths in Weighted Point Sets

    • Toshinori Sakai, Jorge Urrutia
    Pages 164-175

  19. Simple Characterization of LR-visibility Polygons

    • Xuehou Tan, Jing Zhang, Bo Jiang
    Pages 176-187

  20. A 7/6-Approximation Algorithm for the Max-Min Connected Bipartition Problem on Grid Graphs

    • Bang Ye Wu
    Pages 188-194
Back to top

Other volumes

  1. Computational Geometry, Graphs and Applications

Keywords

About this book

This book constitutes the thoroughly refereed post-conference proceedings of the China-Japan Joint Conference on Computational Geometry, Graphs and Applications, CGGA 2010, held in Dalian, China, in November 2010. The 23 revised full papers presented were carefully selected during two rounds of reviewing and improvement from numerous submissions. All aspects of computational and discrete geometry, graph theory, graph algorithms, and their applications are covered.

Editors and Affiliations

  • Research Institute of Education, Tokai University, Tokio, Japan

    Jin Akiyama

  • School of Computer Science and Technology, Dalian Maritime University, Dalian, China

    Jiang Bo

  • Ibaraki University, Hitachi, Japan

    Mikio Kano

  • Tokai University, Hiratsuka, Japan

    Xuehou Tan

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation