Discrete and Computational Geometry - Info and Reading Options

"Discrete and Computational Geometry" is published by Springer in August 9, 2001, it has 392 pages and the language of the book is English.
“Discrete and Computational Geometry” Metadata:
- Title: ➤ Discrete and Computational Geometry
- Language: English
- Number of Pages: 392
- Publisher: Springer
- Publish Date: August 9, 2001
“Discrete and Computational Geometry” Subjects and Themes:
- Subjects: Geometry - Combinatorial geometry - Congresses - Data processing
Edition Specifications:
- Format: Paperback
- Weight: 1.3 pounds
- Dimensions: 9.2 x 6.1 x 0.9 inches
Edition Identifiers:
- The Open Library ID: OL9785929M - OL16967257W
- Library of Congress Control Number (LCCN): 2001042885
- ISBN-13: 9783540423065
- ISBN-10: 3540423060
- All ISBNs: 3540423060 - 9783540423065
AI-generated Review of “Discrete and Computational Geometry”:
"Discrete and Computational Geometry" Description:
The Open Library:
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>
Read “Discrete and Computational Geometry”:
Read “Discrete and Computational Geometry” by choosing from the options below.
Search for “Discrete and Computational Geometry” downloads:
Visit our Downloads Search page to see if downloads are available.
Borrow "Discrete and Computational Geometry" Online:
Check on the availability of online borrowing. Please note that online borrowing has copyright-based limitations and that the quality of ebooks may vary.
- Is Online Borrowing Available: Yes
- Preview Status: full
- Check if available: The Open Library & The Internet Archive
Find “Discrete and Computational Geometry” in Libraries Near You:
Read or borrow “Discrete and Computational Geometry” from your local library.
- The WorldCat Libraries Catalog: Find a copy of “Discrete and Computational Geometry” at a library near you.
Buy “Discrete and Computational Geometry” online:
Shop for “Discrete and Computational Geometry” on popular online marketplaces.
- Ebay: New and used books.