Search the dblp DataBase

Publications of Author

1. Herbert Edelsbrunner, Ernst P. Mücke
   Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms. [Citation Graph (0, 0)][DBLP]
   Symposium on Computational Geometry, 1988, pp:118-133 [Conf]
   
2. Ernst P. Mücke, Isaac Saias, Binhai Zhu
   Fast Randomized Point Location Without Preprocessing in Two- and Three-dimensional Delaunay Triangulations. [Citation Graph (0, 0)][DBLP]
   Symposium on Computational Geometry, 1996, pp:274-283 [Conf]
   
3. Herbert Edelsbrunner, Ernst P. Mücke
   Three-Dimensional Alpha Shapes. [Citation Graph (0, 0)][DBLP]
   VVS, 1992, pp:75-82 [Conf]
   
4. Luc Devroye, Ernst P. Mücke, Binhai Zhu
   A Note on Point Location in Delaunay Triangulations of Random Points. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 1998, v:22, n:4, pp:477-482 [Journal]
   
5. Ernst P. Mücke, Isaac Saias, Binhai Zhu
   Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 1999, v:12, n:1-2, pp:63-83 [Journal]
   
6. Ernst P. Mücke
   A Robust Implementation for Three-Dimensional Delaunay Triangulations. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Geometry Appl., 1998, v:8, n:2, pp:255-276 [Journal]
   
7. Scot W. Hornick, Sanjeev R. Maddila, Ernst P. Mücke, Harald Rosenberger, Steven Skiena, Ioannis G. Tollis
   Searching on a Tape. [Citation Graph (0, 0)][DBLP]
   IEEE Trans. Computers, 1990, v:39, n:10, pp:1265-1272 [Journal]
   
8. Herbert Edelsbrunner, Ernst P. Mücke
   Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. [Citation Graph (0, 0)][DBLP]
   ACM Trans. Graph., 1990, v:9, n:1, pp:66-104 [Journal]
   
9. Herbert Edelsbrunner, Ernst P. Mücke
   Three-dimensional alpha shapes. [Citation Graph (0, 0)][DBLP]
   ACM Trans. Graph., 1994, v:13, n:1, pp:43-72 [Journal]
   
10. 
    Quickhull: Computing Convex Hulls Quickly. [Citation Graph (, )][DBLP]