Discrete and computational geometry

Discrete and Computational Geometry: Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002. Revised Papers<br />Author: Jin Akiyama, Mikio Kano<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-20776-4<br /> DOI: 10.1007/b11261<br /><br />Table of Contents:<p></p><ul><li>Universal Measuring Devices with Rectangular Base </li><li>Maximin Distance for n Points in a Unit Square or a Unit Circle </li><li>Congruent Dudeney Dissections of Polygons </li><li>Playing with Triangulations </li><li>The Foldings of a Square to Convex Polyhedra </li><li>On the Complexity of Testing Hypermetric, Negative Type, k-Gonal and Gap Inequalities </li><li>On Partitioning a Cake </li><li>Constrained Equitable 3-Cuttings </li><li>On the Minimum Perimeter Triangle Enclosing a Convex Polygon </li><li>Succinct Data Structures for Approximating Convex Functions with Applications </li><li>Efficient Algorithms for Constructing a Pyramid from a Terrain </li><li>On the Face Lattice of the Metric Polytope </li><li>Partitioning a Planar Point Set into Empty Convex Polygons </li><li>Relaxed Scheduling in Dynamic Skin Triangulation </li><li>A Note on Point Subsets with a Specified Number of Interior Points </li><li>Piano-Hinged Dissections: Now Let’s Fold! </li><li>The Convex Hull for Random Lines in the Plane </li><li>Comparing Hypergraphs by Areas of Hyperedges Drawn on a Convex Polygon </li><li>On Reconfiguring Radial Trees </li><li>Viewing Cube and Its Visual Angles</li></ul>