2. JCDCG 1998: Tokyo, Japan

• Jin Akiyama, Atsushi Kaneko, Mikio Kano, Gisaku Nakamura, Eduardo Rivera-Campo, Shin-ichi Tokunaga, Jorge Urrutia: Radial Perfect Partitions of Convex Sets in the Plane. 1-13
• Jin Akiyama, Gisaku Nakamura:
  Dudeney Dissection of Polygons. 14-29
  
• Tetsuo Asano:
  Effective Use of Geometric Properties for Clustering. 30-46
  
• David Avis:
  Living with lrs. 47-56
  
• David Avis, Kiyoshi Hosono, Masatsugu Urabe:
  On the Existence of a Point Subset with 4 or 5 Interior Points. 57-64
  
• Ala Eddine Barouni, Ali Jaoua, Nejib Zaguia:
  Planar Drawing Algorithms of Survivable Telecommunication Networks. 65-80
  
• Prosenjit Bose, Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari:
  Polygon Cutting: Revisited. 81-92
  
• Prosenjit Bose, Jurek Czyzowicz, Evangelos Kranakis, Anil Maheshwari:
  Algorithms for Packing Two Circles in a Convex Polygon. 93-103
  
• Erik D. Demaine, Martin L. Demaine, Anna Lubiw:
  Folding and Cutting Paper. 104-118
  
• Hisamoto Hiyoshi, Kokichi Sugihara:
  An Interpolant Based on Line Segment Voronoi Diagrams. 119-128
  
• Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama:
  2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces. 129-157
  
• Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama:
  NP-Completeness of Stage Illumination Problems. 158-165
  
• Atsushi Kaneko:
  On the Maximum Degree of Bipartite Embeddings of Trees in the Plane. 166-171
  
• Evangelos Kranakis, Danny Krizanc, Jorge Urrutia:
  Efficient Regular Polygon Dissections. 172-187
  
• Hiroshi Maehara, Ai Oshiro:
  On Soddy's Hexlet and a Linked 4-Pair. 188-193
  
• Tomomi Matsui:
  Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs. 194-200
  
• Nobuaki Mutoh, Gisaku Nakamura:
  Visibility of Disks on the Lattice Points. 201-206
  
• Takayuki Nagai, Seigo Yasutome, Nobuki Tokura:
  Convex Hull Problem with Imprecise Input. 207-219
  
• Tomoki Nakamigawa:
  One-Dimensional Tilings with Congruent Copies of a 3-Point Set. 220-234
  
• Manuela Neagu:
  Polygonal Approximations for Curved Problems: An Application to Arrangements. 235-249
  
• Frank Nielsen:
  Grouping and Querying: A Paradigm to Get Output-Sensitive Algorithms. 250-257
  
• Joseph O'Rourke:
  Folding and Unfolding in Computational Geometry. 258-266
  
• János Pach:
  Crossing Numbers. 267-273
  
• Eduardo Rivera-Campo:
  A Note on the Existence of Plane Spanning Trees of Geometric Graphs. 274-277
  
• Toshinori Sakai: Embeddings of Equilateral Polygons in Unit Lattices. 278-289
• Dominique Schmitt, Jean-Claude Spehner:
  Order-k Voronoi Diagrams, k-Sections, and k-Sets. 290-304
  
• Kokichi Sugihara:
  "Impossible Objects" Are Not Necessarily Impossible - Mathematical Study on Optical Illusion. 305-316
  
• Xuehou Tan:
  An Efficient Solution to the Corridor Search Problem. 317-331
  

Last update Sat May 18 19:12:51 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page