MPI-INF Logo

MPI-INF D1 Publications

Search the publication database
.
Return

Your search returned the following 6 documents:

  1. A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time
    Edgar A. Ramos, Nancy M. Amato, and Michael T. Goodrich
    Discrete and Computational Geometry 26 (2): 246-265, 2001
  2. Computing the arrangement of curve segments: Divide-and-conquer algorithms via sampling
    Edgar A. Ramos, Nancy M. Amato, and Michael T. Goodrich
    In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), San Francisco, CA, USA, January 9-11, 2000, 2000, 705-706
  3. Linear-Time Triangulation of a Simple Polygon Made Easier Via Randomization
    Nancy M. Amato, Michael T. Goodrich, and Edgar A. Ramos
    In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), Clear Water Bay, Kowloon, Hong Kong, June 12-14, 2000, 2000, 201-212
  4. External-Memory Graph Algorithms
    Yi-Feng Chian, Michael T. Goodrich, Edward Grove, Roberto Tamassia, Darren Erik Vengroff, and Jeffrey Scott Vitter
    In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), San Francisco, California, USA, January, 22nd - 24th, 1995, 139-149
  5. Bounded-independence derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming
    Michael T. Goodrich and Edgar A. Ramos
    Discrete and Computational Geometry 18: 397-420, 1997
  6. Efficient approximation and optimization algorithms for computational metrology
    C.A. Duncan, Michael T. Goodrich, and Edgar A. Ramos
    In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), New Orleans, USA, January 5-7, 1997, 121-130