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