Papers |
Radical Perfect Partitions of Convex Sets in the Plane / J. Akiyama ; A. Kaneko ; M. Kano ; G. Nakamura ; E. Rivera-Campo ; S. Tokunaga ; J. Urrutia |
Dudeney Dissection of Polygons |
Effective Use of Geometric Properties for Clustering / T. Asano. |
Living with lrs / D. Avis. |
On the Existence of a Point Subset with 4 or 5 Interior Points / D. Avis ; K. Hosono ; M. Urabe |
Planar Drawing Algorithms of Survivable Telecommunication Networks / A. E. Barouni ; A. Jaoua ; N. Zaguia |
Polygon Cutting: Revisited / P. Bose ; J. Czyzowicz ; E. Kranakis ; D. Krizanc ; A. Maheshwari |
Algorithms for Packing Two Circles in a Convex Polygon |
Folding and Cutting Paper / E. D. Demaine ; M. L. Demaine ; A. Lubiw |
An Interpolant Based on Line Segment Voronoi Diagrams / H. Hiyoshi ; K. Sugihara |
2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces / H. Ito ; H. Uehara ; M. Yokoyama |
NP-Completeness of Stage Illumination Problems |
On the Maximum Degree of Bipartite Embeddings of Trees in the Plane |
Efficient Regular Polygon Dissections |
On Soddy's Hexlet and a Linked 4-Pair / H. Maehara ; A. Oshiro |
Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs / T. Matsui |
Visibility of Disks on the Lattice Points / N. Mutoh |
Convex Hull Problem with Imprecise Input / T. Nagai ; S. Yasutome ; N. Tokura |
One-Dimensional Tilings with Congruent Copies of a 3-Point Set / T. Nakamigawa |
Polygonal Approximations for Curved Problems: An Application to Arrangements / M. Neagu |
Grouping and Querying: A Paradigm to Get Output-Sensitive Algorithms / F. Nielsen |
Folding and Unfolding in Computational Geometry / J. O'Rourke |
Crossing Numbers / J. Pach |
A Note on the Existence of Plane Spanning Trees of Geometric Graphs |
Embeddings of Equilateral Polygons in Unit Lattices / T. Sakai |
Order-k Voronoi Diagrams, k-sections, and k-sets / D. Schmitt ; J. C. Spehner |
"Impossible Objects" Are Not Necessarily Impossible - Mathematical Study on Optical Illusion - |
An Efficient Solution to the Corridor Search Problem / X. Tan |
Author Index |
Papers |
Radical Perfect Partitions of Convex Sets in the Plane / J. Akiyama ; A. Kaneko ; M. Kano ; G. Nakamura ; E. Rivera-Campo ; S. Tokunaga ; J. Urrutia |
Dudeney Dissection of Polygons |