| 2010 | ||
|---|---|---|
| 49 | Evan VanderZee, Anil N. Hirani, Damrong Guoy, Edgar A. Ramos: Well-Centered Triangulation. SIAM J. Scientific Computing 31(6): 4497-4523 (2010) | |
| 2009 | ||
| 48 | Jingyi Jin, Michael Garland, Edgar A. Ramos: MLS-based scalar fields over triangle meshes and their application in mesh processing. SI3D 2009: 145-153 | |
| 47 | 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) | |
| 46 | Tamal K. Dey, Kuiyu Li, Edgar A. Ramos, Rephael Wenger: Isotopic Reconstruction of Surfaces with Boundaries. Comput. Graph. Forum 28(5): 1371-1382 (2009) | |
| 2008 | ||
| 45 | Edgar A. Ramos: TSP-Based Curve Reconstruction. Encyclopedia of Algorithms 2008 | |
| 44 | Evan VanderZee, Anil N. Hirani, Damrong Guoy, Edgar A. Ramos: Well-Centered Triangulation CoRR abs/0802.2108: (2008) | |
| 43 | 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. Geometry Appl. 18(1/2): 29-61 (2008) | |
| 42 | Joachim Giesen, Edgar A. Ramos, Bardia Sadri: Medial Axis Approximation and Unstable Flow Complex. Int. J. Comput. Geometry Appl. 18(6): 533-565 (2008) | |
| 2007 | ||
| 41 | Evan VanderZee, Anil N. Hirani, Damrong Guoy, Edgar A. Ramos: Well-centered Planar Triangulation - An Iterative Approach. IMR 2007: 121-138 | |
| 40 | Edgar A. Ramos, Bardia Sadri: Geometric and topological guarantees for the WRAP reconstruction algorithm. SODA 2007: 1086-1095 | |
| 39 | Siu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos: Delaunay refinement for piecewise smooth complexes. SODA 2007: 1096-1105 | |
| 38 | Siu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos, Tathagata Ray: Sampling and Meshing a Surface with Guaranteed Topology and Geometry. SIAM J. Comput. 37(4): 1199-1227 (2007) | |
| 2006 | ||
| 37 | Siu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos, Rephael Wenger: Anisotropic surface meshing. SODA 2006: 202-211 | |
| 36 | Joachim Giesen, Edgar A. Ramos, Bardia Sadri: Medial axis approximation and unstable flow complex. Symposium on Computational Geometry 2006: 327-336 | |
| 2005 | ||
| 35 | Siu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos: Manifold reconstruction from point samples. SODA 2005: 1018-1027 | |
| 34 | 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. Symposium on Computational Geometry 2005: 218-227 | |
| 33 | Siu-Wing Cheng, Stefan Funke, Mordecai J. Golin, Piyush Kumar, Sheung-Hung Poon, Edgar A. Ramos: Curve reconstruction from noisy samples. Comput. Geom. 31(1-2): 63-100 (2005) | |
| 32 | Siu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos, Tathagata Ray: Quality Meshing of Polyhedra with Small Angles. Int. J. Comput. Geometry Appl. 15(4): 421-461 (2005) | |
| 31 | Ernst Althaus, Stefan Funke, Sariel Har-Peled, Jochen Könemann, Edgar A. Ramos, Martin Skutella: Approximating k-hop minimum-spanning trees. Oper. Res. Lett. 33(2): 115-120 (2005) | |
| 2004 | ||
| 30 | Siu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos, Tathagata Ray: Sampling and meshing a surface with guaranteed topology and geometry. Symposium on Computational Geometry 2004: 280-289 | |
| 29 | Siu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos, Tathagata Ray: Quality meshing for polyhedra with small angles. Symposium on Computational Geometry 2004: 290-299 | |
| 2003 | ||
| 28 | Siu-Wing Cheng, Stefan Funke, Mordecai J. Golin, Piyush Kumar, Sheung-Hung Poon, Edgar A. Ramos: Curve reconstruction from noisy samples. Symposium on Computational Geometry 2003: 302-311 | |
| 2002 | ||
| 27 | Stefan Funke, Edgar A. Ramos: Smooth-surface reconstruction in near-linear time. SODA 2002: 781-790 | |
| 2001 | ||
| 26 | Stefan Funke, Edgar A. Ramos: Reconstructing a collection of curves with corners and endpoints. SODA 2001: 344-353 | |
| 25 | Sanjeev Mahajan, Edgar A. Ramos, K. V. Subrahmanyam: Solving Some Discrepancy Problems in NC. Algorithmica 29(3): 371-395 (2001) | |
| 24 | Edgar A. Ramos: An Optimal Deterministic Algorithm for Computing the Diameter of a Three-Dimensional Point Set. Discrete & Computational Geometry 26(2): 233-244 (2001) | |
| 23 | Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos: A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time. Discrete & Computational Geometry 26(2): 245-265 (2001) | |
| 22 | Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos: Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems. Int. J. Comput. Geometry Appl. 11(3): 305-337 (2001) | |
| 2000 | ||
| 21 | 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 | |
| 20 | Edgar A. Ramos: Linear programming queries revisited. Symposium on Computational Geometry 2000: 176-181 | |
| 19 | Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos: Linear-time triangulation of a simple polygon made easier via randomization. Symposium on Computational Geometry 2000: 201-212 | |
| 18 | Edgar A. Ramos: Deterministic algorithms for 3-D diameter and some 2-D lower envelopes. Symposium on Computational Geometry 2000: 290-299 | |
| 17 | Tamal K. Dey, Kurt Mehlhorn, Edgar A. Ramos: Curve reconstruction: Connecting dots with good reason. Comput. Geom. 15(4): 229-244 (2000) | |
| 1999 | ||
| 16 | Tamal K. Dey, Kurt Mehlhorn, Edgar A. Ramos: Curve Reconstruction: Connecting Dots with Good Reason. Symposium on Computational Geometry 1999: 197-206 | |
| 15 | Edgar A. Ramos: On Range Reporting, Ray Shooting and k-Level Construction. Symposium on Computational Geometry 1999: 390-399 | |
| 1998 | ||
| 14 | Ka Wong Chong, Edgar A. Ramos: Improved Deterministic Parallel Padded Sorting. ESA 1998: 405-416 | |
| 13 | Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos: Randomized External-Memory Algorithms for Some Geometric Problems. Symposium on Computational Geometry 1998: 259-268 | |
| 1997 | ||
| 12 | Sanjeev Mahajan, Edgar A. Ramos, K. V. Subrahmanyam: Solving Some Discrepancy Problems in NC. FSTTCS 1997: 22-36 | |
| 11 | Christian A. Duncan, Michael T. Goodrich, Edgar A. Ramos: Efficient Approximation and Optimization Algorithms for Computational Metrology. SODA 1997: 121-130 | |
| 10 | Edgar A. Ramos: Construction of 1-d Lower Envelopes and Applications. Symposium on Computational Geometry 1997: 57-66 | |
| 9 | Edgar A. Ramos: Intersection of Unit-balls and Diameter of a Point Set in 3. Comput. Geom. 8: 57-65 (1997) | |
| 8 | Herbert Edelsbrunner, Edgar A. Ramos: Inclusion - Exclusion Complexes for Pseudodisk Collections. Discrete & Computational Geometry 17(3): 287-306 (1997) | |
| 7 | Michael T. Goodrich, Edgar A. Ramos: Bounded-Independence Derandomization of Geometric Partitioning with Applications to Parallel Fixed-Dimensional Linear Programming. Discrete & Computational Geometry 18(4): 397-420 (1997) | |
| 1996 | ||
| 6 | Nancy M. Amato, Edgar A. Ramos: On Computing Voronoi Diagrams by Divide-Prune-and-Conquer. Symposium on Computational Geometry 1996: 166-175 | |
| 5 | Edgar A. Ramos: Equipartition of Mass Distributions by Hyperplanes. Discrete & Computational Geometry 15(2): 147-167 (1996) | |
| 4 | Edgar A. Ramos: The Number of Extreme Triples of a Planar Point Set. Discrete & Computational Geometry 16(1): 1-19 (1996) | |
| 1995 | ||
| 3 | Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos: Computing faces in segment and simplex arrangements (Preliminary Version). STOC 1995: 672-682 | |
| 1994 | ||
| 2 | Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos: Parallel Algorithms for Higher-Dimensional Convex Hulls FOCS 1994: 683-694 | |
| 1992 | ||
| 1 | M. V. Ramakrishna, Edgar A. Ramos: Optimal Distribution of Signatures in Signature Hashing. IEEE Trans. Knowl. Data Eng. 4(1): 83-88 (1992) | |