Discrete and computational geometry

Discrete and Computational Geometry: Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002. Revised Papers
Author: Jin Akiyama, Mikio Kano
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-20776-4
DOI: 10.1007/b11261

Table of Contents:

• Universal Measuring Devices with Rectangular Base
• Maximin Distance for n Points in a Unit Square or a Unit Circle
• Congruent Dudeney Dissections of Polygons
• Playing with Triangulations
• The Foldings of a Square to Convex Polyhedra
• On the Complexity of Testing Hypermetric, Negative Type, k-Gonal and Gap Inequalities
• On Partitioning a Cake
• Constrained Equitable 3-Cuttings
• On the Minimum Perimeter Triangle Enclosing a Convex Polygon
• Succinct Data Structures for Approximating Convex Functions with Applications
• Efficient Algorithms for Constructing a Pyramid from a Terrain
• On the Face Lattice of the Metric Polytope
• Partitioning a Planar Point Set into Empty Convex Polygons
• Relaxed Scheduling in Dynamic Skin Triangulation
• A Note on Point Subsets with a Specified Number of Interior Points
• Piano-Hinged Dissections: Now Let’s Fold!
• The Convex Hull for Random Lines in the Plane
• Comparing Hypergraphs by Areas of Hyperedges Drawn on a Convex Polygon
• On Reconfiguring Radial Trees
• Viewing Cube and Its Visual Angles