Discrete and computational geometry : Japanese conference, JCDCG 2000, Tokyo, Japan, November 22-25, 2000

Discrete and Computational Geometry: Japanese Conference, JCDCG 2000 Tokyo, Japan, November 22–25, 2000 Revised Papers
Author: Jin Akiyama, Mikio Kano, Masatsugu Urabe
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-42306-5
DOI: 10.1007/3-540-47738-1

Table of Contents:

• Dudeney Dissections of Polygons and Polyhedrons – A Survey –
• Universal Measuring Devices Without Gradations
• A Note on the Purely Recursive Dissection for a Sequentially n-Divisible Square
• Sequentially Divisible Dissections of Simple Polygons
• Packing Convex Polygons into Rectangular Boxes
• On the Number of Views of Polyhedral Scenes
• Problems and Results around the Erdös-Szekeres Convex Polygon Theorem
• On Finding Maximum-Cardinality Symmetric Subsets
• Folding and Unfolding Linkages, Paper, and Polyhedra
• On the Skeleton of the Metric Polytope
• Geometric Dissections that Swing and Twist
• On Convex Decompositions of Points
• Volume Queries in Polyhedra
• Sum of Edge Lengths of a Graph Drawn on a Convex Polygon
• On double bound graphs with respect to graph operations
• Generalized Balanced Partitions of Two Sets of Points in the Plane
• On Paths in a Complete Bipartite Geometric Graph
• Approximating Uniform Triangular Meshes for Spheres
• The construction of Delaunay diagrams by lob reduction
• Geometric Transformation in Plane Triangulations

Includes bibliographical references and index