This volume consists of those papers presented at the Japan Conference on Discrete and Computational Geometry ’98. The conference was held 9-12 - cember 1998 at Tokai University in Tokyo. Close to a hundred participants from 10 countries participated. Interest in Computational Geometry surfaced among engineers in Japan - out twenty years ago, while interest in Discrete Geometry arose as a natural extension of the research of a group of graph theorists more recently. One of the goals of the conference was to bring together these two groups and to put them in contact with experts in these ?elds from abroad. This is the second conference in the series. The plan is to hold one every year and to publish the papers of the conferences every two years. The organizers thank the sponsors of the conference, namely, The Institute of Educational Development of Tokai University, Grant-in-Aid of the Ministry of Education of Japan (A.Saito;(A)10304008), Mitsubishi Research Institute, Sanada Institute of System Development, Japan Process, and Upward. They also thank especially T. Asano, D. Avis, V. Chv´ atal, H. Imai, J. Pach, D. R- paport, M. Ruiz, J. O’Rourke, K. Sugihara, T. Tokuyama, and J. Urrutia for their interest and support.
Author(s): J. Akiyama, A. Kaneko, M. Kano, G. Nakamura, E. Rivera-Campo, S. Tokunaga, J. Urrutia (auth.), Jin Akiyama, Mikio Kano, Masatsugu Urabe (eds.)
Series: Lecture Notes in Computer Science 1763
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2000
Language: English
Pages: 340
Tags: Computer Graphics; Algorithm Analysis and Problem Complexity; Discrete Mathematics in Computer Science; Combinatorics; Convex and Discrete Geometry
Front Matter....Pages -
Radial Perfect Partitions of Convex Sets in the Plane....Pages 1-13
Dudeney Dissection of Polygons....Pages 14-29
Effective Use of Geometric Properties for Clustering....Pages 30-46
Living with lrs ....Pages 47-56
On the Existente of a Point Subset with 4 or 5 Interior Points....Pages 57-64
Planar Drawing Algorithms of Survivable Telecommunication Networks....Pages 65-80
Polygon Cutting: Revisited....Pages 81-92
Algorithms for Packing Two Circles in a Convex Polygon....Pages 93-103
Folding and Cutting Paper....Pages 104-118
An Interpolant Based on Line Segment Voronoi Diagrams....Pages 119-128
2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces....Pages 129-157
NP-Completeness of Stage Illumination Problems....Pages 158-165
On the Maximum Degree of Bipartite Embeddings of Trees in the Plane....Pages 166-171
Efficient Regular Polygon Dissections....Pages 172-187
On Soddy’s Hexlet and a Linked 4-Pair....Pages 188-193
Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs....Pages 194-200
Visibility of Disks on the Lattice Points....Pages 201-206
Convex Hull Problem with Imprecise Input....Pages 207-219
One-Dimensional Tilings with Congruent Copies of a 3-Point Set....Pages 220-234
Polygonal Approximations for Curved Problems: An Application to Arrangements....Pages 235-249
Grouping and Querying: A Paradigm to Get Output-Sensitive Algorithms....Pages 250-257
Folding and Unfolding in Computational Geometry....Pages 258-266
Crossing Numbers....Pages 267-273
A Note on the Existente of Plane Spanning Trees of Geometrie Graphs....Pages 274-277
Embeddings of Equilateral Polygons in Unit Lattices....Pages 278-289
Order- k Voronoi Diagrams, k -Sections, and k -Sets....Pages 290-304
”Impossible Objects” Are Not Necessarily Impossible – Mathematical Study on Optical Illusion –....Pages 305-316
An Efficient Solution to the Corridor Search Problem....Pages 317-331
Back Matter....Pages -
