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