Skip to main content
SpringerLink
Log in

Discrete and Computational Geometry

Japanese Conference, JCDCG'98 Tokyo, Japan, December 9-12, 1998 Revised Papers

  • Conference proceedings
  • © 2000

Overview

Editors:
  1. Jin Akiyama

    1. Research Institute of Education, Tokai University, Shibuya-ku Tokio, Japan

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Mikio Kano

    1. Ibaraki University, Hitachi Ibaraki, Japan

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Masatsugu Urabe

    1. Department of Mathematics, Tokai University, 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 1763)

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 (28 papers)

  1. Front Matter

    Download chapter PDF

  2. Papers

    1. Radial Perfect Partitions of Convex Sets in the Plane

      • J. Akiyama, A. Kaneko, M. Kano, G. Nakamura, E. Rivera-Campo, S. Tokunaga et al.
      Pages 1-13

    2. Dudeney Dissection of Polygons

      • Jin Akiyama, Gisaku Nakamura
      Pages 14-29

    3. Effective Use of Geometric Properties for Clustering

      • Tetsuo Asano
      Pages 30-46

    4. Living with lrs

      • David Avis
      Pages 47-56

    5. On the Existente of a Point Subset with 4 or 5 Interior Points

      • David Avis, Kiyoshi Hosono, Masatsugu Urabe
      Pages 57-64

    6. Planar Drawing Algorithms of Survivable Telecommunication Networks

      • Ala Eddine Barouni, Ali Jaoua, Nejib Zaguia
      Pages 65-80

    7. Polygon Cutting: Revisited

      • Prosenjit Bose, Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari
      Pages 81-92

    8. Algorithms for Packing Two Circles in a Convex Polygon

      • Prosenjit Bose, Jurek Czyzowicz, Evangelos Kranakis, Anil Maheshwari
      Pages 93-103

    9. Folding and Cutting Paper

      • Erik D. Demaine, Martin L. Demaine, Anna Lubiw
      Pages 104-118

    10. An Interpolant Based on Line Segment Voronoi Diagrams

      • Hisamoto Hiyoshi, Kokichi Sugihara
      Pages 119-128

    11. 2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces

      • Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama
      Pages 129-157

    12. NP-Completeness of Stage Illumination Problems

      • Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama
      Pages 158-165

    13. On the Maximum Degree of Bipartite Embeddings of Trees in the Plane

      • Atsushi Kaneko
      Pages 166-171

    14. Efficient Regular Polygon Dissections

      • Evangelos Kranakis, Danny Krizanc, Jorge Urrutia
      Pages 172-187

    15. On Soddy’s Hexlet and a Linked 4-Pair

      • Hiroshi Maehara, Ai Oshiro
      Pages 188-193

    16. Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs

      • Tomomi Matsui
      Pages 194-200

    17. Visibility of Disks on the Lattice Points

      • Nobuaki Mutoh, Gisaku Nakamura
      Pages 201-206

    18. Convex Hull Problem with Imprecise Input

      • Takayuki Nagai, Seigo Yasutome, Nobuki Tokura
      Pages 207-219

    19. One-Dimensional Tilings with Congruent Copies of a 3-Point Set

      • Tomoki Nakamigawa
      Pages 220-234
Back to top

Keywords

About this book

This volume consists of those papers presented at the Japan Conference on Discrete and Computational Geometry ’98. The conference was held 9-12 - cember 1998 at Tokai University in Tokyo. Close to a hundred participants from 10 countries participated. Interest in Computational Geometry surfaced among engineers in Japan - out twenty years ago, while interest in Discrete Geometry arose as a natural extension of the research of a group of graph theorists more recently. One of the goals of the conference was to bring together these two groups and to put them in contact with experts in these ?elds from abroad. This is the second conference in the series. The plan is to hold one every year and to publish the papers of the conferences every two years. The organizers thank the sponsors of the conference, namely, The Institute of Educational Development of Tokai University, Grant-in-Aid of the Ministry of Education of Japan (A.Saito;(A)10304008), Mitsubishi Research Institute, Sanada Institute of System Development, Japan Process, and Upward. They also thank especially T. Asano, D. Avis, V. Chv´ atal, H. Imai, J. Pach, D. R- paport, M. Ruiz, J. O’Rourke, K. Sugihara, T. Tokuyama, and J. Urrutia for their interest and support.

Editors and Affiliations

  • Research Institute of Education, Tokai University, Shibuya-ku Tokio, Japan

    Jin Akiyama

  • Ibaraki University, Hitachi Ibaraki, Japan

    Mikio Kano

  • Department of Mathematics, Tokai University, Japan

    Masatsugu Urabe

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation