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

Search the dblp DataBase

Title:
Author:
Herbert Edelsbrunner: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Herbert Edelsbrunner, Hermann A. Maurer
    On the Intersection of Orthogonal Objects. [Citation Graph (3, 0)][DBLP]
    Inf. Process. Lett., 1981, v:13, n:4/5, pp:177-181 [Journal]
  2. David P. Dobkin, Herbert Edelsbrunner, Chee-Keng Yap
    Probing Convex Polytopes [Citation Graph (2, 0)][DBLP]
    STOC, 1986, pp:424-432 [Conf]
  3. Herbert Edelsbrunner, Mark H. Overmars
    Batched Dynamic Solutions to Decomposable Searching Problems. [Citation Graph (1, 0)][DBLP]
    J. Algorithms, 1985, v:6, n:4, pp:515-542 [Journal]
  4. Herbert Edelsbrunner, Leonidas J. Guibas, Jorge Stolfi
    Optimal Point Location in a Monotone Subdivision. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:2, pp:317-340 [Journal]
  5. Herbert Edelsbrunner, Emo Welzl
    Constructing Belts in Two-Dimensional Arrangements with Applications. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:1, pp:271-284 [Journal]
  6. Herbert Edelsbrunner, Michael A. Facello, Ping Fu, Jiang Qian, Dmitry V. Nekhayev
    Wrapping 3D Scanning Data. [Citation Graph (0, 0)][DBLP]
    Three-Dimensional Image Capture and Applications, 1998, pp:148-158 [Conf]
  7. Ho-Lun Cheng, Herbert Edelsbrunner
    Area and Perimeter Derivatives of a Union of Disks. [Citation Graph (0, 0)][DBLP]
    Computer Science in Perspective, 2003, pp:88-97 [Conf]
  8. Herbert Edelsbrunner, Raimund Seidel, Micha Sharir
    On the Zone Theorem for Hyperplane Arrangements. [Citation Graph (0, 0)][DBLP]
    New Results and New Trends in Computer Science, 1991, pp:108-123 [Conf]
  9. Herbert Edelsbrunner
    Modeling with Simplicial Complexes. [Citation Graph (0, 0)][DBLP]
    CCCG, 1994, pp:36-44 [Conf]
  10. Pankaj K. Agarwal, Herbert Edelsbrunner, John Harer, Yusu Wang
    Extreme elevation on a 2-manifold. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:357-365 [Conf]
  11. Pankaj K. Agarwal, Herbert Edelsbrunner, Otfried Schwarzkopf, Emo Welzl
    Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:203-210 [Conf]
  12. Boris Aronov, Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Rephael Wenger
    Points and Triangles in the Plane and Halving Planes in Space. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:112-115 [Conf]
  13. Dominique Attali, Herbert Edelsbrunner
    Inclusion-exclusion formulas from independent complexes. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:247-254 [Conf]
  14. Bernard Chazelle, Herbert Edelsbrunner
    Linear Data Structures for Two Types of Range Search. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:293-302 [Conf]
  15. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir
    Slimming Down by Adding: Selecting Heavily Covered Points. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:116-127 [Conf]
  16. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
    Diameter, Width, Closest Line Pair, and Parametric Searching. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:120-129 [Conf]
  17. Siu-Wing Cheng, Tamal K. Dey, Herbert Edelsbrunner, Michael A. Facello, Shang-Hua Teng
    Sliver Exudation. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:1-13 [Conf]
  18. Siu-Wing Cheng, Herbert Edelsbrunner, Ping Fu, Ka-Po Lam
    Design and Analysis of Planar Shape Deformation. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:29-38 [Conf]
  19. David Cohen-Steiner, Herbert Edelsbrunner
    Inequalities for the curvature of curves and surfaces. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:272-277 [Conf]
  20. David Cohen-Steiner, Herbert Edelsbrunner, John Harer
    Stability of persistence diagrams. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:263-271 [Conf]
  21. David Cohen-Steiner, Herbert Edelsbrunner, Dmitriy Morozov
    Vines and vineyards by updating persistence in linear time. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:119-126 [Conf]
  22. Kree Cole-McLaughlin, Herbert Edelsbrunner, John Harer, Vijay Natarajan, Valerio Pascucci
    Loops in reeb graphs of 2-manifolds. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:344-350 [Conf]
  23. Cecil Jose A. Delfinado, Herbert Edelsbrunner
    An Incremental Algorithm for Betti Numbers of Simplicial Complexes. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:232-239 [Conf]
  24. Tamal K. Dey, Herbert Edelsbrunner
    Counting Triangle Crossings and Halving Planes. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:270-273 [Conf]
  25. David P. Dobkin, Herbert Edelsbrunner, Mark H. Overmars
    Searching for Empty Convex Polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:224-228 [Conf]
  26. Herbert Edelsbrunner
    An Acyclicity Theorem for Cell Complexes in d Dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:145-151 [Conf]
  27. Herbert Edelsbrunner
    The Union of Balls and Its Dual Shape. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:218-231 [Conf]
  28. Herbert Edelsbrunner, Damrong Guoy
    Sink-insertion for mesh improvement. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:115-123 [Conf]
  29. Herbert Edelsbrunner, Daniel R. Grayson
    Edgewise Subdivision of a Simplex. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:24-30 [Conf]
  30. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink
    On Arrangements of Jordan Arcs with Three Intersections per Pair. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:258-265 [Conf]
  31. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl
    Implicitly Representing Arrangements of Lines or Segments. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:56-69 [Conf]
  32. Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
    The Complexity of Many Faces in Arrangements of Lines of Segments. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:44-55 [Conf]
  33. Herbert Edelsbrunner, John Harer, Ajith Mascarenhas, Valerio Pascucci
    Time-varying reeb graphs for continuous space-time data. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:366-372 [Conf]
  34. Herbert Edelsbrunner, John Harer, Vijay Natarajan, Valerio Pascucci
    Morse-smale complexes for piecewise linear 3-manifolds. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:361-370 [Conf]
  35. Herbert Edelsbrunner, John Harer, Afra Zomorodian
    Hierarchical morse complexes for piecewise linear 2-manifolds. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:70-79 [Conf]
  36. 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]
  37. Herbert Edelsbrunner, Dmitriy Morozov, Valerio Pascucci
    Persistence-sensitive simplification functions on 2-manifolds. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:127-134 [Conf]
  38. Herbert Edelsbrunner, Nimish R. Shah
    Incremental Topological Flipping Works for Regular Triangulations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:43-52 [Conf]
  39. Herbert Edelsbrunner, Nimish R. Shah
    Triangulating Topological Spaces. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:285-292 [Conf]
  40. Herbert Edelsbrunner, Tiow Seng Tan
    An Upper Bound for Conforming Delaunay Triangulations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:53-62 [Conf]
  41. Herbert Edelsbrunner, Tiow Seng Tan, Roman Waupotitsch
    An O(n2log n) Time Algorithm for the MinMax Angle Triangulation. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:44-52 [Conf]
  42. Herbert Edelsbrunner, Pavel Valtr, Emo Welzl
    Cutting Dense Point Sets in Half. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:203-209 [Conf]
  43. Herbert Edelsbrunner, Roman Waupotitsch
    A Combinatorial Approach to Cartograms. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:98-108 [Conf]
  44. Afra Zomorodian, Herbert Edelsbrunner
    Fast software for box intersections. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:129-138 [Conf]
  45. Bernard Chazelle, Herbert Edelsbrunner
    An Optimal Algorithm for Intersecting Line Segments in the Plane [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:590-600 [Conf]
  46. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink
    Counting and Cutting Cycles of Lines and Rods in Space [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:242-251 [Conf]
  47. Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl
    Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:568-579 [Conf]
  48. David P. Dobkin, Herbert Edelsbrunner
    Space Searching for Intersecting Objects [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:387-392 [Conf]
  49. Herbert Edelsbrunner
    Algebraic Decompositions of Non-Convex Polyhedra. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:248-257 [Conf]
  50. Herbert Edelsbrunner, David Letscher, Afra Zomorodian
    Topological Persistence and Simplification. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:454-463 [Conf]
  51. Herbert Edelsbrunner, Joseph O'Rourke, Raimund Seidel
    Constructing Arrangements of Lines and Hyperplanes with Applications [Citation Graph (0, 0)][DBLP]
    FOCS, 1983, pp:83-91 [Conf]
  52. Herbert Edelsbrunner, János Pach, Jacob T. Schwartz, Micha Sharir
    On the Lower Envelope of Bivariate Functions and its Applications [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:27-37 [Conf]
  53. Herbert Edelsbrunner, Tiow Seng Tan
    A Quadratic Time Algorithm for The MinMax Length Triangulation (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:414-423 [Conf]
  54. Herbert Edelsbrunner
    Smooth Surfaces for Multi-Scale Shape Representation. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:391-412 [Conf]
  55. Herbert Edelsbrunner, Michael A. Facello, Ping Fu, Jie Liang
    Measuring proteins and voids in proteins. [Citation Graph (0, 0)][DBLP]
    HICSS (5), 1995, pp:256-264 [Conf]
  56. Bernard Chazelle, Herbert Edelsbrunner
    Optimal Solutions for a Class of Point Retrieval Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 1985, pp:80-89 [Conf]
  57. Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink
    Ray Shooting in Polygons Using Geodesic Triangulations. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:661-646 [Conf]
  58. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
    A Singly-Expenential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:179-193 [Conf]
  59. Herbert Edelsbrunner
    Geometric Structures in Computational Geometry. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:201-213 [Conf]
  60. Herbert Edelsbrunner, Leonidas J. Guibas, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir
    Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:214-229 [Conf]
  61. Herbert Edelsbrunner, Günter Rote, Emo Welzl
    Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane. [Citation Graph (0, 0)][DBLP]
    ICALP, 1987, pp:364-375 [Conf]
  62. Herbert Edelsbrunner, Emo Welzl
    On the Number of Equal-Sized Semisapces of a Set of Points in the Plane (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1983, pp:182-187 [Conf]
  63. Xiangmin Jiao, Herbert Edelsbrunner, Michael T. Heath
    Mesh Association: Formulation and Algorithms. [Citation Graph (0, 0)][DBLP]
    IMR, 1999, pp:75-82 [Conf]
  64. Herbert Edelsbrunner
    Element Quality and Tetrahedral Meshes (Invited Talk). [Citation Graph (0, 0)][DBLP]
    IMR, 2002, pp:113- [Conf]
  65. Herbert Edelsbrunner
    Optimal Triangulations by Retriangulating. [Citation Graph (0, 0)][DBLP]
    ISA, 1991, pp:150- [Conf]
  66. Herbert Edelsbrunner, Franco P. Preparata
    Tetrahedrizing Point Sets in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1988, pp:315-331 [Conf]
  67. Herbert Edelsbrunner, Alper Üngör
    Relaxed Scheduling in Dynamic Skin Triangulation. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:135-151 [Conf]
  68. Marshall W. Bern, Herbert Edelsbrunner, David Eppstein, Sandra L. Mitchell, Tio Seng Tan
    Edge Insertion for Optional Triangulations. [Citation Graph (0, 0)][DBLP]
    LATIN, 1992, pp:46-60 [Conf]
  69. Herbert Edelsbrunner
    Shape Reconstruction with Delaunay Complex. [Citation Graph (0, 0)][DBLP]
    LATIN, 1998, pp:119-132 [Conf]
  70. Herbert Edelsbrunner, Emo Welzl
    Monotone Edge Sequences in Line Arrangements and Applications (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:265-272 [Conf]
  71. Ho-Lun Cheng, Herbert Edelsbrunner, Ping Fu
    Shape Space from Deformation. [Citation Graph (0, 0)][DBLP]
    Pacific Conference on Computer Graphics and Applications, 1998, pp:104-0 [Conf]
  72. Alexander Tropsha, Herbert Edelsbrunner
    Session Introduction: Biogeometry: Applications of Computational Geometry to Molecular Structure. [Citation Graph (0, 0)][DBLP]
    Pacific Symposium on Biocomputing, 2005, pp:3-4 [Conf]
  73. Yusu Wang, Pankaj K. Agarwal, P. Brown, Herbert Edelsbrunner, Johannes Rudolph
    Coarse and Reliable Geometric Alignment for Protein Docking. [Citation Graph (0, 0)][DBLP]
    Pacific Symposium on Biocomputing, 2005, pp:66-77 [Conf]
  74. Yih-En Andrew Ban, Herbert Edelsbrunner, Johannes Rudolph
    Interface surfaces for protein-protein complexes. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2004, pp:205-212 [Conf]
  75. Dominique Attali, David Cohen-Steiner, Herbert Edelsbrunner
    Extraction and Simplification of Iso-surfaces in Tandem. [Citation Graph (0, 0)][DBLP]
    Symposium on Geometry Processing, 2005, pp:139-148 [Conf]
  76. Herbert Edelsbrunner
    Surface Tiling with Differential Topology. [Citation Graph (0, 0)][DBLP]
    Symposium on Geometry Processing, 2005, pp:9-11 [Conf]
  77. Herbert Edelsbrunner, Micha Sharir
    A Hyperplane Incidence Problem with Applications to Counting Distances. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:419-428 [Conf]
  78. Herbert Edelsbrunner
    An introduction to persistent homology. [Citation Graph (0, 0)][DBLP]
    Symposium on Solid and Physical Modeling, 2007, pp:9- [Conf]
  79. Dominique Attali, Herbert Edelsbrunner, Yuriy Mileyko
    Weak witnesses for Delaunay triangulations of submanifolds. [Citation Graph (0, 0)][DBLP]
    Symposium on Solid and Physical Modeling, 2007, pp:143-150 [Conf]
  80. Pankaj K. Agarwal, Herbert Edelsbrunner, Yusu Wang
    Computing the writhing number of a polygonal knot. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:791-799 [Conf]
  81. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink
    Computing a Face in an Arrangement of Line Segments. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:441-448 [Conf]
  82. Ho-Lun Cheng, Tamal K. Dey, Herbert Edelsbrunner, John Sullivan
    Dynamic skin triangulation. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:47-56 [Conf]
  83. Herbert Edelsbrunner
    Key-Problems and Key-Methods in Computational Geormetry. [Citation Graph (0, 0)][DBLP]
    STACS, 1984, pp:1-13 [Conf]
  84. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas
    The Complexity of Cutting Convex Polytopes [Citation Graph (0, 0)][DBLP]
    STOC, 1987, pp:66-76 [Conf]
  85. Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, Micha Sharir, Emo Welzl
    Improved bounds on weak epsilon-nets for convex sets. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:495-504 [Conf]
  86. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
    Lines in Space-Combinatorics, Algorithms and Applications [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:382-393 [Conf]
  87. Herbert Edelsbrunner, Leonidas J. Guibas
    Topologically Sweeping an Arrangement [Citation Graph (0, 0)][DBLP]
    STOC, 1986, pp:389-403 [Conf]
  88. 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]
  89. Peer-Timo Bremer, Herbert Edelsbrunner, Bernd Hamann, Valerio Pascucci
    A Multi-Resolution Data Structure for 2-Dimensional Morse Functions. [Citation Graph (0, 0)][DBLP]
    IEEE Visualization, 2003, pp:139-146 [Conf]
  90. Herbert Edelsbrunner, John Harer, Vijay Natarajan, Valerio Pascucci
    Local and Global Comparison of Continuous Functions. [Citation Graph (0, 0)][DBLP]
    IEEE Visualization, 2004, pp:275-280 [Conf]
  91. Herbert Edelsbrunner, Ernst P. Mücke
    Three-Dimensional Alpha Shapes. [Citation Graph (0, 0)][DBLP]
    VVS, 1992, pp:75-82 [Conf]
  92. Vicky Choi, Pankaj K. Agarwal, Herbert Edelsbrunner, Johannes Rudolph
    Local Search Heuristic for Rigid Protein Docking. [Citation Graph (0, 0)][DBLP]
    WABI, 2004, pp:218-229 [Conf]
  93. Herbert Edelsbrunner, Afra Zomorodian
    Computing Linking Numbers of a Filtration. [Citation Graph (0, 0)][DBLP]
    WABI, 2001, pp:112-127 [Conf]
  94. Herbert Edelsbrunner
    Combinatorial and Computational Results for Line Arrangements in Space. [Citation Graph (0, 0)][DBLP]
    WADS, 1989, pp:591- [Conf]
  95. Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink
    Ray Shooting in Polygons Using Geodesic Triangulations. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:12, n:1, pp:54-68 [Journal]
  96. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
    Algorithms for Bichromatic Line-Segment Problems Polyhedral Terrains. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:11, n:2, pp:116-132 [Journal]
  97. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jorge Stolfi
    Lines in Space: Combinatorics and Algorithms. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:15, n:5, pp:428-447 [Journal]
  98. David P. Dobkin, Herbert Edelsbrunner, Mark H. Overmars
    Searching for Empty Convex Polygons. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1990, v:5, n:4, pp:561-571 [Journal]
  99. Herbert Edelsbrunner
    Edge-Skeletons in Arrangements with Applications. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1986, v:1, n:1, pp:93-109 [Journal]
  100. Herbert Edelsbrunner, Nimish R. Shah
    Incremental Topological Flipping Works for Regular Triangulations. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:15, n:3, pp:223-241 [Journal]
  101. Herbert Edelsbrunner, Hermann A. Maurer, Franco P. Preparata, Arnold L. Rosenberg, Emo Welzl, Derick Wood
    Stabbing Line Segments. [Citation Graph (0, 0)][DBLP]
    BIT, 1982, v:22, n:3, pp:274-281 [Journal]
  102. Cecil Jose A. Delfinado, Herbert Edelsbrunner
    An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere. [Citation Graph (0, 0)][DBLP]
    Computer Aided Geometric Design, 1995, v:12, n:7, pp:771-784 [Journal]
  103. Herbert Edelsbrunner, G. Haring, D. Hilbert
    Rectangular Point Location in d Dimensions with Applications. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1986, v:29, n:1, pp:76-82 [Journal]
  104. Boris Aronov, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
    The number of edges of many faces in a line segment arrangement. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1992, v:12, n:3, pp:261-274 [Journal]
  105. Herbert Edelsbrunner
    An acyclicity theorem for cell complexes in d dimension. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1990, v:10, n:3, pp:251-260 [Journal]
  106. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink
    Counting and Cutting Cycles of Lines and Rods in Space. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1991, v:1, n:, pp:305-323 [Journal]
  107. Ho-Lun Cheng, Herbert Edelsbrunner
    Area, perimeter and derivatives of a skin curve. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:26, n:2, pp:173-192 [Journal]
  108. Ho-Lun Cheng, Herbert Edelsbrunner, Ping Fu
    Shape space from deformation. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2001, v:19, n:2-3, pp:191-204 [Journal]
  109. Siu-Wing Cheng, Herbert Edelsbrunner, Ping Fu, Ka-Po Lam
    Design and analysis of planar shape deformation. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2001, v:19, n:2-3, pp:205-218 [Journal]
  110. Emo Welzl, Herbert Edelsbrunner, Roman Waupotitsch
    A Combinatorial Approach to Cartograms. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:7, n:, pp:343-360 [Journal]
  111. Herbert Edelsbrunner, Alper Üngör
    Relaxed Scheduling in Dynamic Skin Triangulation [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  112. 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
    Emerging Challenges in Computational Topology [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  113. 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
    Algorithmic issues in modeling motion. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 2002, v:34, n:4, pp:550-572 [Journal]
  114. Herbert Edelsbrunner, Mark H. Overmars, Raimund Seidel
    Some methods of computational geometry applied to computer graphics. [Citation Graph (0, 0)][DBLP]
    Computer Vision, Graphics, and Image Processing, 1984, v:28, n:1, pp:92-108 [Journal]
  115. Nataraj Akkiraju, Herbert Edelsbrunner
    Triangulating the Surface of a Molecule. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:71, n:1-3, pp:5-22 [Journal]
  116. Herbert Edelsbrunner, Michael A. Facello, Jie Liang
    On the Definition and the Construction of Pockets in Macromolecules. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:88, n:1-3, pp:83-102 [Journal]
  117. Boris Aronov, Bernard Chazelle, Herbert Edelsbrunner
    Points and Triangles in the Plane and Halving Planes in Space. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:435-442 [Journal]
  118. Pankaj K. Agarwal, Herbert Edelsbrunner, Otfried Schwarzkopf
    Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:407-422 [Journal]
  119. Pankaj K. Agarwal, Herbert Edelsbrunner, Yusu Wang
    Computing the Writhing Number of a Polygonal Knot. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:32, n:1, pp:37-53 [Journal]
  120. Marshall W. Bern, Herbert Edelsbrunner, David Eppstein, Sandra L. Mitchell, Tio Seng Tan
    Edge Insertion for Optimal Triangulations. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:10, n:, pp:47-65 [Journal]
  121. Robert Bryant, Herbert Edelsbrunner, Patrice Koehl, Michael Levitt
    The Area Derivative of a Space-Filling Diagram. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:32, n:3, pp:293-308 [Journal]
  122. Bernard Chazelle, Herbert Edelsbrunner
    Linear Space Data Structures for Two Types of Range Search. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1987, v:2, n:, pp:113-126 [Journal]
  123. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas
    The Complexity of Cutting Complexes. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:139-181 [Journal]
  124. Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, Micha Sharir, Emo Welzl
    Improved Bounds on Weak epsilon-Nets for Convex Sets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:13, n:, pp:1-15 [Journal]
  125. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
    Diameter, Width, Closest Line Pair, and Parametric Searching. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:10, n:, pp:183-196 [Journal]
  126. Ho-Lun Cheng, Tamal K. Dey, Herbert Edelsbrunner, John Sullivan
    Dynamic Skin Triangulation. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:25, n:4, pp:525-568 [Journal]
  127. Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl
    Combinatorial Complexity Bounds for Arrangement of Curves and Spheres. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1990, v:5, n:, pp:99-160 [Journal]
  128. Kree Cole-McLaughlin, Herbert Edelsbrunner, John Harer, Vijay Natarajan, Valerio Pascucci
    Loops in Reeb Graphs of 2-Manifolds. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:32, n:2, pp:231-244 [Journal]
  129. Tamal K. Dey, Herbert Edelsbrunner
    Counting Triangle Crossing and Halving Planes. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1994, v:12, n:, pp:231-289 [Journal]
  130. Herbert Edelsbrunner
    The Upper Envelope of Piecewise Linear Functions: Tight Bounds on the Number of Faces. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:337-343 [Journal]
  131. Herbert Edelsbrunner
    The Union of Balls and Its Dual Shape. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:13, n:, pp:415-440 [Journal]
  132. Herbert Edelsbrunner
    Deformable Smooth Surface Design. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:21, n:1, pp:87-115 [Journal]
  133. Herbert Edelsbrunner, Daniel R. Grayson
    Edgewise Subdivision of a Simplex. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:24, n:4, pp:707-719 [Journal]
  134. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink
    On Arrangement of Jordan Arcs with Three Intersection per Pair. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:523-539 [Journal]
  135. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl
    Implicitly Representing Arrangements of Lines or Segments. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:433-466 [Journal]
  136. Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
    The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:311-336 [Journal]
  137. Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
    The Complexity and Construction of Many Faces in Arrangement of Lines and of Segments. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1990, v:5, n:, pp:161-196 [Journal]
  138. Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
    The Complexity of Many Cells in Arrangements of Planes and Related Problems. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1990, v:5, n:, pp:197-216 [Journal]
  139. Herbert Edelsbrunner, John Harer, Afra Zomorodian
    Hierarchical Morse - Smale Complexes for Piecewise Linear 2-Manifolds. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2003, v:30, n:1, pp:87-107 [Journal]
  140. Herbert Edelsbrunner, David Letscher, Afra Zomorodian
    Topological Persistence and Simplification. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2002, v:28, n:4, pp:511-533 [Journal]
  141. Herbert Edelsbrunner, Edgar A. Ramos
    Inclusion - Exclusion Complexes for Pseudodisk Collections. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1997, v:17, n:3, pp:287-306 [Journal]
  142. Herbert Edelsbrunner, Raimund Seidel
    Voronoi Diagrams and Arrangements. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1986, v:1, n:, pp:25-44 [Journal]
  143. Herbert Edelsbrunner, Micha Sharir
    The Maximum Number of Ways To Stab n Convex Nonintersecting Sets in the Plane Is 2n-2. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1990, v:5, n:, pp:35-42 [Journal]
  144. Herbert Edelsbrunner, Tiow Seng Tan
    An Upper Bound for Conforming Delaunary Triangulations. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:10, n:, pp:193-213 [Journal]
  145. Herbert Edelsbrunner, Pavel Valtr, Emo Welzl
    Cutting Dense Point Sets in Half. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1997, v:17, n:3, pp:243-255 [Journal]
  146. Pankaj K. Agarwal, Herbert Edelsbrunner, John Harer, Yusu Wang
    Extreme Elevation on a 2-Manifold. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2006, v:36, n:4, pp:553-572 [Journal]
  147. Herbert Edelsbrunner
    The Computational Geometry Column. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1987, v:33, n:, pp:23-24 [Journal]
  148. Herbert Edelsbrunner
    The computational Geometry Column. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1988, v:35, n:, pp:66-68 [Journal]
  149. Herbert Edelsbrunner
    The computational Geometry Column. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1988, v:34, n:, pp:32-38 [Journal]
  150. Herbert Edelsbrunner
    The Computation Geometry Column. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1989, v:38, n:, pp:74-78 [Journal]
  151. Herbert Edelsbrunner
    The Computation Geometry Column. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1989, v:37, n:, pp:109-116 [Journal]
  152. Herbert Edelsbrunner
    The Computational Geometry Column. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1990, v:42, n:, pp:132-134 [Journal]
  153. Herbert Edelsbrunner, Damrong Guoy
    An Experimental Study of Sliver Exudation. [Citation Graph (0, 0)][DBLP]
    Eng. Comput. (Lond.), 2002, v:18, n:3, pp:229-240 [Journal]
  154. Herbert Edelsbrunner, Franco P. Preparata
    Minimum Polygonal Separation [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1988, v:77, n:3, pp:218-232 [Journal]
  155. Herbert Edelsbrunner, Nimish R. Shah
    Triangulating Topological Spaces. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1997, v:7, n:4, pp:365-378 [Journal]
  156. Herbert Edelsbrunner, Roman Waupotitsch
    Adaptive Simplicial Grids from Cross-Sections of Monotone Complexes. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2000, v:10, n:3, pp:267-284 [Journal]
  157. Afra Zomorodian, Herbert Edelsbrunner
    Fast Software for Box Intersections. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2002, v:12, n:1-2, pp:143-172 [Journal]
  158. Herbert Edelsbrunner, Damrong Guoy
    Sink Insertion for Mesh Improvement. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2002, v:13, n:2, pp:223-242 [Journal]
  159. Alok Aggarwal, Herbert Edelsbrunner, Prabhakar Raghavan, Prasoon Tiwari
    Optimal Time Bounds for Some Proximity Problems in the Plane. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:1, pp:55-60 [Journal]
  160. Herbert Edelsbrunner, Hermann A. Maurer
    Finding Extreme Points in Three Dimensions and Solving the Post-Office Problem in the Plane. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1985, v:21, n:1, pp:39-47 [Journal]
  161. Herbert Edelsbrunner, Hermann A. Maurer, David G. Kirkpatrick
    Polygonal Intersection Searching. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1982, v:14, n:2, pp:74-79 [Journal]
  162. Herbert Edelsbrunner, Mark H. Overmars
    On the Equivalence of Some Rectangle Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1982, v:14, n:3, pp:124-127 [Journal]
  163. Herbert Edelsbrunner, Mark H. Overmars
    Zooming by Repeated Range Detection. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:6, pp:413-417 [Journal]
  164. Herbert Edelsbrunner, Emo Welzl
    Halfplanar Range Search in Linear Space and O(n^(0.695)) Query Time. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1986, v:23, n:6, pp:289-293 [Journal]
  165. Xiaojun Shen, Herbert Edelsbrunner
    A Tight Lower Bound on the Size of Visibility Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:26, n:2, pp:61-64 [Journal]
  166. Herbert Edelsbrunner, Jan van Leeuwen, Thomas Ottmann, Derick Wood
    Computing the Connected Components of Simple Rectilinear Geometrical Objects in D-Space. [Citation Graph (0, 0)][DBLP]
    ITA, 1984, v:18, n:2, pp:171-183 [Journal]
  167. Bernard Chazelle, Herbert Edelsbrunner
    An Optimal Algorithm for Intersecting Line Segments in the Plane. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1992, v:39, n:1, pp:1-54 [Journal]
  168. Siu-Wing Cheng, Tamal K. Dey, Herbert Edelsbrunner, Michael A. Facello, Shang-Hua Teng
    Sliver exudation. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2000, v:47, n:5, pp:883-904 [Journal]
  169. Yih-En Andrew Ban, Herbert Edelsbrunner, Johannes Rudolph
    Interface surfaces for protein-protein complexes. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2006, v:53, n:3, pp:361-378 [Journal]
  170. David P. Dobkin, Herbert Edelsbrunner
    Space Searching for Intersecting Objects. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1987, v:8, n:3, pp:348-361 [Journal]
  171. Herbert Edelsbrunner
    Computing the Extreme Distances Between Two Convex Polygons. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1985, v:6, n:2, pp:213-224 [Journal]
  172. Herbert Edelsbrunner, Leonidas J. Guibas
    Topologically Sweeping an Arrangement. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1989, v:38, n:1, pp:165-194 [Journal]
  173. Herbert Edelsbrunner, Leonidas J. Guibas
    Corrigendum: Topologically Sweeping an Arrangement. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1991, v:42, n:2, pp:249-251 [Journal]
  174. Herbert Edelsbrunner, Péter Hajnal
    A lower bound on the number of unit distances between the vertices of a convex polygon. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1991, v:56, n:2, pp:312-316 [Journal]
  175. Herbert Edelsbrunner, Gerd Stöckl
    The number of extreme pairs of finite point-sets in Euclidean spaces. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1986, v:43, n:2, pp:344-349 [Journal]
  176. Herbert Edelsbrunner, Emo Welzl
    On the Number of Line Separations of a Finite Set in the Plane. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1985, v:38, n:1, pp:15-29 [Journal]
  177. Herbert Edelsbrunner, Emo Welzl
    On the maximal number of edges of many faces in an arrangement. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1986, v:41, n:2, pp:159-166 [Journal]
  178. Bernard Chazelle, Herbert Edelsbrunner
    Optimal Solutions for a Class of Point Retrieval Problems. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1985, v:1, n:1, pp:47-56 [Journal]
  179. Herbert Edelsbrunner, Franco P. Preparata, Douglas B. West
    Tetrahedrizing Point Sets in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1990, v:10, n:3/4, pp:335-348 [Journal]
  180. Herbert Edelsbrunner, Roman Waupotitsch
    Computing a Ham-Sandwich Cut in Two Dimensions. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1986, v:2, n:2, pp:171-178 [Journal]
  181. Herbert Edelsbrunner
    180 Wrapped Tubes. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2001, v:7, n:5, pp:379-399 [Journal]
  182. Franz Aurenhammer, Herbert Edelsbrunner
    An optimal algorithm for constructing the weighted voronoi diagram in the plane. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 1984, v:17, n:2, pp:251-257 [Journal]
  183. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir
    Selecting Heavily Covered Points. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:6, pp:1138-1151 [Journal]
  184. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink
    Computing a Face in an Arrangement of Line Segments and Related Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:6, pp:1286-1302 [Journal]
  185. Herbert Edelsbrunner, Joseph O'Rourke, Raimund Seidel
    Constructing Arrangements of Lines and Hyperplanes with Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:2, pp:341-363 [Journal]
  186. Herbert Edelsbrunner, Steven Skiena
    Probing Convex Polygons with X-Rays. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:5, pp:870-882 [Journal]
  187. Herbert Edelsbrunner, Weiping Shi
    An O(n log² h) Time Algorithm for the Three-Dimensional Convex Hull Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:2, pp:259-269 [Journal]
  188. Herbert Edelsbrunner, Raimund Seidel, Micha Sharir
    On the Zone Theorem for Hyperplane Arrangements. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:2, pp:418-429 [Journal]
  189. Herbert Edelsbrunner, Tio Seng Tan
    A Quadratic Time Algorithm for the Minimax Length Triangulation. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:3, pp:527-551 [Journal]
  190. F. Frances Yao, David P. Dobkin, Herbert Edelsbrunner, Mike Paterson
    Partitioning Space for Range Queries. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:2, pp:371-384 [Journal]
  191. Bernard Chazelle, Herbert Edelsbrunner
    An Improved Algorithm for Constructing k th-Order Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1987, v:36, n:11, pp:1349-1354 [Journal]
  192. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
    A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and its Applications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:84, n:1, pp:77-105 [Journal]
  193. Herbert Edelsbrunner, Leonidas J. Guibas, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir
    Arrangements of Curves in the Plane - Topology, Combinatorics and Algorithms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:92, n:2, pp:319-336 [Journal]
  194. Herbert Edelsbrunner
    Finding Transversals for Sets of Simple Geometric Figures. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:35, n:, pp:55-69 [Journal]
  195. Herbert Edelsbrunner, Hermann A. Maurer
    A Space-Optimal Solution of General Region Location. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:16, n:, pp:329-336 [Journal]
  196. Herbert Edelsbrunner, Günter Rote, Emo Welzl
    Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:66, n:2, pp:157-180 [Journal]
  197. Herbert Edelsbrunner, David G. Kirkpatrick, Raimund Seidel
    On the shape of a set of points in the plane. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:4, pp:551-558 [Journal]
  198. 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]
  199. 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]
  200. Peer-Timo Bremer, Herbert Edelsbrunner, Bernd Hamann, Valerio Pascucci
    A Topological Hierarchy for Functions on Triangulated Surfaces. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Vis. Comput. Graph., 2004, v:10, n:4, pp:385-396 [Journal]
  201. Vijay Natarajan, Herbert Edelsbrunner
    Simplification of Three-Dimensional Density Maps. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Vis. Comput. Graph., 2004, v:10, n:5, pp:587-597 [Journal]
  202. Dominique Attali, Herbert Edelsbrunner, John Harer, Yuriy Mileyko
    Alpha-Beta Witness Complexes. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:386-397 [Conf]
  203. David Cohen-Steiner, Herbert Edelsbrunner, John Harer
    Stability of Persistence Diagrams. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2007, v:37, n:1, pp:103-120 [Journal]
  204. Dominique Attali, Herbert Edelsbrunner
    Inclusion-Exclusion Formulas from Independent Complexes. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2007, v:37, n:1, pp:59-77 [Journal]
  205. Herbert Edelsbrunner, David Haussler
    The complexity of cells in three-dimensional arrangements. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:60, n:, pp:139-146 [Journal]
  206. Herbert Edelsbrunner, Arch D. Robison, Xiaojun Shen
    Covering convex sets with non-overlapping polygons. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:81, n:2, pp:153-164 [Journal]

  207. Reeb spaces of piecewise linear mappings. [Citation Graph (, )][DBLP]


  208. An improved algorithm for constructing kth-order Voronoi diagrams. [Citation Graph (, )][DBLP]


  209. Voronoi diagrams and arrangements. [Citation Graph (, )][DBLP]


  210. Mean-Payoff Automaton Expressions. [Citation Graph (, )][DBLP]


  211. The Robustness of Level Sets. [Citation Graph (, )][DBLP]


  212. Inferring Local Homology from Sampled Stratified Spaces. [Citation Graph (, )][DBLP]


  213. Persistent Homology under Non-uniform Error. [Citation Graph (, )][DBLP]


  214. Persistent homology for kernels, images, and cokernels. [Citation Graph (, )][DBLP]


  215. Computing Elevation Maxima by Searching the Gauss Sphere. [Citation Graph (, )][DBLP]


  216. The Persistent Morse Complex Segmentation of a 3-Manifold. [Citation Graph (, )][DBLP]


  217. Time-varying Reeb graphs for continuous space-time data. [Citation Graph (, )][DBLP]


  218. Quantifying Transversality by Measuring the Robustness of Intersections [Citation Graph (, )][DBLP]


  219. Mean-payoff Automaton Expressions [Citation Graph (, )][DBLP]


Search in 0.017secs, Finished in 0.025secs
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