Discrete and Computational Geometry
Contributors: Jin Akiyama (Editor); Mikio Kano (Editor); Masatsugu Urabe (Editor)
Edition: 1 edition
Publisher: Springer
Published: August 9, 2001
Language: eng
Format: Paperback
Number of pages: 392
ISBN-13: 9783540423065
Subjects: Algorithms & procedures; Geometry; Image processing: graphics (static images); Mathematical theory of computation; Geometry - General; Congresses; Science/Mathematics; Discrete Mathematics (Computer Science); Mathematics; General; Data processing; Computer Graphics - General; Algorithmic Geometry; Approximation; Combinatorial Mathematics; Complexity; Computational Geometry; Computers / Computer Science; Convex Jets; Discrete Geometry; Discrete Mathematics; Geometric Algorithms; Combinatorial Geometry; Combinatorics; Computer Science
Description: Discrete and Computational Geometry: Japanese Conference, JCDCG 2000 Tokyo, Japan, November 22–25, 2000 Revised Papers<br />Author: Jin Akiyama, Mikio Kano, Masatsugu Urabe<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-42306-5<br /> DOI: 10.1007/3-540-47738-1<br /><br />Table of Contents:<p></p><ul><li>Dudeney Dissections of Polygons and Polyhedrons – A Survey –
</li><li>Universal Measuring Devices Without Gradations
</li><li>A Note on the Purely Recursive Dissection for a Sequentially n-Divisible Square
</li><li>Sequentially Divisible Dissections of Simple Polygons
</li><li>Packing Convex Polygons into Rectangular Boxes
</li><li>On the Number of Views of Polyhedral Scenes
</li><li>Problems and Results around the Erdös-Szekeres Convex Polygon Theorem
</li><li>On Finding Maximum-Cardinality Symmetric Subsets
</li><li>Folding and Unfolding Linkages, Paper, and Polyhedra
</li><li>On the Skeleton of the Metric Polytope
</li><li>Geometric Dissections that Swing and Twist
</li><li>On Convex Decompositions of Points
</li><li>Volume Queries in Polyhedra
</li><li>Sum of Edge Lengths of a Graph Drawn on a Convex Polygon
</li><li>On double bound graphs with respect to graph operations
</li><li>Generalized Balanced Partitions of Two Sets of Points in the Plane
</li><li>On Paths in a Complete Bipartite Geometric Graph
</li><li>Approximating Uniform Triangular Meshes for Spheres
</li><li>The construction of Delaunay diagrams by lob reduction
</li><li>Geometric Transformation in Plane Triangulations</li></ul>