Akiyama J., Kano M., Urabe M. (eds.) Discrete and Computational Geometry

Springer, 2001. — 389 p.Japanese Conference, JCDCG 2000, Tokyo, Japan, November 22-25, 2000, Revised Papers.
The Japan Conference on Discrete and Computational Geometry (JCDCG) has been held annually since 1997. One of the goals of this conference series is to bring together Japanese researchers from both academia and industry with researchers in these fields from abroad to share their recent results.
JCDCG 2000 was held 22–25 November 2000 at Tokai University in Tokyo in conjunction with the celebration of World Mathematics Year 2000. A total of 120 participants from 20 countries attended. This volume consists of the papers presented at JCDCG 2000, which have been refereed and revised. Some papers which appear in short form in this volume also appear in fuller expanded versions in journals dedicated to computational geometry.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 Rectanguler Boxes
On the Number of Views of Polyhedral Scenes
Problems and Results Around the Erd˝os-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 Transformations in Plane Triangulations
Separation Sensitive Kinetic Separation Structures for Convex Polygons
On Acute Triangulations of Quadrilaterals
Intersecting Red and Blue Line Segments in Optimal Time and Precision
Tight Error Bounds of Geometric Problems on Convex Objects with Imprecise Coordinates
Triangle Contact Systems, Orthogonal Plane Partitions and their Hit Graphs
Note on Diagonal Flips and Chromatic Numbers of Quadrangulations on Closed Surfaces
An Extension of Cauchy’s Arm Lemma with Application to Curve Development
On the Complexity of the Union of Geometric Objects
Structure Theorems for Systems of Segments
3-dimensional Single Active Layer Routing
Nonregular Triangulations, View Graphs of Triangulations, and Linear Programming Duality
Efficient Algorithms for Searching a Polygonal Room with a Door
A New Structure of Cylinder Packing
Efficient Algorithms for the Minimum Diameter Bridge Problem
Illuminating Both Sides of Line Segments