# Edgar A. Ramos

According to our database

Collaborative distances:

^{1}, Edgar A. Ramos authored at least 42 papers between 1992 and 2013.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2013

Geometric and combinatorial properties of well-centered triangulations in three and higher dimensions.

Comput. Geom., 2013

2010

Well-Centered Triangulation.

SIAM J. Scientific Computing, 2010

Delaunay Refinement for Piecewise Smooth Complexes.

Discrete & Computational Geometry, 2010

2009

Isotopic Reconstruction of Surfaces with Boundaries.

Comput. Graph. Forum, 2009

MLS-based scalar fields over triangle meshes and their application in mesh processing.

Proceedings of the 2009 Symposium on Interactive 3D Graphics, 2009

2008

TSP-Based Curve Reconstruction.

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Medial Axis Approximation and Unstable Flow Complex.

Int. J. Comput. Geometry Appl., 2008

Critical Points of Distance to an epsilon-Sampling of a Surface and Flow-Complex-Based Surface Reconstruction.

Int. J. Comput. Geometry Appl., 2008

2007

Sampling and Meshing a Surface with Guaranteed Topology and Geometry.

SIAM J. Comput., 2007

Geometric and topological guarantees for the WRAP reconstruction algorithm.

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Well-centered Planar Triangulation - An Iterative Approach.

Proceedings of the 16th International Meshing Roundtable, 2007

2006

Anisotropic surface meshing.

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005

Approximating

*k*-hop minimum-spanning trees.
Oper. Res. Lett., 2005

Quality Meshing of Polyhedra with Small Angles.

Int. J. Comput. Geometry Appl., 2005

Curve reconstruction from noisy samples.

Comput. Geom., 2005

Manifold reconstruction from point samples.

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2002

Smooth-surface reconstruction in near-linear time.

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001

Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems.

Int. J. Comput. Geometry Appl., 2001

An Optimal Deterministic Algorithm for Computing the Diameter of a Three-Dimensional Point Set.

Discrete & Computational Geometry, 2001

A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time.

Discrete & Computational Geometry, 2001

Solving Some Discrepancy Problems in NC.

Algorithmica, 2001

Reconstructing a collection of curves with corners and endpoints.

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000

Curve reconstruction: Connecting dots with good reason.

Comput. Geom., 2000

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

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Deterministic algorithms for 3-D diameter and some 2-D lower envelopes.

Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

Linear programming queries revisited.

Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

Linear-time triangulation of a simple polygon made easier via randomization.

Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

1999

On Range Reporting, Ray Shooting and

*k*-Level Construction.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998

Improved Deterministic Parallel Padded Sorting.

Proceedings of the Algorithms, 1998

I/O-optimal computation of segment intersections.

Proceedings of the External Memory Algorithms, 1998

Randomized External-Memory Algorithms for Some Geometric Problems.

Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997

Bounded-Independence Derandomization of Geometric Partitioning with Applications to Parallel Fixed-Dimensional Linear Programming.

Discrete & Computational Geometry, 1997

Inclusion - Exclusion Complexes for Pseudodisk Collections.

Discrete & Computational Geometry, 1997

Intersection of Unit-balls and Diameter of a Point Set in 3.

Comput. Geom., 1997

Efficient Approximation and Optimization Algorithms for Computational Metrology.

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Construction of 1-d Lower Envelopes and Applications.

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996

Equipartition of Mass Distributions by Hyperplanes.

Discrete & Computational Geometry, 1996

The Number of Extreme Triples of a Planar Point Set.

Discrete & Computational Geometry, 1996

On Computing Voronoi Diagrams by Divide-Prune-and-Conquer.

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

1995

Computing faces in segment and simplex arrangements (Preliminary Version).

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

1994

Parallel Algorithms for Higher-Dimensional Convex Hulls

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1992

Optimal Distribution of Signatures in Signature Hashing.

IEEE Trans. Knowl. Data Eng., 1992