4. JCDCG 2002: Tokyo, Japan

• Jin Akiyama, Hiroshi Fukuda, Gisaku Nakamura:
  Universal Measuring Devices with Rectangular Base. 1-8
  
• Jin Akiyama, Rika Mochizuki, Nobuaki Mutoh, Gisaku Nakamura:
  Maximin Distance for n Points in a Unit Square or a Unit Circle. 9-13
  
• Jin Akiyama, Gisaku Nakamura:
  Congruent Dudeney Dissections of Polygons: All the Hinge Points on Vertices of the Polygon. 14-21
  
• Oswin Aichholzer, David Bremner, Erik D. Demaine, Ferran Hurtado, Evangelos Kranakis, Hannes Krasser, Suneeta Ramaswami, Saurabh Sethia, Jorge Urrutia:
  Playing with Triangulations. 22-37
  
• Rebecca Alexander, Heather Dyson, Joseph O'Rourke:
  The Foldings of a Square to Convex Polyhedra. 38-50
  
• David Avis:
  On the Complexity of Testing Hypermetric, Negative Type, k-Gonal and Gap Inequalities. 51-59
  
• Sergei Bespamyatnikh:
  On Partitioning a Cake. 60-71
  
• Sergei Bespamyatnikh, David G. Kirkpatrick:
  Constrained Equitable 3-Cuttings. 72-83
  
• Binay K. Bhattacharya, Asish Mukhopadhyay:
  On the Minimum Perimeter Triangle Enclosing a Convex Polygon. 84-96
  
• Prosenjit Bose, Luc Devroye, Pat Morin:
  Succinct Data Structures for Approximating Convex Functions with Applications. 97-107
  
• Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama:
  Efficient Algorithms for Constructing a Pyramid from a Terrain. 108-117
  
• Antoine Deza, Komei Fukuda, Tomohiko Mizutani, Cong Vo:
  On the Face Lattice of the Metric Polytope. 118-128
  
• Ren Ding, Kiyoshi Hosono, Masatsugu Urabe, Changqing Xu:
  Partitioning a Planar Point Set into Empty Convex Polygons. 129-134
  
• Herbert Edelsbrunner, Alper Üngör:
  Relaxed Scheduling in Dynamic Skin Triangulation. 135-151
  
• Thomas Fevens:
  A Note on Point Subsets with a Specified Number of Interior Points. 152-158
  
• Greg N. Frederickson:
  Piano-Hinged Dissections: Now Let's Fold! 159-171
  
• Mordecai J. Golin, Stefan Langerman, William L. Steiger:
  The Convex Hull for Random Lines in the Plane. 172-175
  
• Hiro Ito, Hiroshi Nagamochi:
  Comparing Hypergraphs by Areas of Hyperedges Drawn on a Convex Polygon. 176-181
  
• Yoshiyuki Kusakari:
  On Reconfiguring Radial Trees. 182-191
  
• Yoichi Maeda:
  Viewing Cube and Its Visual Angles. 192-199
  
• Yoichi Maeda, Hiroshi Maehara:
  Observing an Angle from Various Viewpoints. 200-203
  
• Nobuaki Mutoh:
  The Polyhedra of Maximal Volume Inscribed in the Unit Sphere and of Minimal Volume Circumscribed about the Unit Sphere. 204-214
  
• Chie Nara, Toshinori Sakai, Jorge Urrutia:
  Maximal Number of Edges in Geometric Graphs without Convex Polygons. 215-220
  
• János Pach, Rados Radoicic, Géza Tóth:
  Relaxing Planarity for Topological Graphs. 221-232
  
• Rom Pinchasi:
  On the Size of a Radial Set. 233-245
  
• David Rappaport:
  Tight Bounds for Visibility Matching of f-Equal Width Objects. 246-250
  
• Toshinori Sakai:
  Long Paths through Specified Vertices in 3-Connected Graphs. 251-260
  
• Kazuhiro Suzuki:
  On the Number of Intersections of Three Monochromatic Trees in the Plane. 261-272
  
• Godfried T. Toussaint:
  Open Problems in Geometric Methods for Instance-Based Learning. 273-283