Abstract is missing.
- Radial Perfect Partitions of Convex Sets in the PlaneJin Akiyama, Atsushi Kaneko, Mikio Kano, Gisaku Nakamura, Eduardo Rivera-Campo, Shin-ichi Tokunaga, Jorge Urrutia. 1-13
- Dudeney Dissection of PolygonsJin Akiyama, Gisaku Nakamura. 14-29
- Effective Use of Geometric Properties for ClusteringTetsuo Asano. 30-46
- Living with ::::lrs::::David Avis. 47-56
- On the Existence of a Point Subset with 4 or 5 Interior PointsDavid Avis, Kiyoshi Hosono, Masatsugu Urabe. 57-64
- Planar Drawing Algorithms of Survivable Telecommunication NetworksAla Eddine Barouni, Ali Jaoua, Nejib Zaguia. 65-80
- Polygon Cutting: RevisitedProsenjit Bose, Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari. 81-92
- Algorithms for Packing Two Circles in a Convex PolygonProsenjit Bose, Jurek Czyzowicz, Evangelos Kranakis, Anil Maheshwari. 93-103
- Folding and Cutting PaperErik D. Demaine, Martin L. Demaine, Anna Lubiw. 104-118
- An Interpolant Based on Line Segment Voronoi DiagramsHisamoto Hiyoshi, Kokichi Sugihara. 119-128
- 2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex PiecesHiro Ito, Hideyuki Uehara, Mitsuo Yokoyama. 129-157
- NP-Completeness of Stage Illumination ProblemsHiro Ito, Hideyuki Uehara, Mitsuo Yokoyama. 158-165
- On the Maximum Degree of Bipartite Embeddings of Trees in the PlaneAtsushi Kaneko. 166-171
- Efficient Regular Polygon DissectionsEvangelos Kranakis, Danny Krizanc, Jorge Urrutia. 172-187
- On Soddy s Hexlet and a Linked 4-PairHiroshi Maehara, Ai Oshiro. 188-193
- Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk GraphsTomomi Matsui. 194-200
- Visibility of Disks on the Lattice PointsNobuaki Mutoh, Gisaku Nakamura. 201-206
- Convex Hull Problem with Imprecise InputTakayuki Nagai, Seigo Yasutome, Nobuki Tokura. 207-219
- One-Dimensional Tilings with Congruent Copies of a 3-Point SetTomoki Nakamigawa. 220-234
- Polygonal Approximations for Curved Problems: An Application to ArrangementsManuela Neagu. 235-249
- Grouping and Querying: A Paradigm to Get Output-Sensitive AlgorithmsFrank Nielsen. 250-257
- Folding and Unfolding in Computational GeometryJoseph O Rourke. 258-266
- Crossing NumbersJános Pach. 267-273
- A Note on the Existence of Plane Spanning Trees of Geometric GraphsEduardo Rivera-Campo. 274-277
- Embeddings of Equilateral Polygons in Unit LatticesToshinori Sakai. 278-289
- Order-::::k:::: Voronoi Diagrams, ::::k::::-Sections, and ::::k::::-SetsDominique Schmitt, Jean-Claude Spehner. 290-304
- Impossible Objects Are Not Necessarily Impossible - Mathematical Study on Optical IllusionKokichi Sugihara. 305-316
- An Efficient Solution to the Corridor Search ProblemXuehou Tan. 317-331