Discrete and Computational Geometry - Info and Reading Options
Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002, Revised Papers (Lecture Notes in Computer Science)
By Jin Akiyama and Mikio Kano
"Discrete and Computational Geometry" is published by Springer in February 20, 2004, it has 285 pages and the language of the book is English.
“Discrete and Computational Geometry” Metadata:
- Title: ➤ Discrete and Computational Geometry
- Authors: Jin AkiyamaMikio Kano
- Language: English
- Number of Pages: 285
- Publisher: Springer
- Publish Date: February 20, 2004
“Discrete and Computational Geometry” Subjects and Themes:
- Subjects: Geometry - Combinatorial geometry - Congresses - Data processing - Geometry, data processing
Edition Specifications:
- Format: Paperback
- Weight: 15.2 ounces
- Dimensions: 9.1 x 6.1 x 0.7 inches
Edition Identifiers:
- The Open Library ID: OL9628387M - OL16966360W
- Online Computer Library Center (OCLC) ID: 53950677
- Library of Congress Control Number (LCCN): 2003070427
- ISBN-13: 9783540207764
- ISBN-10: 3540207767
- All ISBNs: 3540207767 - 9783540207764
AI-generated Review of “Discrete and Computational Geometry”:
Snippets and Summary:
A common device used to measure liquid in many Japanese stores some years back, was a measuring box with a square base of area 6 and height 1.
"Discrete and Computational Geometry" Description:
The Open Library:
Discrete and Computational Geometry: Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002. Revised Papers<br />Author: Jin Akiyama, Mikio Kano<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-20776-4<br /> DOI: 10.1007/b11261<br /><br />Table of Contents:<p></p><ul><li>Universal Measuring Devices with Rectangular Base </li><li>Maximin Distance for n Points in a Unit Square or a Unit Circle </li><li>Congruent Dudeney Dissections of Polygons </li><li>Playing with Triangulations </li><li>The Foldings of a Square to Convex Polyhedra </li><li>On the Complexity of Testing Hypermetric, Negative Type, k-Gonal and Gap Inequalities </li><li>On Partitioning a Cake </li><li>Constrained Equitable 3-Cuttings </li><li>On the Minimum Perimeter Triangle Enclosing a Convex Polygon </li><li>Succinct Data Structures for Approximating Convex Functions with Applications </li><li>Efficient Algorithms for Constructing a Pyramid from a Terrain </li><li>On the Face Lattice of the Metric Polytope </li><li>Partitioning a Planar Point Set into Empty Convex Polygons </li><li>Relaxed Scheduling in Dynamic Skin Triangulation </li><li>A Note on Point Subsets with a Specified Number of Interior Points </li><li>Piano-Hinged Dissections: Now Let’s Fold! </li><li>The Convex Hull for Random Lines in the Plane </li><li>Comparing Hypergraphs by Areas of Hyperedges Drawn on a Convex Polygon </li><li>On Reconfiguring Radial Trees </li><li>Viewing Cube and Its Visual Angles</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.