Ernst P. Mücke

12 papers Journal 9Unranked 3
YearRankTypeTitle / Venue / Authors
2009 J jnl
Quickhull: Computing Convex Hulls Quickly.
Comput. Sci. Eng.
Ernst P. Mücke
1999 J jnl
Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations.
Comput. Geom.
Ernst P. Mücke, Isaac Saias, Binhai Zhu
1998 J jnl
A Note on Point Location in Delaunay Triangulations of Random Points.
Algorithmica
Luc Devroye, Ernst P. Mücke, Binhai Zhu
1998 J jnl
A Robust Implementation for Three-Dimensional Delaunay Triangulations.
Int. J. Comput. Geom. Appl.
Ernst P. Mücke
1996 — conf
Fast Randomized Point Location Without Preprocessing in Two- and Three-dimensional Delaunay Triangulations.
SCG
Ernst P. Mücke, Isaac Saias, Binhai Zhu
1994 J jnl
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms.
CoRR
Herbert Edelsbrunner, Ernst P. Mücke
1994 J jnl
Three-dimensional alpha shapes.
CoRR
Herbert Edelsbrunner, Ernst P. Mücke
1994 J jnl
Three-dimensional alpha shapes.
ACM Trans. Graph.
Herbert Edelsbrunner, Ernst P. Mücke
1992 — conf
Three-Dimensional Alpha Shapes.
VVS
Herbert Edelsbrunner, Ernst P. Mücke
1990 J jnl
Searching on a Tape.
IEEE Trans. Computers
Scot W. Hornick, Sanjeev R. Maddila, Ernst P. Mücke, Harald Rosenberger, Steven Skiena, Ioannis G. Tollis
1990 J jnl
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms.
ACM Trans. Graph.
Herbert Edelsbrunner, Ernst P. Mücke
1988 — conf
Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms.
SCG
Herbert Edelsbrunner, Ernst P. Mücke