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.
Author(s): Jin Akiyama, Hiroshi Fukuda, Gisaku Nakamura (auth.), Jin Akiyama, Mikio Kano (eds.)
Series: Lecture Notes in Computer Science 2866
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2003
Language: English
Pages: 292
Tags: Computer Graphics; Data Structures; Algorithm Analysis and Problem Complexity; Discrete Mathematics in Computer Science; Computational Mathematics and Numerical Analysis; Convex and Discrete Geometry
Front Matter....Pages -
Universal Measuring Devices with Rectangular Base....Pages 1-8
Maximin Distance for n Points in a Unit Square or a Unit Circle....Pages 9-13
Congruent Dudeney Dissections of Polygons....Pages 14-21
Playing with Triangulations....Pages 22-37
The Foldings of a Square to Convex Polyhedra....Pages 38-50
On the Complexity of Testing Hypermetric, Negative Type, k-Gonal and Gap Inequalities....Pages 51-59
On Partitioning a Cake....Pages 60-71
Constrained Equitable 3-Cuttings....Pages 72-83
On the Minimum Perimeter Triangle Enclosing a Convex Polygon....Pages 84-96
Succinct Data Structures for Approximating Convex Functions with Applications....Pages 97-107
Efficient Algorithms for Constructing a Pyramid from a Terrain....Pages 108-117
On the Face Lattice of the Metric Polytope....Pages 118-128
Partitioning a Planar Point Set into Empty Convex Polygons....Pages 129-134
Relaxed Scheduling in Dynamic Skin Triangulation....Pages 135-151
A Note on Point Subsets with a Specified Number of Interior Points....Pages 152-158
Piano-Hinged Dissections: Now Let’s Fold!....Pages 159-171
The Convex Hull for Random Lines in the Plane....Pages 172-175
Comparing Hypergraphs by Areas of Hyperedges Drawn on a Convex Polygon....Pages 176-181
On Reconfiguring Radial Trees....Pages 182-191
Viewing Cube and Its Visual Angles....Pages 192-199
Observing an Angle from Various Viewpoints....Pages 200-203
The Polyhedra of Maximal Volume Inscribed in the Unit Sphere and of Minimal Volume Circumscribed about the Unit Sphere....Pages 204-214
Maximal Number of Edges in Geometric Graphs without Convex Polygons....Pages 215-220
Relaxing Planarity for Topological Graphs....Pages 221-232
On the Size of a Radial Set....Pages 233-245
Tight Bounds for Visibility Matching of f -Equal Width Objects....Pages 246-250
Long Paths through Specified Vertices in 3-Connected Graphs....Pages 251-260
On the Number of Intersections of Three Monochromatic Trees in the Plane....Pages 261-272
Open Problems in Geometric Methods for Instance-Based Learning....Pages 273-283
Back Matter....Pages -
