American Mathematical Society

My Account · My Cart · Customer Services · FAQ  

AMS Sectional Meeting Program by Special Session

Current as of Tuesday, April 12, 2005 15:09:31


Program  |  Deadlines  |  Inquiries:  meet@ams.org

1996 Fall Eastern Sectional Meeting
Lawrenceville, NJ, October 5-6, 1996
Meeting #914

Associate secretaries:
Lesley M Sibner, AMS lsibner@duke.poly.edu

Special Session on Combinatorial and Computational Geometry

  • Saturday October 5, 1996, 8:30 a.m.-10:50 a.m.
    Special Session on Combinatorial and Computational Geometry, I

    Room 221, Memorial Hall
    Organizers:
    William Steiger, Rutgers University, New Brunswick
    Ileana Streinu, Smith College streinu@cs.smith.edu

    • 8:30 a.m.
      Approximating Shortest Paths on a Convex Polytope in Three Dimensions
      Pankaj K. Agarwal*, Duke University
      (914-68-202)
    • 9:00 a.m.
      DISCREPANCY THEORY AND COMPUTATIONAL GEOMETRY
      Bernard Chazelle*, Princeton University
      (914-52-332)
    • 9:30 a.m.
      Peter Piper placed a polygon on pickled points.
      Matthew Dickerson*, Middlebury College
      (914-52-315)
    • 10:00 a.m.
      On segment visibility graphs
      Hazel J. Everett*,
      Chinh T. Hoang,
      Kyriakos Kilakos,
      Marc Noy,
      (914-52-211)
    • 10:30 a.m.
      Rounding 3d polyhedra
      Steven J. Fortune*, Bell Laboratories
      (914-52-297)
  • Saturday October 5, 1996, 2:30 p.m.-5:50 p.m.
    Special Session on Combinatorial and Computational Geometry, II

    Room 221, Memorial Hall
    Organizers:
    William Steiger, Rutgers University, New Brunswick
    Ileana Streinu, Smith College streinu@cs.smith.edu

    • 2:30 p.m.
      On the Lattice diameter of a convex body
      Imre B\'ar\'any*, Mathematical Institute of the Hungarian Academy of Sciences
      Zolt\'an F\"uredi, Dept. Mathematics, University of Illinois
      (914-52-273)
    • 3:00 p.m.
      On the Independence Number of Minimum Distance Graphs
      Gy\"orgy Csizmadia*, New York University, Courant Institute
      (914-52-93)
    • 3:30 p.m.
      Random Weyl trees
      Luc Devroye*, McGill University
      (914-68-80)
    • 4:00 p.m.
      Finite and Infinite Families of Circles and Spheres
      Herbert Edelsbrunner*,
      (914-52-333)
    • 4:30 p.m.
      Lifting hyperplanes and the acuteness graph of a set of lines.
      Boris Aronov, Polytechnic University
      Jacob E. Goodman*, City College, CUNY
      Richard Pollack, Courant Institute of Mathematical Sciences
      (914-52-189)
    • 5:00 p.m.
      Random Triangulations
      Luc Devroye, McGill University
      Philippe Flajolet, INRIA - Rocquencourt
      Ferran Hurtado, Universitat Politecnica de Catalunya
      Marc Noy*, Universitat Politecnica de Catalunya
      William Steiger, Rutgers University
      (914-52-176)
    • 5:30 p.m.
      Quasi-Planar Graphs Have a Linear Number of Edges
      Pankaj K. Agarwal, Duke University
      Boris Aronov*, Polytechnic University
      J\'anos Pach, Courant Institute of Mathematical Sciences
      Richard Pollack, Courant Institute of Mathematical Sciences,
      Micha Sharir, Tel Aviv University, Tel Aviv
      (914-52-380)
  • Sunday October 6, 1996, 8:30 a.m.-10:50 a.m.
    Special Session on Combinatorial and Computational Geometry, III

    Room 221, Memorial Hall
    Organizers:
    William Steiger, Rutgers University, New Brunswick
    Ileana Streinu, Smith College streinu@cs.smith.edu

    • 8:30 a.m.
      A positive fraction Erd\H{o}s-Szekeres theorem
      Pavel Valtr*,
      (914-52-335)
    • 9:00 a.m.
      Euclidean Ramsey Theory
      G\'eza T\'oth*, Courant Institute, New York University
      (914-52-81)
    • 9:30 a.m.
      A Family of Optimal Packings in Grassmannian Manifolds.
      Peter W. Shor*, AT&T Research
      N. J. A. Sloane, AT&T Research
      (914-51-198)
    • 10:00 a.m.
      Computing roadmaps of semi-algebraic sets on a variety.
      Saugata Basu*,
      Richard Pollack, Courant Institute, NYU
      Marie-Francooise Roy,
      (914-14-07)
    • 10:30 a.m.
      Some metric generalizations of Ramsey's theorem
      Pach*, City College, CUNY, and Courant Institute, NYU.
      (914-52-92)
  • Sunday October 6, 1996, 2:30 p.m.-5:20 p.m.
    Special Session on Combinatorial and Computational Geometry, IV

    Room 221, Memorial Hall
    Organizers:
    William Steiger, Rutgers University, New Brunswick
    Ileana Streinu, Smith College streinu@cs.smith.edu

    • 2:30 p.m.
      When Can a Polygon Fold to a Polytope?
      Joseph O'Rourke*,
      Anna Lubiw,
      (914-52-334)
    • 3:00 p.m.
      On Removing Degeneracies in Computational Geometry
      Francisco Gomez, Universidad Politecnica de Madrid
      Suneeta Ramaswami, McGill University
      Godfried Toussaint*, McGill University
      (914-68-127)
    • 3:30 p.m.
      Efficient Exact Arithmetic for Computational Geometry
      Christopher J. Van Wyk*, Drew University
      (914-68-286)
    • 4:00 p.m.
      Lower Bound Techniques for Geometric Graph Representation
      Sue H. Whitesides*, McGill University
      (914-68-128)
    • 4:30 p.m.
      On-line Algorithms for Compressing Digital Representations of Planar Curves
      Gordon T. Wilfong*, Bell Laboratories
      (914-52-88)
    • 5:00 p.m.
      Issues in Geometric Tolerancing and Metrology
      Chee K. Yap*, Courant Institute, NYU
      (914-68-235)
Inquiries:  meet@ams.org