2011
46Detailed reconstruction of 3D plant root shape. Ying Zheng, Steve Gu, Herbert Edelsbrunner, Carlo Tomasi, Philip Benfey. ICCV 2011, 2026-2033. Web SearchBibTeXDownload
2008
45Time-varying Reeb graphs for continuous space-time data. Herbert Edelsbrunner, John Harer, Ajith Mascarenhas, Valerio Pascucci, Jack Snoeyink. Comput. Geom. (41): 149-166 (2008). Web SearchBibTeXDownload
2006
44Extreme Elevation on a 2-Manifold. Pankaj K. Agarwal, Herbert Edelsbrunner, John Harer, Yusu Wang. Discrete & Computational Geometry (36): 553-572 (2006). Web SearchBibTeXDownload
2005
43Coarse and Reliable Geometric Alignment for Protein Docking. Yusu Wang, Pankaj K. Agarwal, P. Brown, Herbert Edelsbrunner, Johannes Rudolph. Pacific Symposium on Biocomputing 2005, 66-77. Web SearchBibTeXDownload
2004
42Computing the Writhing Number of a Polygonal Knot. Pankaj K. Agarwal, Herbert Edelsbrunner, Yusu Wang. Discrete & Computational Geometry (32): 37-53 (2004). Web SearchBibTeXDownload
41A Topological Hierarchy for Functions on Triangulated Surfaces. Peer-Timo Bremer, Herbert Edelsbrunner, Bernd Hamann, Valerio Pascucci. IEEE Trans. Vis. Comput. Graph. (10): 385-396 (2004). Web SearchBibTeXDownload
40Extreme elevation on a 2-manifold. Pankaj K. Agarwal, Herbert Edelsbrunner, John Harer, Yusu Wang. Symposium on Computational Geometry 2004, 357-365. Web SearchBibTeXDownload
39Local Search Heuristic for Rigid Protein Docking. Vicky Choi, Pankaj K. Agarwal, Herbert Edelsbrunner, Johannes Rudolph. WABI 2004, 218-229. Web SearchBibTeXDownload
2003
38A Multi-Resolution Data Structure for 2-Dimensional Morse Functions. Peer-Timo Bremer, Herbert Edelsbrunner, Bernd Hamann, Valerio Pascucci. IEEE Visualization 2003, 139-146. Web SearchBibTeXDownload
2002
37Algorithmic issues in modeling motion. Pankaj K. Agarwal, Leonidas J. Guibas, Herbert Edelsbrunner, Jeff Erickson, Michael Isard, Sariel Har-Peled, John Hershberger, Christian S. Jensen, Lydia E. Kavraki, Patrice Koehl, Ming C. Lin, Dinesh Manocha, Dimitris N. Metaxas, Brian Mirtich, David M. Mount, S. Muthukrishnan, Dinesh K. Pai, Elisha Sacks, Jack Snoeyink, Subhash Suri, Ouri Wolfson. ACM Comput. Surv. (34): 550-572 (2002). Cited by 41Web SearchBibTeXDownload
36Computing the writhing number of a polygonal knot. Pankaj K. Agarwal, Herbert Edelsbrunner, Yusu Wang. SODA 2002, 791-799. Web SearchBibTeXDownload
2001
35Design and analysis of planar shape deformation. Siu-Wing Cheng, Herbert Edelsbrunner, Ping Fu, Ka-Po Lam. Comput. Geom. (19): 205-218 (2001). Web SearchBibTeXDownload
2000
34Sliver exudation. Siu-Wing Cheng, Tamal K. Dey, Herbert Edelsbrunner, Michael A. Facello, Shang-Hua Teng. J. ACM (47): 883-904 (2000). Web SearchBibTeXDownload
33Smoothing and cleaning up slivers. Herbert Edelsbrunner, Xiang-Yang Li, Gary L. Miller, Andreas Stathopoulos, Dafna Talmor, Shang-Hua Teng, Alper Üngör, Noel Walkington. STOC 2000, 273-277. Web SearchBibTeXDownload
1999
32Emerging Challenges in Computational Topology. Marshall W. Bern, David Eppstein, Pankaj K. Agarwal, Nina Amenta, L. Paul Chew, Tamal K. Dey, David P. Dobkin, Herbert Edelsbrunner, Cindy Grimm, Leonidas J. Guibas, John Harer, Joel Hass, Andrew Hicks, Carroll K. Johnson, Gilad Lerman, David Letscher, Paul E. Plassmann, Eric Sedgwick, Jack Snoeyink, Jeff Weeks, Chee-Keng Yap, Denis Zorin. CoRR (cs.CG/9909001) (1999). Web SearchBibTeXDownload
31Mesh Association: Formulation and Algorithms. Xiangmin Jiao, Herbert Edelsbrunner, Michael T. Heath. IMR 1999, 75-82. Web SearchBibTeXDownload
30Sliver Exudation. Siu-Wing Cheng, Tamal K. Dey, Herbert Edelsbrunner, Michael A. Facello, Shang-Hua Teng. Symposium on Computational Geometry 1999, 1-13. Web SearchBibTeXDownload
1998
29Design and Analysis of Planar Shape Deformation. Siu-Wing Cheng, Herbert Edelsbrunner, Ping Fu, Ka-Po Lam. Symposium on Computational Geometry 1998, 29-38. Web SearchBibTeXDownload
1994
28Ray Shooting in Polygons Using Geodesic Triangulations. Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink. Algorithmica (12): 54-68 (1994). Web SearchBibTeXDownload
27Selecting Heavily Covered Points. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir. SIAM J. Comput. (23): 1138-1151 (1994). Web SearchBibTeXDownload
1993
26Computing a Face in an Arrangement of Line Segments and Related Problems. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink. SIAM J. Comput. (22): 1286-1302 (1993). Web SearchBibTeXDownload
1992
25Optimal Time Bounds for Some Proximity Problems in the Plane. Alok Aggarwal, Herbert Edelsbrunner, Prabhakar Raghavan, Prasoon Tiwari. Inf. Process. Lett. (42): 55-60 (1992). Cited by 21Web SearchBibTeXDownload
1991
24Counting and Cutting Cycles of Lines and Rods in Space. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink. Comput. Geom. (1): 305-323 (1991). Web SearchBibTeXDownload
23Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs. Pankaj K. Agarwal, Herbert Edelsbrunner, Otfried Schwarzkopf, Emo Welzl. Discrete & Computational Geometry (6): 407-422 (1991). Web SearchBibTeXDownload
22Ray Shooting in Polygons Using Geodesic Triangulations. Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink. ICALP 1991, 661-646. Web SearchBibTeXDownload
21Computing a Face in an Arrangement of Line Segments. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink. SODA 1991, 441-448. Web SearchBibTeXDownload
1990
20Combinatorial Complexity Bounds for Arrangement of Curves and Spheres. Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl. Discrete & Computational Geometry (5): 99-160 (1990). Web SearchBibTeXDownload
19Counting and Cutting Cycles of Lines and Rods in Space. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink. FOCS 1990, 242-251. Web SearchBibTeXDownload
18Slimming Down by Adding: Selecting Heavily Covered Points. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir. Symposium on Computational Geometry 1990, 116-127. Web SearchBibTeXDownload
17Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs. Pankaj K. Agarwal, Herbert Edelsbrunner, Otfried Schwarzkopf, Emo Welzl. Symposium on Computational Geometry 1990, 203-210. Web SearchBibTeXDownload
1989
16Implicitly Representing Arrangements of Lines or Segments. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl. Discrete & Computational Geometry (4): 433-466 (1989). Web SearchBibTeXDownload
15On Arrangement of Jordan Arcs with Three Intersection per Pair. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink. Discrete & Computational Geometry (4): 523-539 (1989). Web SearchBibTeXDownload
14Partitioning Space for Range Queries. F. Frances Yao, David P. Dobkin, Herbert Edelsbrunner, Mike Paterson. SIAM J. Comput. (18): 371-384 (1989). Web SearchBibTeXDownload
1988
13Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces. Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl. FOCS 1988, 568-579. Web SearchBibTeXDownload
12Probing Convex Polygons with X-Rays. Herbert Edelsbrunner, Steven Skiena. SIAM J. Comput. (17): 870-882 (1988). Web SearchBibTeXDownload
11Implicitly Representing Arrangements of Lines or Segments. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl. Symposium on Computational Geometry 1988, 56-69. Web SearchBibTeXDownload
10On Arrangements of Jordan Arcs with Three Intersections per Pair. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink. Symposium on Computational Geometry 1988, 258-265. Web SearchBibTeXDownload
1986
9The complexity of cells in three-dimensional arrangements. Herbert Edelsbrunner, David Haussler. Discrete Mathematics (60): 139-146 (1986). Web SearchBibTeXDownload
8Probing Convex Polytopes. David P. Dobkin, Herbert Edelsbrunner, Chee-Keng Yap. STOC 1986, 424-432. Web SearchBibTeXDownload
1985
7Finding Extreme Points in Three Dimensions and Solving the Post-Office Problem in the Plane. Herbert Edelsbrunner, Hermann A. Maurer. Inf. Process. Lett. (21): 39-47 (1985). Web SearchBibTeXDownload
1984
6Computing the Connected Components of Simple Rectilinear Geometrical Objects in D-Space. Herbert Edelsbrunner, Jan van Leeuwen, Thomas Ottmann, Derick Wood. ITA (18): 171-183 (1984). Web SearchBibTeX
1983
5On the shape of a set of points in the plane. Herbert Edelsbrunner, David G. Kirkpatrick, Raimund Seidel. IEEE Transactions on Information Theory (29): 551-558 (1983). Web SearchBibTeXDownload
1982
4Stabbing Line Segments. Herbert Edelsbrunner, Hermann A. Maurer, Franco P. Preparata, Arnold L. Rosenberg, Emo Welzl, Derick Wood. BIT (22): 274-281 (1982). Web SearchBibTeX
3Polygonal Intersection Searching. Herbert Edelsbrunner, Hermann A. Maurer, David G. Kirkpatrick. Inf. Process. Lett. (14): 74-79 (1982). Web SearchBibTeXDownload
1981
2On the Intersection of Orthogonal Objects. Herbert Edelsbrunner, Hermann A. Maurer. Inf. Process. Lett. (13): 177-181 (1981). Web SearchBibTeXDownload
1A Space-Optimal Solution of General Region Location. Herbert Edelsbrunner, Hermann A. Maurer. Theor. Comput. Sci. (16): 329-336 (1981). Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research