Discrete and computational geometry : Japanese conference, JCDCG 2002, Tokyo, Japan, December 6 9, 2002 : revi
User Rating: Be the first one!
Author: JCDCG 2002 (2002 : Tokai University), Akiyama, J, Kanō, Mikio, 1949-
Added by: sketch
Added Date: 2015-12-30
Language: eng
Subjects: Combinatorial geometry, Geometry
Publishers: Berlin ; New York : Springer
Collections: folkscanomy miscellaneous, folkscanomy, additional collections
ISBN Number: 3540207767
Pages Count: 300
PPI Count: 300
PDF Count: 1
Total Size: 129.51 MB
PDF Size: 3.26 MB
Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc
Downloads: 442
Views: 492
Total Files: 18
Media Type: texts
Total Files: 5
TORRENT
springer 10 1007 b11261 archive torrent
Last Modified: 2022-03-09 09:25:33
Download
Size: 9.02 KB
Description
Discrete and Computational Geometry: Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002. Revised Papers
Author: Jin Akiyama, Mikio Kano
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-20776-4
DOI: 10.1007/b11261
Table of Contents:
Includes bibliographical references and index
Author: Jin Akiyama, Mikio Kano
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-20776-4
DOI: 10.1007/b11261
Table of Contents:
- Universal Measuring Devices with Rectangular Base
- Maximin Distance for n Points in a Unit Square or a Unit Circle
- Congruent Dudeney Dissections of Polygons
- Playing with Triangulations
- The Foldings of a Square to Convex Polyhedra
- On the Complexity of Testing Hypermetric, Negative Type, k-Gonal and Gap Inequalities
- On Partitioning a Cake
- Constrained Equitable 3-Cuttings
- On the Minimum Perimeter Triangle Enclosing a Convex Polygon
- Succinct Data Structures for Approximating Convex Functions with Applications
- Efficient Algorithms for Constructing a Pyramid from a Terrain
- On the Face Lattice of the Metric Polytope
- Partitioning a Planar Point Set into Empty Convex Polygons
- Relaxed Scheduling in Dynamic Skin Triangulation
- A Note on Point Subsets with a Specified Number of Interior Points
- Piano-Hinged Dissections: Now Let’s Fold!
- The Convex Hull for Random Lines in the Plane
- Comparing Hypergraphs by Areas of Hyperedges Drawn on a Convex Polygon
- On Reconfiguring Radial Trees
- Viewing Cube and Its Visual Angles
Includes bibliographical references and index
You May Also Like
We will be happy to hear your thoughts