Edgar A. Ramos

发表

Parallel algorithms for higher-dimensional convex hulls

Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos, 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

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

Tamal K. Dey, Edgar A. Ramos, Joachim Giesen, 2008, Int. J. Comput. Geom. Appl..

Delaunay Refinement for Piecewise Smooth Complexes

Tamal K. Dey, Edgar A. Ramos, Siu-Wing Cheng, 2007, SODA '07.

Eurographics Symposium on Geometry Processing 2009 Isotopic Reconstruction of Surfaces with Boundaries

Tamal K. Dey, Rephael Wenger, Edgar A. Ramos, 2022 .

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

Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos, 2000, SODA '00.

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

Michael Garland, Jingyi Jin, Edgar A. Ramos, 2009, I3D '09.

Linear programming queries revisited

Edgar A. Ramos, 2000, SCG '00.

Inclusion-exclusion complexes for pseudodisk collections

Herbert Edelsbrunner, Edgar A. Ramos, H. Edelsbrunner, 1997, Discret. Comput. Geom..

Sampling and Meshing a Surface with Guaranteed Topology and Geometry

Tamal K. Dey, Edgar A. Ramos, Siu-Wing Cheng, 2007, SIAM J. Comput..

Improved Deterministic Parallel Padded Sorting

Edgar A. Ramos, Ka Wong Chong, E. Ramos, 1998, ESA.

Reconstructing a collection of curves with corners and endpoints

Stefan Funke, Edgar A. Ramos, S. Funke, 2001, SODA '01.

Construction of 1-d lower envelopes and applications

Edgar A. Ramos, 1997, SCG '97.

A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time

Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos, 2001, Discret. Comput. Geom..

Approximating k-hop minimum-spanning trees

Ernst Althaus, Martin Skutella, Jochen Könemann, 2005, Oper. Res. Lett..

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

Edgar A. Ramos, 2000, SCG '00.

Curve reconstruction from noisy samples

Stefan Funke, Sheung-Hung Poon, Edgar A. Ramos, 2003, SCG '03.

Randomized external-memory algorithms for some geometric problems

Kurt Mehlhorn, Ulrich Meyer, Paolo Ferragina, 1998, SCG '98.

Optimal Distribution of Signatures in Signature Hashing

M. V. Ramakrishna, Edgar A. Ramos, 1992, IEEE Trans. Knowl. Data Eng..

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

Edgar A. Ramos, 2001, Discret. Comput. Geom..

Solving Some Discrepancy Problems in NC

Edgar A. Ramos, K. V. Subrahmanyam, Sanjeev Mahajan, 2001, Algorithmica.

Quality Meshing of Polyhedra with Small Angles

Tamal K. Dey, Tathagata Ray, Edgar A. Ramos, 2005, Int. J. Comput. Geom. Appl..

On range reporting, ray shooting and k-level construction

Edgar A. Ramos, E. Ramos, 1999, SCG '99.

Curve reconstruction: Connecting dots with good reason

Kurt Mehlhorn, Tamal K. Dey, Edgar A. Ramos, 2000, Comput. Geom..

Medial Axis Approximation and Unstable Flow Complex

Edgar A. Ramos, Joachim Giesen, Bardia Sadri, 2008, Int. J. Comput. Geom. Appl..

TSP-Based Curve Reconstruction

Edgar A. Ramos, 2008, Encyclopedia of Algorithms.

Curve reconstruction: connecting dots with good reason

Kurt Mehlhorn, Tamal K. Dey, Edgar A. Ramos, 1999, SCG '99.

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

Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos, 2000, SCG '00.

Curve reconstruction from noisy samples

Stefan Funke, Sheung-Hung Poon, Edgar A. Ramos, 2005, Comput. Geom..

A Mathematical Assessment of the Isolation Tree Method for Outliers Detection in Big Data

Edgar A. Ramos, Fernando A. Morales, Fernando A. Morales, 2020, 2004.04512.

Surface Reconstruction in almost Linear Time under Locally Uniform Sampling

Stefan Funke, Tamal K. Dey, Edgar A. Ramos, 2001 .

I/O-Efficient Construction of Voronoi Diagrams

Edgar A. Ramos, Piyush Kumar, 2002 .

The number of extreme triples of a planar point set

Edgar A. Ramos, 1996, Discret. Comput. Geom..

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

Edgar A. Ramos, E. Ramos, 1997, Comput. Geom..

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

Michael T. Goodrich, Edgar A. Ramos, M. Goodrich, 1997, Discret. Comput. Geom..

Medial axis approximation and unstable flow complex

Edgar A. Ramos, Joachim Giesen, Bardia Sadri, 2006, SCG '06.

Efficient approximation and optimization algorithms for computational metrology

Michael T. Goodrich, Edgar A. Ramos, Christian A. Duncan, 1997, SODA '97.

On computing Voronoi diagrams by divide-prune-and-conquer

Nancy M. Amato, Edgar A. Ramos, N. Amato, 1996, SCG '96.

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

Kurt Mehlhorn, Ulrich Meyer, Paolo Ferragina, 2001, Int. J. Comput. Geom. Appl..

Quality meshing for polyhedra with small angles

Tamal K. Dey, Edgar A. Ramos, Siu-Wing Cheng, 2004, SCG '04.

Well-centered Planar Triangulation - An Iterative Approach

Damrong Guoy, Edgar A. Ramos, Anil N. Hirani, 2008, IMR.

Solving Some Discrepancy Problems in NC

Edgar A. Ramos, K. V. Subrahmanyam, Sanjeev Mahajan, 1997, Algorithmica.

I/O-optimal computation of segment intersections

Kurt Mehlhorn, Ulrich Meyer, Paolo Ferragina, 1998, External Memory Algorithms.

Equipartition of mass distributions by hyperplanes

Edgar A. Ramos, E. Ramos, 1996, Discret. Comput. Geom..

Well-Centered Triangulation pdf

Damrong Guoy, Edgar A. Ramos, Anil N. Hirani, 2008, SIAM J. Sci. Comput..

Sampling and meshing a surface with guaranteed topology and geometry

Tamal K. Dey, Edgar A. Ramos, Siu-Wing Cheng, 2004, SCG '04.

Computational Geometry: Theory and Applications Geometric and Combinatorial Properties of Well-centered Triangulations in Three and Higher Dimensions pdf

Damrong Guoy, Edgar A. Ramos, Anil N. Hirani, 2022 .

Geometric and topological guarantees for the WRAP reconstruction algorithm

Edgar A. Ramos, Bardia Sadri, 2007, SODA '07.

Smooth-surface reconstruction in near-linear time

Stefan Funke, Edgar A. Ramos, S. Funke, 2002, SODA '02.

Anisotropic surface meshing

Tamal K. Dey, Rephael Wenger, Edgar A. Ramos, 2006, SODA '06.

Manifold reconstruction from point samples

Tamal K. Dey, Edgar A. Ramos, Siu-Wing Cheng, 2005, SODA '05.

Computing faces in segment and simplex arrangements

Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos, 1995, STOC '95.

Critical points of the distance to an epsilon-sampling of a surface and flow-complex-based surface reconstruction

Tamal K. Dey, Edgar A. Ramos, Joachim Giesen, 2005, Symposium on Computational Geometry.

Surface and Medial Axis Topology Through Distance Flows Induced by Discrete Samples

Edgar A. Ramos, Bardia Sadri, E. Ramos, 2006 .

The number of 3-sets of a finite point set in the plane

Edgar A. Ramos, 1993 .

An algorithm for intersecting equal radius balls in R\u3\d

Edgar A. Ramos, 1994 .