|
|
|
|
 |
 |
|
 |
 |
|
|||||
 |
 |
 |
 |
 |
 |
|||||
| ||||||||||
| ||||||||||
|
 |
|||||||||
| |
Edgar A. Ramos
|
|||||||||
Research Interests
Computational geometry: randomized algorithms and derandomization;
optimization and approximation algorithms; triangulation and mesh
generation; topological methods and algorithms; and parallel algorithms. |
|
Research Area Algorithms
and Theory |
Research Groups
Algorithm Group |
Research Statement My
work is to design algorithms and data structures for computational
problems that involve geometric objects. These problems arise in a
number of applications: graphics, vision, robotics, scientific
computing, etc. The solutions usually borrow from general techniques in
algorithm design and from discrete and continuous geometry and topology.
Recently, I have worked on the problem of "surface reconstruction" which
consists in connecting a set of sample points into a mesh of triangles
that captures the original surface from which the samples were taken; I
am also interested in related problems like simplification, medial axis
approximation, feature extraction. |
Education PhD, University of Illinois at Urbana-Champaign, 1995. |
Representative Publications S.
Funke and E. A. Ramos. Smooth-Surface Reconstruction in Near-Linear
Time. Proc. 12th ACM-SIAM Symp. Discr. Algorithms (SODA 02),
pp. 781-790, 2002. N.
M. Amato, M. T. Goodrich, and E. A. Ramos. A Randomized Algorithm for
Triangulating a Simple Polygon in Linear Time. 'Discrete Comput. Geom.,
Vol. 26, pp. 246-265, 2001. E.
A. Ramos. An Optimal Deterministic Algorithm for Computing the Diameter
of a 3-D Point Set. Discrete Comput. Geom., Vol. 26, pp. 233-244, 2001. |
|
|
||
|
|||
 |
|
Department of Computer Science,
Thomas M. Siebel Center for Computer Science, 201 N. Goodwin, Urbana, IL
61801-2302. | |
