Corpus ID: 15659126

Open problems from cccg 2001

@inproceedings{Demaine2001OpenPF,
  title={Open problems from cccg 2001},
  author={E. Demaine and J. O'Rourke},
  booktitle={CCCG},
  year={2001}
}
  • E. Demaine, J. O'Rourke
  • Published in CCCG 2001
  • Computer Science, Mathematics
  • A list of the problems presented on August 12, 2002 at the open-problem session of the 14th Canadian Conference on Computational Geometry held in Lethbridge, Alberta, Canada. 
    49 Citations

    Figures and Topics from this paper

    Explore Further: Topics Discussed in This Paper

    Unfolding Manhattan Towers
    • 20
    • PDF
    Unfolding Polyhedra
    • 6
    • PDF
    Development of Curves on Polyhedra via Conical Existence
    • 6
    • PDF
    Approximation Algorithms for the Minimum-Length Corridor and Related Problems
    • 4
    • PDF
    Bar-Magnet Polyhedra and NS-Orientations of Maps
    • B. Mohar
    • Mathematics, Computer Science
    • Discret. Comput. Geom.
    • 2006
    • 2
    • PDF
    On the minimum corridor connection problem and other generalized geometric problems
    • 24
    • Highly Influenced
    • PDF
    A Randomly Embedded Random Graph is Not a Spanner
    • 3
    • PDF

    References

    SHOWING 1-10 OF 50 REFERENCES
    Finding k Points with Minimum Diameter and Related Problems
    • 145
    Knots and links in spatial graphs
    • 229
    • PDF
    Computational Geometry Column 43
    • J. O'Rourke
    • Mathematics, Computer Science
    • Int. J. Comput. Geom. Appl.
    • 2002
    • 4
    • PDF
    Computational Line Geometry
    • 422
    Geometric applications of a randomized optimization technique
    • T. Chan
    • Mathematics, Computer Science
    • SCG '98
    • 1998
    • 79
    • PDF
    A machine resolution of a four-color hoax
    • 14
    • PDF
    Tight degree bounds for pseudo-triangulations of points
    • 41
    • PDF