+612 9045 4394
 
CHECKOUT
Discrete and Computational Geometry : Japanese Conference, Jcdcg 2002, Tokyo, Japan, December 6-9, 2002 :  Japanese Conference, Jcdcg 2002, Tokyo, Japan, December 6-9, 2002 - Jin Akiyama

Discrete and Computational Geometry : Japanese Conference, Jcdcg 2002, Tokyo, Japan, December 6-9, 2002

Japanese Conference, Jcdcg 2002, Tokyo, Japan, December 6-9, 2002

By: Jin Akiyama (Editor), Mikio Kano (Editor)

Paperback

Published: February 2004
Ships: 5 to 9 business days
5 to 9 business days
$116.16
or 4 easy payments of $29.04 with Learn more

This book constitutes the thoroughly refereed post-proceedings of the Japanese Conference on Discrete Computational Geometry, JCDCG 2002, held in Tokyo, Japan, in December 2002. The 29 revised full papers presented were carefully selected during two rounds of reviewing and improvement. All current issues in discrete algorithmic geometry are addressed.

Universal Measuring Devices with Rectangular Basep. 1
Maximin Distance for n Points in a Unit Square or a Unit Circlep. 9
Congruent Dudeney Dissections of Polygons - All the Hinge Points on Vertices of the Polygonp. 14
Playing with Triangulationsp. 22
The Foldings of a Square to Convex Polyhedrap. 38
On the Complexity of Testing Hypermetric, Negative Type, k-Gonal and Gap Inequalitiesp. 51
On Partitioning a Cakep. 60
Constrained Equitable 3-Cuttingsp. 72
On the Minimum Perimeter Triangle Enclosing a Convex Polygonp. 84
Succinct Data Structures for Approximating Convex Functions with Applicationsp. 97
Efficient Algorithms for Constructing a Pyramid from a Terrainp. 108
On the Face Lattice of the Metric Polytopep. 118
Partitioning a Planar Point Set into Empty Convex Polygonsp. 129
Relaxed Scheduling in Dynamic Skin Triangulationp. 135
A Note on Point Subsets with a Specified Number of Interior Pointsp. 152
Piano-Hinged Dissections: Now Let's Fold!p. 159
The Convex Hull for Random Lines in the Planep. 172
Comparing Hypergraphs by Areas of Hyperedges Drawn on a Convex Polygonp. 176
On Reconfiguring Radial Treesp. 182
Viewing Cube and Its Visual Anglesp. 192
Observing an Angle from Various Viewpointsp. 200
The Polyhedra of Maximal Volume Inscribed in the Unit Sphere and of Minimal Volume Circumscribed about the Unit Spherep. 204
Maximal Number of Edges in Geometric Graphs without Convex Polygonsp. 215
Relaxing Planarity for Topological Graphsp. 221
On the Size of a Radial Setp. 233
Tight Bounds for Visibility Matching of f-Equal Width Objectsp. 246
Long Paths through Specified Vertices in 3-Connected Graphsp. 251
On the Number of Intersections of Three Monochromatic Trees in the Planep. 261
Open Problems in Geometric Methods for Instance-Based Learningp. 273
Author Indexp. 285
Table of Contents provided by Blackwell. All Rights Reserved.

ISBN: 9783540207764
ISBN-10: 3540207767
Series: Lecture Notes in Computer Science
Audience: Professional
Format: Paperback
Language: English
Number Of Pages: 292
Published: February 2004
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.3 x 15.5  x 1.78
Weight (kg): 0.46