default search action
Edgar A. Ramos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [i3]Fernando A. Morales, Jorge M. Ramírez, Edgar A. Ramos:
A Mathematical Assessment of the Isolation Tree Method for Data Anomaly Detection in Big Data. CoRR abs/2004.04512 (2020)
2010 – 2019
- 2013
- [j21]Evan VanderZee, Anil N. Hirani, Damrong Guoy, Vadim Zharnitsky, Edgar A. Ramos:
Geometric and combinatorial properties of well-centered triangulations in three and higher dimensions. Comput. Geom. 46(6): 700-724 (2013) - 2010
- [j20]Siu-Wing Cheng
, Tamal K. Dey, Edgar A. Ramos:
Delaunay Refinement for Piecewise Smooth Complexes. Discret. Comput. Geom. 43(1): 121-166 (2010) - [j19]Evan VanderZee, Anil N. Hirani, Damrong Guoy, Edgar A. Ramos:
Well-Centered Triangulation. SIAM J. Sci. Comput. 31(6): 4497-4523 (2010)
2000 – 2009
- 2009
- [j18]Tamal K. Dey, Kuiyu Li, Edgar A. Ramos, Rephael Wenger:
Isotopic Reconstruction of Surfaces with Boundaries. Comput. Graph. Forum 28(5): 1371-1382 (2009) - [c28]Jingyi Jin, Michael Garland, Edgar A. Ramos:
MLS-based scalar fields over triangle meshes and their application in mesh processing. SI3D 2009: 145-153 - [i2]Evan VanderZee, Anil N. Hirani, Damrong Guoy, Vadim Zharnitsky, Edgar A. Ramos:
Geometric and Combinatorial Properties of Well-Centered Triangulations in Three and Higher Dimensions. CoRR abs/0912.3097 (2009) - 2008
- [j17]Tamal K. Dey, Joachim Giesen, Edgar A. Ramos, Bardia Sadri:
Critical Points of Distance to an epsilon-Sampling of a Surface and Flow-Complex-Based Surface Reconstruction. Int. J. Comput. Geom. Appl. 18(1/2): 29-61 (2008) - [j16]Joachim Giesen, Edgar A. Ramos, Bardia Sadri:
Medial Axis Approximation and Unstable Flow Complex. Int. J. Comput. Geom. Appl. 18(6): 533-565 (2008) - [r1]Edgar A. Ramos:
TSP-Based Curve Reconstruction. Encyclopedia of Algorithms 2008 - [i1]Evan VanderZee, Anil N. Hirani, Damrong Guoy, Edgar A. Ramos:
Well-Centered Triangulation. CoRR abs/0802.2108 (2008) - 2007
- [j15]Siu-Wing Cheng
Sampling and Meshing a Surface with Guaranteed Topology and Geometry. SIAM J. Comput. 37(4): 1199-1227 (2007) - [c27]Evan VanderZee, Anil N. Hirani, Damrong Guoy, Edgar A. Ramos:
Well-centered Planar Triangulation - An Iterative Approach. IMR 2007: 121-138 - [c26]Edgar A. Ramos, Bardia Sadri:
Geometric and topological guarantees for the WRAP reconstruction algorithm. SODA 2007: 1086-1095 - [c25]Siu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos:
Delaunay refinement for piecewise smooth complexes. SODA 2007: 1096-1105 - 2006
- [c24]Joachim Giesen, Edgar A. Ramos, Bardia Sadri:
Medial axis approximation and unstable flow complex. SCG 2006: 327-336 - [c23]Siu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos, Rephael Wenger:
Anisotropic surface meshing. SODA 2006: 202-211 - 2005
- [j14]Siu-Wing Cheng
Curve reconstruction from noisy samples. Comput. Geom. 31(1-2): 63-100 (2005) - [j13]Siu-Wing Cheng
Quality Meshing of Polyhedra with Small Angles. Int. J. Comput. Geom. Appl. 15(4): 421-461 (2005) - [j12]Ernst Althaus, Stefan Funke, Sariel Har-Peled
Approximating k-hop minimum-spanning trees. Oper. Res. Lett. 33(2): 115-120 (2005) - [c22]Tamal K. Dey, Joachim Giesen, Edgar A. Ramos, Bardia Sadri:
Critical points of the distance to an epsilon-sampling of a surface and flow-complex-based surface reconstruction. SCG 2005: 218-227 - [c21]Siu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos:
Manifold reconstruction from point samples. SODA 2005: 1018-1027 - 2004
- [c20]Siu-Wing Cheng
Sampling and meshing a surface with guaranteed topology and geometry. SCG 2004: 280-289 - [c19]Siu-Wing Cheng
Quality meshing for polyhedra with small angles. SCG 2004: 290-299 - 2003
- [c18]Siu-Wing Cheng
Curve reconstruction from noisy samples. SCG 2003: 302-311 - 2002
- [c17]Stefan Funke, Edgar A. Ramos:
Smooth-surface reconstruction in near-linear time. SODA 2002: 781-790 - 2001
- [j11]Sanjeev Mahajan, Edgar A. Ramos, K. V. Subrahmanyam
Solving Some Discrepancy Problems in NC. Algorithmica 29(3): 371-395 (2001) - [j10]Edgar A. Ramos:
An Optimal Deterministic Algorithm for Computing the Diameter of a Three-Dimensional Point Set. Discret. Comput. Geom. 26(2): 233-244 (2001) - [j9]Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos:
A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time. Discret. Comput. Geom. 26(2): 245-265 (2001) - [j8]Andreas Crauser, Paolo Ferragina
Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems. Int. J. Comput. Geom. Appl. 11(3): 305-337 (2001) - [c16]Stefan Funke, Edgar A. Ramos:
Reconstructing a collection of curves with corners and endpoints. SODA 2001: 344-353 - 2000
- [j7]Tamal K. Dey, Kurt Mehlhorn, Edgar A. Ramos:
Curve reconstruction: Connecting dots with good reason. Comput. Geom. 15(4): 229-244 (2000) - [c15]Edgar A. Ramos:
Linear programming queries revisited. SCG 2000: 176-181 - [c14]Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos:
Linear-time triangulation of a simple polygon made easier via randomization. SCG 2000: 201-212 - [c13]Edgar A. Ramos:
Deterministic algorithms for 3-D diameter and some 2-D lower envelopes. SCG 2000: 290-299 - [c12]Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos:
Computing the arrangement of curve segments: divide-and-conquer algorithms via sampling. SODA 2000: 705-706
1990 – 1999
- 1999
- [c11]Tamal K. Dey, Kurt Mehlhorn, Edgar A. Ramos:
Curve Reconstruction: Connecting Dots with Good Reason. SCG 1999: 197-206 - [c10]Edgar A. Ramos:
On Range Reporting, Ray Shooting and k-Level Construction. SCG 1999: 390-399 - 1998
- [c9]Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos:
Randomized External-Memory Algorithms for Some Geometric Problems. SCG 1998: 259-268 - [c8]Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos:
I/O-optimal computation of segment intersections. External Memory Algorithms 1998: 131-138 - [c7]Ka Wong Chong, Edgar A. Ramos:
Improved Deterministic Parallel Padded Sorting. ESA 1998: 405-416 - 1997
- [j6]Edgar A. Ramos:
Intersection of Unit-balls and Diameter of a Point Set in 3. Comput. Geom. 8: 57-65 (1997) - [j5]Herbert Edelsbrunner, Edgar A. Ramos:
Inclusion - Exclusion Complexes for Pseudodisk Collections. Discret. Comput. Geom. 17(3): 287-306 (1997) - [j4]Michael T. Goodrich, Edgar A. Ramos:
Bounded-Independence Derandomization of Geometric Partitioning with Applications to Parallel Fixed-Dimensional Linear Programming. Discret. Comput. Geom. 18(4): 397-420 (1997) - [c6]Edgar A. Ramos:
Construction of 1-d Lower Envelopes and Applications. SCG 1997: 57-66 - [c5]Sanjeev Mahajan, Edgar A. Ramos, K. V. Subrahmanyam
Solving Some Discrepancy Problems in NC. FSTTCS 1997: 22-36 - [c4]Christian A. Duncan, Michael T. Goodrich, Edgar A. Ramos:
Efficient Approximation and Optimization Algorithms for Computational Metrology. SODA 1997: 121-130 - 1996
- [j3]Edgar A. Ramos:
Equipartition of Mass Distributions by Hyperplanes. Discret. Comput. Geom. 15(2): 147-167 (1996) - [j2]Edgar A. Ramos:
The Number of Extreme Triples of a Planar Point Set. Discret. Comput. Geom. 16(1): 1-19 (1996) - [c3]Nancy M. Amato, Edgar A. Ramos:
On Computing Voronoi Diagrams by Divide-Prune-and-Conquer. SCG 1996: 166-175 - 1995
- [c2]Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos:
Computing faces in segment and simplex arrangements (Preliminary Version). STOC 1995: 672-682 - 1994
- [c1]Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos:
Parallel Algorithms for Higher-Dimensional Convex Hulls. FOCS 1994: 683-694 - 1992
- [j1]M. V. Ramakrishna, Edgar A. Ramos:
Optimal Distribution of Signatures in Signature Hashing. IEEE Trans. Knowl. Data Eng. 4(1): 83-88 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:56 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: