The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Edgar A. Ramos: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  40. Well-centered Planar Triangulation - An Iterative Approach. [Citation Graph (, )][DBLP]


  41. MLS-based scalar fields over triangle meshes and their application in mesh processing. [Citation Graph (, )][DBLP]


  42. Isotopic Reconstruction of Surfaces with Boundaries. [Citation Graph (, )][DBLP]


  43. Well-Centered Triangulation [Citation Graph (, )][DBLP]


  44. Geometric and Combinatorial Properties of Well-Centered Triangulations in Three and Higher Dimensions [Citation Graph (, )][DBLP]


  45. Delaunay Refinement for Piecewise Smooth Complexes. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.011secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002