Discrete and Computational Geometry

Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002. Revised Papers

  • Jin Akiyama
  • Mikio Kano
Conference proceedings JCDCG 2002

DOI: 10.1007/b11261

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

Table of contents (29 papers)

  1. Front Matter
  2. Universal Measuring Devices with Rectangular Base
    Jin Akiyama, Hiroshi Fukuda, Gisaku Nakamura
    Pages 1-8
  3. Maximin Distance for n Points in a Unit Square or a Unit Circle
    Jin Akiyama, Rika Mochizuki, Nobuaki Mutoh, Gisaku Nakamura
    Pages 9-13
  4. Congruent Dudeney Dissections of Polygons
    Jin Akiyama, Gisaku Nakamura
    Pages 14-21
  5. Playing with Triangulations
    Oswin Aichholzer, David Bremner, Erik D. Demaine, Ferran Hurtado, Evangelos Kranakis, Hannes Krasser et al.
    Pages 22-37
  6. The Foldings of a Square to Convex Polyhedra
    Rebecca Alexander, Heather Dyson, Joseph O’Rourke
    Pages 38-50
  7. On Partitioning a Cake
    Sergei Bespamyatnikh
    Pages 60-71
  8. Constrained Equitable 3-Cuttings
    Sergei Bespamyatnikh, David Kirkpatrick
    Pages 72-83
  9. On the Minimum Perimeter Triangle Enclosing a Convex Polygon
    Binay Bhattacharya, Asish Mukhopadhyay
    Pages 84-96
  10. Succinct Data Structures for Approximating Convex Functions with Applications
    Prosenjit Bose, Luc Devroye, Pat Morin
    Pages 97-107
  11. Efficient Algorithms for Constructing a Pyramid from a Terrain
    Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama
    Pages 108-117
  12. On the Face Lattice of the Metric Polytope
    Antoine Deza, Komei Fukuda, Tomohiko Mizutani, Cong Vo
    Pages 118-128
  13. Partitioning a Planar Point Set into Empty Convex Polygons
    Ren Ding, Kiyoshi Hosono, Masatsugu Urabe, Changqing Xu
    Pages 129-134
  14. Relaxed Scheduling in Dynamic Skin Triangulation
    Herbert Edelsbrunner, Alper Üngör
    Pages 135-151
  15. Piano-Hinged Dissections: Now Let’s Fold!
    Greg N. Frederickson
    Pages 159-171
  16. The Convex Hull for Random Lines in the Plane
    Mordecai Golin, Stefan Langerman, William Steiger
    Pages 172-175
  17. On Reconfiguring Radial Trees
    Yoshiyuki Kusakari
    Pages 182-191

About these proceedings


Maxima Triangulation algorithm algorithmic geometry algorithms combinatorial mathematics complexity computational geometry convex geometry data structure data structures discrete geometry geometric algorithms graph computations lattice computations

Editors and affiliations

  • Jin Akiyama
    • 1
  • Mikio Kano
    • 2
  1. 1.Research Institute of EducationTokai UniversityShibuya-ku TokioJapan
  2. 2.Ibaraki University, Nakanarusawa, HitachiIbarakiJapan

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 2003
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-20776-4
  • Online ISBN 978-3-540-44400-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349