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

Search the dblp DataBase

Title:
Author:
Alper Üngör: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Alper Üngör
    Tiling 3d euclidean space with acute tetrahedra. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:169-172 [Conf]
  2. Sariel Har-Peled, Alper Üngör
    A time-optimal delaunay refinement algorithm in two dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:228-236 [Conf]
  3. Daniel A. Spielman, Shang-Hua Teng, Alper Üngör
    Parallel Delaunay Refinement with Off-Centers. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2004, pp:812-819 [Conf]
  4. Xiang-Yang Li, Shang-Hua Teng, Alper Üngör
    Simultaneous Refinement and Coarsening: Adaptive Meshing with Moving Boundaries. [Citation Graph (0, 0)][DBLP]
    IMR, 1998, pp:201-210 [Conf]
  5. Xiang-Yang Li, Shang-Hua Teng, Alper Üngör
    Biting Spheres in 3D. [Citation Graph (0, 0)][DBLP]
    IMR, 1999, pp:85-95 [Conf]
  6. Xiang-Yang Li, Shang-Hua Teng, Alper Üngör
    Biting Ellipses to Generate Anisotropic Mesh. [Citation Graph (0, 0)][DBLP]
    IMR, 1999, pp:97-108 [Conf]
  7. Jeff Erickson, Damrong Guoy, John M. Sullivan, Alper Üngör
    Building Space-Time Meshes Over Arbitrary Spatial Domains. [Citation Graph (0, 0)][DBLP]
    IMR, 2002, pp:391-402 [Conf]
  8. Daniel A. Spielman, Shang-Hua Teng, Alper Üngör
    Parallel Delaunay Refinement: Algorithms And Analyses. [Citation Graph (0, 0)][DBLP]
    IMR, 2002, pp:205-217 [Conf]
  9. Alper Üngör, Alla Sheffer
    Tent-Pitcher: A Meshing Algorithm for Space-Time Discontinuous Galerkin Methods. [Citation Graph (0, 0)][DBLP]
    IMR, 2000, pp:111-122 [Conf]
  10. Elif Akçali, Alper Üngör
    Approximation Algorithms for Degree-Constrained Bipartite Network Flow. [Citation Graph (0, 0)][DBLP]
    ISCIS, 2003, pp:163-170 [Conf]
  11. Herbert Edelsbrunner, Alper Üngör
    Relaxed Scheduling in Dynamic Skin Triangulation. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:135-151 [Conf]
  12. Alper Üngör
    O.-Centers: A New Type of Steiner Points for Computing Size-Optimal Quality-Guaranteed Delaunay Triangulations. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:152-161 [Conf]
  13. Alla Sheffer, Alper Üngör
    Efficient adaptive meshing of parametric models. [Citation Graph (0, 0)][DBLP]
    Symposium on Solid Modeling and Applications, 2001, pp:59-70 [Conf]
  14. Daniel A. Spielman, Shang-Hua Teng, Alper Üngör
    Time complexity of practical parallel steiner point insertion algorithms. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:267-268 [Conf]
  15. Herbert Edelsbrunner, Xiang-Yang Li, Gary L. Miller, Andreas Stathopoulos, Dafna Talmor, Shang-Hua Teng, Alper Üngör, Noel Walkington
    Smoothing and cleaning up slivers. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:273-277 [Conf]
  16. David Eppstein, John M. Sullivan, Alper Üngör
    Tiling space and slabs with acute tetrahedra. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:27, n:3, pp:237-255 [Journal]
  17. Jeff Erickson, Damrong Guoy, John M. Sullivan, Alper Üngör
    Building Space-Time Meshes over Arbitrary Spatial Domains [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  18. Daniel A. Spielman, Shang-Hua Teng, Alper Üngör
    Parallel Delaunay Refinement: Algorithms and Analyses [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  19. David Eppstein, John M. Sullivan, Alper Üngör
    Tiling space and slabs with acute tetrahedra [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  20. Herbert Edelsbrunner, Alper Üngör
    Relaxed Scheduling in Dynamic Skin Triangulation [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  21. Xiang-Yang Li, Shang-Hua Teng, Alper Üngör
    Simultaneous Refinement and Coarsening for Adaptive Meshing. [Citation Graph (0, 0)][DBLP]
    Eng. Comput. (Lond.), 1999, v:15, n:3, pp:280-291 [Journal]
  22. Paul Chew, Jason Shepherd, John P. Steinbrenner, Alper Üngör
    Twelfth International Meshing Roundtable special issue. [Citation Graph (0, 0)][DBLP]
    Eng. Comput. (Lond.), 2005, v:21, n:1, pp:1- [Journal]
  23. Jeff Erickson, Damrong Guoy, John M. Sullivan, Alper Üngör
    Building spacetime meshes over arbitrary spatial domains. [Citation Graph (0, 0)][DBLP]
    Eng. Comput. (Lond.), 2005, v:20, n:4, pp:342-353 [Journal]
  24. Alper Üngör
    Guest editorial: Thirteenth International Meshing Roundtable special issue. [Citation Graph (0, 0)][DBLP]
    Eng. Comput. (Lond.), 2006, v:22, n:2, pp:59- [Journal]
  25. Paul Chew, Alper Üngör
    Guest editors' foreword. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2005, v:15, n:1, pp:1-2 [Journal]
  26. Daniel A. Spielman, Shang-Hua Teng, Alper Üngör
    Parallel Delaunay Refinement: Algorithms and Analyses. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2007, v:17, n:1, pp:1-30 [Journal]
  27. Alper Üngör, Alla Sheffer
    Pitching Tents in Space-Time: Mesh Generation for Discontinuous Galerkin Method. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2002, v:13, n:2, pp:201-221 [Journal]
  28. Alla Sheffer, Alper Üngör
    Efficient Adaptive Meshing of Parametric Models. [Citation Graph (0, 0)][DBLP]
    J. Comput. Inf. Sci. Eng., 2001, v:1, n:4, pp:366-375 [Journal]
  29. Cem Boyaci, Hale Erten, Alper Üngör
    Triangulations Loosing Bundles and Weight. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:201-204 [Conf]
  30. Hale Erten, Alper Üngör
    Computing Acute and Non-obtuse Triangulations. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:205-208 [Conf]
  31. Hale Erten, Alper Üngör
    Triangulations with locally optimal Steiner points. [Citation Graph (0, 0)][DBLP]
    Symposium on Geometry Processing, 2007, pp:143-152 [Conf]
  32. Sariel Har-Peled, Alper Üngör
    A Time-Optimal Delaunay Refinement Algorithm in Two Dimensions [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]

  33. Quality triangulations made smaller. [Citation Graph (, )][DBLP]


  34. Construction of Sparse Well-spaced Point Sets for Quality Tetrahedralizations. [Citation Graph (, )][DBLP]


  35. Computing Triangulations without Small and Large Angles. [Citation Graph (, )][DBLP]


  36. Off-centers: A new type of Steiner points for computing size-optimal quality-guaranteed Delaunay triangulations. [Citation Graph (, )][DBLP]


Search in 0.023secs, Finished in 0.026secs
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