Discrete and computational geometry. Japanese conference, JCDCG 2002, Tokyo, Japan, December 6--9, 2002. Revised papers (Q1418349)

The articles of this volume will be reviewed individually. The preceding conference has been reviewed (see Zbl 0968.00054). Indexed articles: \textit{Akiyama, Jin; Fukuda, Hiroshi; Nakamura, Gisaku}, Universal measuring devices with rectangular base, 1-8 [Zbl 1179.52019] \textit{Akiyama, Jin; Mochizuki, Rika; Mutoh, Nobuaki; Nakamura, Gisaku}, Maximin distance for \(n\) points in a unit square or a unit circle, 9-13 [Zbl 1179.68173] \textit{Akiyama, Jin; Nakamura, Gisaku}, Congruent Dudeney dissections of polygons. All the hinge points on vertices of the polygon., 14-21 [Zbl 1179.52020] \textit{Aichholzer, Oswin; Bremner, David; Demaine, Erik D.; Hurtado, Ferran; Kranakis, Evangelos; Krasser, Hannes; Ramaswami, Suneeta; Sethia, Saurabh; Urrutia, Jorge}, Playing with triangulations, 22-37 [Zbl 1179.91053] \textit{Alexander, Rebecca; Dyson, Heather; O'Rourke, Joseph}, The foldings of a square to convex polyhedra, 38-50 [Zbl 1179.52027] \textit{Avis, David}, On the complexity of testing hypermetric, negative type, \(k\)-gonal and gap inequalities, 51-59 [Zbl 1179.52022] \textit{Bespamyatnikh, Sergei}, On partitioning a cake, 60-71 [Zbl 1179.52002] \textit{Bespamyatnikh, Sergei; Kirkpatrick, David}, Constrained equitable \(3\)-cuttings, 72-83 [Zbl 1179.52003] \textit{Bhattacharya, Binay; Mukhopadhyay, Asish}, On the minimum perimeter triangle enclosing a convex polygon, 84-96 [Zbl 1179.52012] \textit{Bose, Prosenjit; Devroye, Luc; Morin, Pat}, Succinct data structures for approximating convex functions with applications, 97-107 [Zbl 1179.68174] \textit{Chun, Jinhee; Sadakane, Kunihiko; Tokuyama, Takeshi}, Efficient algorithms for constructing a pyramid from a terrain, 108-117 [Zbl 1179.68175] \textit{Deza, Antoine; Fukuda, Komei; Mizutani, Tomohiko; Vo, Cong}, On the face lattice of the metric polytope, 118-128 [Zbl 1179.52014] \textit{Ding, Ren; Hosono, Kiyoshi; Urabe, Masatsugu; Xu, Changqing}, Partitioning a planar point set into empty convex polygons, 129-134 [Zbl 1179.52015] \textit{Edelsbrunner, Herbert; Üngör, Alper}, Relaxed scheduling in dynamic skin triangulation, 135-151 [Zbl 1179.68176] \textit{Fevens, Thomas}, A note on point subsets with a specified number of interior points, 152-158 [Zbl 1179.52004] \textit{Frederickson, Greg N.}, Piano-hinged dissections: Now let's fold!, 159-171 [Zbl 1179.52021] \textit{Golin, Mordecai; Langerman, Stefan; Steiger, William}, The convex hull for random lines in the plane, 172-175 [Zbl 1179.52009] \textit{Ito, Hiro; Nagamochi, Hiroshi}, Comparing hypergraphs by areas of hyperedges drawn on a convex polygon, 176-181 [Zbl 1179.05079] \textit{Kusakari, Yoshiyuki}, On reconfiguring radial trees, 182-191 [Zbl 1179.52028] \textit{Maeda, Yoichi}, Viewing cube and its visual angles, 192-199 [Zbl 1179.52023] \textit{Maeda, Yoichi; Maehara, Hiroshi}, Observing an angle from various viewpoints, 200-203 [Zbl 1179.52024] \textit{Mutoh, Nobuaki}, The polyhedra of maximal volume inscribed in the unit sphere and of minimal volume circumscribed about the unit sphere, 204-214 [Zbl 1179.52025] \textit{Nara, Chie; Sakai, Toshinori; Urrutia, Jorge}, Maximal number of edges in geometric graphs without convex polygons, 215-220 [Zbl 1179.05077] \textit{Pach, János; Radoičić, Radoš; Tóth, Géza}, Relaxing planarity for topological graphs, 221-232 [Zbl 1179.05036] \textit{Pinchasi, Rom}, On the size of a radial set, 233-245 [Zbl 1179.52010] \textit{Rappaport, David}, Tight bounds for visibility matching of \(f\)-equal width objects, 246-250 [Zbl 1179.52011] \textit{Sakai, Toshinori}, Long paths through specified vertices in \(3\)-connected graphs, 251-260 [Zbl 1179.05061] \textit{Suzuki, Kazuhiro}, On the number of intersections of three monochromatic trees in the plane, 261-272 [Zbl 1179.05078] \textit{Toussaint, Godfried}, Open problems in geometric methods for instance-based learning, 273-283 [Zbl 1179.68128]