Pub. Date:
Springer Berlin Heidelberg
Discrete and Computational Geometry: Japanese Conference, JCDCG 2000, Tokyo, Japan, November, 22-25, 2000. Revised Papers / Edition 1

Discrete and Computational Geometry: Japanese Conference, JCDCG 2000, Tokyo, Japan, November, 22-25, 2000. Revised Papers / Edition 1


Current price is , Original price is $109.0. You

Temporarily Out of Stock Online

Please check back later for updated availability.

8 New & Used Starting at $21.60


This book constitutes the thoroughly refereed post-proceedings of the Japanese Conference on Discrete Computational Geometry, JCDCG 2001, held in Tokyo, Japan in November 2001. The 35 revised papers presented were carefully reviewed and selected. Among the topics covered are polygons and polyhedrons, divissible dissections, convex polygon packings, symmetric subsets, convex decompositions, graph drawing, graph computations, point sets, approximation, Delauny diagrams, triangulations, chromatic numbers, complexity, layer routing, efficient algorithms, and illumination problems.

Product Details

ISBN-13: 9783540423065
Publisher: Springer Berlin Heidelberg
Publication date: 08/09/2001
Series: Lecture Notes in Computer Science , #2098
Edition description: 2001
Pages: 388
Product dimensions: 6.10(w) x 9.25(h) x 0.36(d)

Table of Contents

Papers.- 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.- 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 Bound of Goemetric 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.

Customer Reviews

Most Helpful Customer Reviews

See All Customer Reviews