Discrete and Computational Geometry

Japanese Conference, JCDCG’98 Tokyo, Japan, December 9-12, 1998. Revised Papers

Editors:

ISBN: 978-3-540-67181-7 (Print) 978-3-540-46515-7 (Online)

Table of contents (28 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Papers

    1. No Access

      Book Chapter

      Pages 1-13

      Radial Perfect Partitions of Convex Sets in the Plane

    2. No Access

      Book Chapter

      Pages 14-29

      Dudeney Dissection of Polygons

    3. No Access

      Book Chapter

      Pages 30-46

      Effective Use of Geometric Properties for Clustering

    4. No Access

      Book Chapter

      Pages 47-56

      Living with lrs

    5. No Access

      Book Chapter

      Pages 57-64

      On the Existente of a Point Subset with 4 or 5 Interior Points

    6. No Access

      Book Chapter

      Pages 65-80

      Planar Drawing Algorithms of Survivable Telecommunication Networks

    7. No Access

      Book Chapter

      Pages 81-92

      Polygon Cutting: Revisited

    8. No Access

      Book Chapter

      Pages 93-103

      Algorithms for Packing Two Circles in a Convex Polygon

    9. No Access

      Book Chapter

      Pages 104-118

      Folding and Cutting Paper

    10. No Access

      Book Chapter

      Pages 119-128

      An Interpolant Based on Line Segment Voronoi Diagrams

    11. No Access

      Book Chapter

      Pages 129-157

      2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces

    12. No Access

      Book Chapter

      Pages 158-165

      NP-Completeness of Stage Illumination Problems

    13. No Access

      Book Chapter

      Pages 166-171

      On the Maximum Degree of Bipartite Embeddings of Trees in the Plane

    14. No Access

      Book Chapter

      Pages 172-187

      Efficient Regular Polygon Dissections

    15. No Access

      Book Chapter

      Pages 188-193

      On Soddy’s Hexlet and a Linked 4-Pair

    16. No Access

      Book Chapter

      Pages 194-200

      Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs

    17. No Access

      Book Chapter

      Pages 201-206

      Visibility of Disks on the Lattice Points

    18. No Access

      Book Chapter

      Pages 207-219

      Convex Hull Problem with Imprecise Input

    19. No Access

      Book Chapter

      Pages 220-234

      One-Dimensional Tilings with Congruent Copies of a 3-Point Set

    20. No Access

      Book Chapter

      Pages 235-249

      Polygonal Approximations for Curved Problems: An Application to Arrangements

previous Page of 2