Texts Books | READER Loading...

Discrete and computational geometry : Japanese conference, JCDCG 2000, Tokyo, Japan, November 22 25, 2000 | JCDCG 2000 (2000 : Tokyo, Japan), Akiyama, J, Kanō, Mikio, 1949-, Urabe, Masatsugu, 1960-

Deal Score+2
Telegram icon Share on Telegram

Discrete and computational geometry : Japanese conference, JCDCG 2000, Tokyo, Japan, November 22 25, 2000

User Rating: Be the first one!

Author: JCDCG 2000 (2000 : Tokyo, Japan), Akiyama, J, Kanō, Mikio, 1949-, Urabe, Masatsugu, 1960-

Added by: sketch

Added Date: 2015-12-30

Publication Date: 2001

Language: eng

Subjects: Combinatorial geometry, Geometry

Publishers: Berlin ; New York : Springer

Collections: folkscanomy miscellaneous, folkscanomy, additional collections

ISBN Number: 3540423060

Pages Count: 300

PPI Count: 300

PDF Count: 1

Total Size: 204.51 MB

PDF Size: 17.45 MB

Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc

Edition: [Elektronische Ressource]

Archive Url

Downloads: 611

Views: 661

Total Files: 18

Media Type: texts

Description

Discrete and Computational Geometry: Japanese Conference, JCDCG 2000 Tokyo, Japan, November 22–25, 2000 Revised Papers
Author: Jin Akiyama, Mikio Kano, Masatsugu Urabe
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-42306-5
DOI: 10.1007/3-540-47738-1

Table of Contents:

  • 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

Includes bibliographical references and index
READER
Logo
Compare items
  • Total (0)
Compare
0
Shopping cart