Edgar A. Ramos

SODA Conference 2007 Conference Paper

Delaunay refinement for piecewise smooth complexes

• Siu-Wing Cheng
• Tamal K. Dey
• Edgar A. Ramos

SODA Conference 2007 Conference Paper

Geometric and topological guarantees for the WRAP reconstruction algorithm

• Edgar A. Ramos
• Bardia Sadri

SODA Conference 2006 Conference Paper

Anisotropic surface meshing

• Siu-Wing Cheng
• Tamal K. Dey
• Edgar A. Ramos
• Rephael Wenger

SODA Conference 2005 Conference Paper

Manifold reconstruction from point samples

• Siu-Wing Cheng
• Tamal K. Dey
• Edgar A. Ramos

SODA Conference 2002 Conference Paper

Smooth-surface reconstruction in near-linear time

• Stefan Funke
• Edgar A. Ramos

SODA Conference 2001 Conference Paper

Reconstructing a collection of curves with corners and endpoints

• Stefan Funke
• Edgar A. Ramos

SODA Conference 2000 Conference Paper

Computing the arrangement of curve segments: divide-and-conquer algorithms via sampling

• Nancy M. Amato
• Michael T. Goodrich
• Edgar A. Ramos

SODA Conference 1997 Conference Paper

Efficient Approximation and Optimization Algorithms for Computational Metrology

• Christian A. Duncan
• Michael T. Goodrich
• Edgar A. Ramos

STOC Conference 1995 Conference Paper

Computing faces in segment and simplex arrangements (Preliminary Version)

• Nancy M. Amato
• Michael T. Goodrich
• Edgar A. Ramos

FOCS Conference 1994 Conference Paper

Parallel Algorithms for Higher-Dimensional Convex Hulls

• Nancy M. Amato
• Michael T. Goodrich
• Edgar A. Ramos

We give fast randomized and deterministic parallel methods for constructing convex hulls in R/sup d/, for any fixed d. Our methods are for the weakest shared-memory model, the EREW PRAM, and have optimal work bounds (with high probability for the randomized methods). In particular, we show that the convex hull of n points in R/sup d/ can be constructed in O(log n) time using O(n log n+n/sup [d/2]/) work, with high probability. We also show that it can be constructed deterministically in O(log/sup 2/ n) time using O(n log n) work for d=3 and in O(log n) time using O(n/sup [d/2]/ log/sup c([d/2]-[d/2]/) n) work for d/spl ges/4, where c>0 is a constant which is optimal for even d/spl ges/4. We also show how to make our 3-dimensional methods output-sensitive with only a small increase in running time. These methods can be applied to other problems as well. >