Your search returned the following 25 documents:

25. Approximating k-Hop Minimum-Spanning Trees
    Ernst Althaus, Stefan Funke, Sariel Har-Peled, Jochen Könemann, Edgar A. Ramos, and Martin Skutella
    Operations Research Letters 33 (2): 115-120, 2005
    
24. Curve Reconstruction from Noisy Samples
    Siu-Wing Cheng, Stefan Funke, Mordecai J. Golin, Piyush Kumar, Sheung-Hung Poon, and Edgar A. Ramos
    In: Proceedings of the 19th Annual Symposium on Computational Geometry (SCG-03), San Diego, USA, June, 08 - 10, 2003, 420-429
    
23. Smooth-Surface Reconstruction in Near-Linear Time
    Stefan Funke and Edgar A. Ramos
    In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02), San Francisco, USA, 2002, 781-790
    
22. 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
    
21. An Optimal Deterministic Algorithm for Computing the Diameter of a Three-Dimensional Point Set
    Edgar A. Ramos
    Discrete and Computational Geometry 26 (2): 233-244, 2001
    
20. Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems
    Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, and Edgar A. Ramos
    International Journal of Computational Geometry & Applications 11 (3): 305-337, 2001. Note: Special issue edited by J Hershberger: Selected Papers from the Fourteenth ACM Symposium on Computational Geometry, Minneapolis, MN, June, 1998
    
19. Reconstructing a Collection of Curves with Corners and Endpoints
    Stefan Funke and Edgar A. Ramos
    In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), Washington DC, USA, January, 7-9, 2001, 2001, 344-353
    
18. Solving Some Discrepancy Problems in NC
    Edgar A. Ramos
    Algorithmica 29 (3): 371-395, 2001
    
17. Surface Reconstruction in almost Linear Time under Locally Uniform Sampling
    Tamal K. Dey, Stefan Funke, and Edgar A. Ramos
    In: Proceedings of the 17th European Workshop on Computational Geometry (EWCG-01), Berlin, Germany, March, 26-28, 2001, 129-132
    
16. 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
    
15. Curve reconstruction: Connecting dots with good reason
    Tamal K. Dey, Kurt Mehlhorn, and Edgar A. Ramos
    Computational Geometry 15 (4): 229-244, 2000
    
    
14. Deterministic Algorithms for 3-D Diameter and some 2-D Lower Envelopes
    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, 290-299
    
13. 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
    
12. Linear Programming Queries Revisited
    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, 176-181
    
11. Curve reconstruction: Connecting dots with good reason
    Tamal K. Dey, Kurt Mehlhorn, and Edgar A. Ramos
    In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), Miami Beach, Florida, June 13-16, 1999, 1999, 197-206
    
10. I/O-optimal computation of segment intersections
    Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, and Edgar A. Ramos
    In: Proceedings of the DIMACS Workshop on External Algorithms and Visualization, New Brunswick, New Jersey, May 20-22, 1998, 1999, 131-138
    
9. On range reporting, ray shooting and $k$-level construction
   Edgar A. Ramos
   In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), Miami Beach, Florida, June 13-16, 1999, 1999, 390-399
   
8. Improved deterministic parallel padded sorting
   Ka Wong Chong and Edgar A. Ramos
   In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), Venice, Italy, August 24-26, 1998, 405-416
   
7. Randomized External-Memory Algorithms for some Geometric Problems
   Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, and Edgar A. Ramos
   In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), Minneapolis, Minnesota, June 7-10, 1998, 259-268
   
   
6. 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
   
5. Construction of 1-d lower envelopes and applications
   Edgar A. Ramos
   In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), Nice, France, June, 4-6, 1997, 57-66
   
4. 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
   
3. Inclusion-exclusion complexes for pseudo-disk collections
   Herbert Edelsbrunner and Edgar A. Ramos
   Discrete and Computational Geometry 17: 287-306, 1997
   
2. Intersection of unit-balls and diameter of a point set in R³
   Edgar A. Ramos
   Computational Geometry Theory and Applications 8: 57-65, 1997
   
1. Solving some discrepancy problems in NC
   Sanjeev Mahajan, Edgar A. Ramos, and K. V. Subrahmanyam
   In: Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS-97), Kharagpur, India, December 18-20, 1997, 1997, 22-36