☰

Herbert Edelsbrunner - Publications

Affiliations: 
Computer Science Duke University, Durham, NC 
Area:
Computer Science, Theoretical Mathematics, Statistics
Tree Info Similar researchers PubMed Report error

126 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Edelsbrunner H, Nikitenko A. Weighted Poisson--Delaunay Mosaics Theory of Probability & Its Applications. 64: 595-614. DOI: 10.1137/S0040585X97T989726  0.33
2020 Edelsbrunner H, Ölsböck K. Tri-partitions and Bases of an Ordered Complex Discrete and Computational Geometry. 1-17. DOI: 10.1007/S00454-020-00188-X  0.313
2019 Edelsbrunner H, Nikitenko A. Poisson-Delaunay Mosaics of Order . Discrete & Computational Geometry. 62: 865-878. PMID 31749513 DOI: 10.1007/S00454-018-0049-2  0.379
2019 Edelsbrunner H, Ölsböck K. Holes and dependences in an ordered complex Computer Aided Geometric Design. 73: 1-15. DOI: 10.1016/J.Cagd.2019.06.003  0.316
2018 Edelsbrunner H, Nikitenko A. Random inscribed polytopes have similar radius functions as Poisson–Delaunay mosaics The Annals of Applied Probability. 28: 3215-3238. DOI: 10.1214/18-Aap1389  0.403
2018 Edelsbrunner H, Iglesias-Ham M. Multiple covers with balls I: Inclusion–exclusion Computational Geometry. 68: 119-133. DOI: 10.1016/J.Comgeo.2017.06.014  0.383
2017 Edelsbrunner H, Nikitenko A, Reitzner M. Expected sizes of Poisson–Delaunay mosaics and their discrete Morse functions Advances in Applied Probability. 49: 745-767. DOI: 10.1017/Apr.2017.20  0.412
2016 Bauer U, Edelsbrunner H. The Morse theory of Čech and Delaunay complexes Transactions of the American Mathematical Society. 369: 3741-3762. DOI: 10.1090/Tran/6991  0.314
2016 Edelsbrunner H, Iglesias-Ham M. Multiple Covers with Balls II: Weighted Averages Electronic Notes in Discrete Mathematics. 54: 169-174. DOI: 10.1016/J.Endm.2016.09.030  0.314
2016 Edelsbrunner H, Pausinger F. Approximation and convergence of the intrinsic volume Advances in Mathematics. 287: 674-703. DOI: 10.1016/J.Aim.2015.10.004  0.328
2016 Edelsbrunner H, Glazyrin A, Musin OR, Nikitenko A. The Voronoi functional is maximized by the Delaunay triangulation in the plane Combinatorica. 37: 887-910. DOI: 10.1007/S00493-016-3308-Y  0.385
2015 Burton B, Edelsbrunner H, Erickson J, Tillmann S. Computational Geometric and Algebraic Topology Oberwolfach Reports. 12: 2637-2699. DOI: 10.4171/Owr/2015/45  0.322
2015 Dolbilin N, Edelsbrunner H, Ivanov A, Musin O, Nevskii M. Yaroslavl International Conference on Discrete Geometry (dedicated to the centenary of A. D. Alexandrov) Modeling and Analysis of Information Systems. 19: 92-100. DOI: 10.18255/1818-1015-2012-6-92-100  0.307
2015 Musin OR, Ukhalov AU, Edelsbrunner H, Yakimova OP. Fractal and Computational Geometry for Generalizing Cartographic Objects Modeling and Analysis of Information Systems. 19: 152-160. DOI: 10.18255/1818-1015-2012-6-152-160  0.328
2015 Cao T, Edelsbrunner H, Tan T. Triangulations from topologically correct digital Voronoi diagrams Computational Geometry. 48: 507-519. DOI: 10.1016/J.Comgeo.2015.04.001  0.383
2014 Dolbilin N, Edelsbrunner H, Glazyrin A, Musin O. Functionals on Triangulations of Delaunay Sets Moscow Mathematical Journal. 14: 491-504. DOI: 10.17323/1609-4514-2014-14-3-491-504  0.347
2014 Alexeev VV, Bogaevskaya VG, Preobrazhenskaya MM, Ukhalov AY, Edelsbrunner H, Yakimova OP. An Algorithm for Cartographic Generalization that Preserves Global Topology Journal of Mathematical Sciences. 203: 754-760. DOI: 10.1007/S10958-014-2165-8  0.334
2014 Edelsbrunner H, Jabłoński G, Mrozek M. The Persistent Homology of a Self-Map Foundations of Computational Mathematics. 15: 1213-1244. DOI: 10.1007/S10208-014-9223-Y  0.334
2013 Bendich P, Edelsbrunner H, Morozov D, Patel A. Homology and robustness of level and interlevel sets Homology, Homotopy and Applications. 15: 51-72. DOI: 10.4310/Hha.2013.V15.N1.A3  0.704
2013 Edelsbrunner H, Pausinger F. Stable Length Estimates of Tube-Like Shapes Journal of Mathematical Imaging and Vision. 50: 164-177. DOI: 10.1007/S10851-013-0468-X  0.38
2013 Edelsbrunner H, Fasy BT, Rote G. Add Isotropic Gaussian Kernels at Own Risk: More and More Resilient Modes in Higher Dimensions Discrete & Computational Geometry. 49: 797-822. DOI: 10.1007/S00454-013-9517-X  0.715
2012 Edelsbrunner H, Strelkova NP. On the configuration space of Steiner minimal trees Russian Mathematical Surveys. 67: 1167-1168. DOI: 10.1070/Rm2012V067N06Abeh004820  0.358
2012 Dolbilin NP, Edelsbrunner H, Musin OR. On the optimality of functionals over triangulations of Delaunay sets Russian Mathematical Surveys. 67: 781-783. DOI: 10.1070/Rm2012V067N04Abeh004807  0.344
2012 Bendich P, Cabello S, Edelsbrunner H. A point calculus for interlevel set homology Pattern Recognition Letters. 33: 1436-1444. DOI: 10.1016/J.Patrec.2011.10.007  0.348
2011 Wang B, Edelsbrunner H, Morozov D. Computing elevation maxima by searching the gauss sphere Journal of Experimental Algorithmics. 16: 2.1. DOI: 10.1145/1963190.1970375  0.738
2011 Epstein C, Carlsson G, Edelsbrunner H. Topological data analysis Inverse Problems. 27. DOI: 10.1088/0266-5611/27/12/120201  0.384
2011 Edelsbrunner H, Morozov D, Patel A. Quantifying Transversality by Measuring the Robustness of Intersections Foundations of Computational Mathematics. 11: 345-361. DOI: 10.1007/S10208-011-9090-8  0.726
2011 Edelsbrunner H, Kerber M. Dual Complexes of Cubical Subdivisions of ℝ n Discrete & Computational Geometry. 47: 393-414. DOI: 10.1007/S00454-011-9382-4  0.367
2010 Bendich P, Edelsbrunner H, Kerber M. Computing robustness and persistence for images. Ieee Transactions On Visualization and Computer Graphics. 16: 1251-60. PMID 20975165 DOI: 10.1109/Tvcg.2010.139  0.363
2010 Cohen-Steiner D, Edelsbrunner H, Harer J, Mileyko Y. Lipschitz functions have Lp-stable persistence Foundations of Computational Mathematics. 10: 127-139. DOI: 10.1007/S10208-010-9060-6  0.315
2008 Edelsbrunner H, Harer J, Mascarenhas A, Pascucci V, Snoeyink J. Time-varying Reeb graphs for continuous space-time data Computational Geometry: Theory and Applications. 41: 149-166. DOI: 10.1016/J.Comgeo.2007.11.001  0.329
2008 Cohen-Steiner D, Edelsbrunner H, Harer J. Extending Persistence Using Poincaré and Lefschetz Duality Foundations of Computational Mathematics. 9: 79-103. DOI: 10.1007/S10208-008-9038-9  0.365
2006 Edelsbrunner H. A Primer on Topological Persistence Computer Graphics Forum. 25: xvii-xvii. DOI: 10.1111/J.1467-8659.2006.00942.X  0.357
2006 Narcowich C, Edelsbrunner H. Inequalities for the Curvature of Curves and Surfaces Foundations of Computational Mathematics. 7: 391-404. DOI: 10.1007/S10208-005-0200-3  0.323
2006 Cohen-Steiner D, Edelsbrunner H, Harer J. Stability of Persistence Diagrams Discrete & Computational Geometry. 37: 103-120. DOI: 10.1007/S00454-006-1276-5  0.366
2006 Attali D, Edelsbrunner H. Inclusion-Exclusion Formulas from Independent Complexes Discrete & Computational Geometry. 37: 59-77. DOI: 10.1007/S00454-006-1274-7  0.312
2006 Agarwal PK, Edelsbrunner H, Harer J, Wang Y. Extreme Elevation on a 2-Manifold Discrete & Computational Geometry. 36: 553-572. DOI: 10.1007/S00454-006-1265-8  0.66
2005 Wang Y, Agarwal PK, Brown P, Edelsbrunner H, Rudolph J. Coarse and reliable geometric alignment for protein docking. Pacific Symposium On Biocomputing. Pacific Symposium On Biocomputing. 64-75. PMID 15759614  0.603
2004 Bremer PT, Edelsbrunner H, Hamann B, Pascucci V. A topological hierarchy for functions on triangulated surfaces. Ieee Transactions On Visualization and Computer Graphics. 10: 385-96. PMID 18579967 DOI: 10.1109/Tvcg.2004.3  0.348
2004 Natarajan V, Edelsbrunner H. Simplification of three-dimensional density maps. Ieee Transactions On Visualization and Computer Graphics. 10: 587-97. PMID 15794140 DOI: 10.1109/Tvcg.2004.32  0.672
2004 Agarwal PK, Edelsbrunner H, Wang Y. Computing the Writhing Number of a Polygonal Knot Discrete and Computational Geometry. 32: 37-53. DOI: 10.1007/s00454-004-2864-x  0.571
2004 Cole-McLaughlin K, Edelsbrunner H, Harer J, Natarajan V, Pascucci V. Loops in Reeb Graphs of 2-Manifolds Discrete & Computational Geometry. 32. DOI: 10.1007/S00454-004-1122-6  0.669
2003 Edelsbrunner H, Harer J, Zomorodian A. Hierarchical Morse--Smale Complexes for Piecewise Linear 2-Manifolds Discrete and Computational Geometry. 30: 87-107. DOI: 10.1007/S00454-003-2926-5  0.326
2002 ZOMORODIAN A, EDELSBRUNNER H. FAST SOFTWARE FOR BOX INTERSECTIONS International Journal of Computational Geometry & Applications. 12: 143-172. DOI: 10.1142/S0218195902000785  0.322
2001 Cheng H, Edelsbrunner H, Fu P. Shape space from deformation Computational Geometry. 19: 191-204. DOI: 10.1016/S0925-7721(01)00021-9  0.322
2000 Cheng S, Dey TK, Edelsbrunner H, Facello MA, Teng S. Silver exudation Journal of the Acm. 47: 883-904. DOI: 10.1145/355483.355487  0.343
2000 Edelsbrunner H. Triangulations and meshes in computational geometry Acta Numerica. 9: 133-213. DOI: 10.1017/S0962492900001331  0.347
1999 Edelsbrunner H. Deformable Smooth Surface Design Discrete & Computational Geometry. 21: 87-115. DOI: 10.1007/Pl00009412  0.315
1998 Liang J, Edelsbrunner H, Woodward C. Anatomy of protein pockets and cavities: measurement of binding site geometry and implications for ligand design. Protein Science : a Publication of the Protein Society. 7: 1884-97. PMID 9761470 DOI: 10.1002/Pro.5560070905  0.619
1998 Liang J, Edelsbrunner H, Fu P, Sudhakar PV, Subramaniam S. Analytical shape computation of macromolecules: II. Inaccessible cavities in proteins. Proteins. 33: 18-29. PMID 9741841 DOI: 10.1002/(Sici)1097-0134(19981001)33:1<18::Aid-Prot2>3.0.Co;2-H  0.434
1998 Liang J, Edelsbrunner H, Fu P, Sudhakar PV, Subramaniam S. Analytical shape computation of macromolecules: I. Molecular area and volume through alpha shape. Proteins. 33: 1-17. PMID 9741840 DOI: 10.1002/(Sici)1097-0134(19981001)33:1<1::Aid-Prot1>3.0.Co;2-O  0.44
1998 Edelsbrunner H, Facello M, Liang J. On the definition and the construction of pockets in macromolecules Discrete Applied Mathematics. 88: 83-102. DOI: 10.1016/S0166-218X(98)00067-5  0.483
1997 Edelsbrunner H, Shah NR. Triangulating Topological Spaces International Journal of Computational Geometry & Applications. 7: 365-378. DOI: 10.1142/S0218195997000223  0.329
1997 Edelsbrunner H, Waupotitsch R. A combinatorial approach to cartograms Computational Geometry. 7: 343-360. DOI: 10.1016/S0925-7721(96)00006-5  0.343
1997 Edelsbrunner H, Valtr P, Welzl E. Cutting dense point sets in half Discrete & Computational Geometry. 17: 243-255. DOI: 10.1007/Pl00009291  0.386
1996 Edelsbrunner H, Shah NR. Incremental topological flipping works for regular triangulations Algorithmica. 15: 223-241. DOI: 10.1007/Bf01975867  0.397
1996 Chazelle B, Edelsbrunner H, Guibas LJ, Sharir M, Stolfi J. Lines in Space: Combinatorics and Algorithms Algorithmica (New York). 15: 428-447. DOI: 10.1007/Bf01955043  0.378
1995 Delfinado CJA, Edelsbrunner H. An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere Computer Aided Geometric Design. 12: 771-784. DOI: 10.1016/0167-8396(95)00016-Y  0.388
1995 Edelsbrunner H. The union of balls and its dual shape Discrete & Computational Geometry. 13: 415-440. DOI: 10.1007/Bf02574053  0.371
1995 Chazelle B, Edelsbrunner H, Grigni M, Guibas L, Sharir M, Welzl E. Improved bounds on weak ε-nets for convex sets Discrete & Computational Geometry. 13: 1-15. DOI: 10.1007/Bf02574025  0.357
1994 Edelsbrunner H, Mücke EP. Three-dimensional alpha shapes Acm Transactions On Graphics (Tog). 13: 43-72. DOI: 10.1145/174462.156635  0.425
1994 Chazelle B, Edelsbrunner H, Guibas LJ, Hershberger JE, Seidel R, Sharir M. Selecting heavily covered points Siam Journal On Computing. 23: 1138-1151. DOI: 10.1137/S0097539790179919  0.393
1994 Dey TK, Edelsbrunner H. Counting triangle crossings and halving planes Discrete &Amp; Computational Geometry. 12: 281-289. DOI: 10.1007/Bf02574381  0.316
1994 Chazelle B, Edelsbrunner H, Grigni M, Guibas L, Hershberger J, Sharir M, Snoeyink J. Ray shooting in polygons using geodesic triangulations Algorithmica. 12: 54-68. DOI: 10.1007/Bf01377183  0.338
1994 Chazelle B, Edelsbrunner H, Guibas LJ, Sharir M. Algorithms for bichromatic line-segment problems and polyhedral terrains Algorithmica. 11: 116-132. DOI: 10.1007/Bf01182771  0.353
1993 Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Snoeyink J. Computing a Face in an Arrangement of Line Segments and Related Problems Siam Journal On Computing. 22: 1286-1302. DOI: 10.1137/0222077  0.394
1993 Edelsbrunner H, Tan TS. A Quadratic Time Algorithm for the Minmax Length Triangulation Siam Journal On Computing. 22: 527-551. DOI: 10.1137/0222036  0.434
1993 Edelsbrunner H, Seidel R, Sharir M. On the Zone Theorem for Hyperplane Arrangements Siam Journal On Computing. 22: 418-429. DOI: 10.1137/0222031  0.412
1993 Edelsbrunner H, Tan TS. An upper bound for conforming Delaunay triangulations Discrete & Computational Geometry. 10: 197-213. DOI: 10.1007/Bf02573974  0.368
1993 Chazelle B, Edelsbrunner H, Guibas L, Sharir M. Diameter, width, closest line pair, and parametric searching Discrete & Computational Geometry. 10: 183-196. DOI: 10.1007/Bf02573973  0.428
1993 Bern M, Edelsbrunner H, Eppstein D, Mitchell S, Tan TS. Edge insertion for optimal triangulations Discrete & Computational Geometry. 10: 47-65. DOI: 10.1007/Bf02573962  0.367
1992 Chazelle B, Edelsbrunner H. An optimal algorithm for intersecting line segments in the plane Journal of the Acm. 39: 1-54. DOI: 10.1145/147508.147511  0.389
1992 Edelsbrunner H, Tan TS, Waupotitsch R. An $O(n^2 \log n)$ Time Algorithm for the Minmax Angle Triangulation Siam Journal On Scientific and Statistical Computing. 13: 994-1008. DOI: 10.1137/0913058  0.422
1992 Aggarwal A, Edelsbrunner H, Raghavan P, Tiwari P. Optimal time bounds for some proximity problems in the plane Information Processing Letters. 42: 55-60. DOI: 10.1016/0020-0190(92)90133-G  0.376
1992 Aronov B, Edelsbrunner H, Guibas LJ, Sharir M. The number of edges of many faces in a line segment arrangement Combinatorica. 12: 261-274. DOI: 10.1007/Bf01285815  0.304
1991 Edelsbrunner H, Shi W. An $O(n\log ^2 h)$ Time Algorithm for the Three-Dimensional Convex Hull Problem Siam Journal On Computing. 20: 259-269. DOI: 10.1137/0220016  0.353
1991 Chazelle B, Edelsbrunner H, Guibas LJ, Sharir M. A singly exponential stratification scheme for real semi-algebraic varieties and its applications Theoretical Computer Science. 84: 77-105. DOI: 10.1016/0304-3975(91)90261-Y  0.335
1991 Edelsbrunner H, Hajnal P. A lower bound on the number of unit distances between the vertices of a convex polygon Journal of Combinatorial Theory, Series A. 56: 312-316. DOI: 10.1016/0097-3165(91)90042-F  0.348
1991 Aronov B, Chazelle B, Edelsbrunner H, Guibas LJ, Sharir M, Wenger R. Points and triangles in the plane and halving planes in space Discrete & Computational Geometry. 6: 435-442. DOI: 10.1007/Bf02574700  0.383
1991 Agarwal PK, Edelsbrunner H, Schwarzkopf O, Welzl E. Euclidean minimum spanning trees and bichromatic closest pairs Discrete & Computational Geometry. 6: 407-422. DOI: 10.1007/Bf02574698  0.382
1991 Edelsbrunner H. Optimal Triangulations by Retriangulating Rundbrief Der Gi-Fachgruppe 5.10 Informationssystem-Architekturen. 150-150. DOI: 10.1007/3-540-54945-5_58  0.38
1990 Edelsbrunner H, Souvaine DL. Computing least median of squares regression lines and guided topological sweep Journal of the American Statistical Association. 85: 115-119. DOI: 10.1080/01621459.1990.10475313  0.382
1990 Edelsbrunner H, Overmars MH, Welzl E, Hartman IBA, Feldman JA. Ranking intervals under visibility constraints International Journal of Computer Mathematics. 34: 129-144. DOI: 10.1080/00207169008803871  0.309
1990 Edelsbrunner H, Preparata F, West D. Tetrahedrizing point sets in three dimensions† Journal of Symbolic Computation. 10: 335-347. DOI: 10.1016/S0747-7171(08)80068-5  0.407
1990 Edelsbrunner H, Robison AD, Shen XJ. Covering convex sets with non-overlapping polygons Discrete Mathematics. 81: 153-164. DOI: 10.1016/0012-365X(90)90147-A  0.396
1990 Edelsbrunner H, Guibas LJ, Sharir M. The complexity and construction of many faces in arrangements of lines and of segments Discrete & Computational Geometry. 5: 161-196. DOI: 10.1007/Bf02187784  0.369
1990 Clarkson KL, Edelsbrunner H, Guibas LJ, Sharir M, Welzl E. Combinatorial complexity bounds for arrangements of curves and spheres Discrete & Computational Geometry. 5: 99-160. DOI: 10.1007/Bf02187783  0.336
1990 Edelsbrunner H, Sharir M. The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2 Discrete & Computational Geometry. 5: 35-42. DOI: 10.1007/Bf02187778  0.378
1990 Edelsbrunner H. An acyclicity theorem for cell complexes ind dimension Combinatorica. 10: 251-260. DOI: 10.1007/Bf02122779  0.351
1990 Dobkin DP, Edelsbrunner H, Overmars MH. Searching for empty convex polygons Algorithmica. 5: 561-571. DOI: 10.1007/Bf01840404  0.379
1989 Edelsbrunner H, Skiena SS. On the Number of Furthest Neighbour Pairs in a Point Set The American Mathematical Monthly. 96: 614. DOI: 10.2307/2325182  0.344
1989 Yao FF, Dobkin DP, Edelsbrunner H, Paterson MS. Partitioning space for range queries Siam Journal On Computing. 18: 371-384. DOI: 10.1137/0218025  0.416
1989 Edelsbrunner H, Rote G, Welzl E. Testing the necklace condition for shortest tours and optimal factors in the plane Theoretical Computer Science. 66: 157-180. DOI: 10.1016/0304-3975(89)90133-3  0.301
1989 Edelsbrunner H. The upper envelope of piecewise linear functions: Tight bounds on the number of faces Discrete & Computational Geometry. 4: 337-343. DOI: 10.1007/Bf02187734  0.364
1989 Chazelle B, Edelsbrunner H, Guibas LJ. The complexity of cutting complexes Discrete & Computational Geometry. 4: 139-181. DOI: 10.1007/Bf02187720  0.355
1989 Edelsbrunner H, Hasan N, Seidel R, Shen X. Circles through two points that always enclose many points Geometriae Dedicata. 32. DOI: 10.1007/Bf00181432  0.393
1988 Edelsbrunner H, Skiena SS. Probing convex polygons with X-rays Siam Journal On Computing. 17: 870-882. DOI: 10.1137/0217054  0.307
1988 Edelsbrunner H, Preparata FP. Minimum polygonal separation Information and Computation. 77: 218-232. DOI: 10.1016/0890-5401(88)90049-1  0.409
1987 Chazelle B, Edelsbrunner H. An Improved Algorithm for Constructing kth-Order Voronoi Diagrams Ieee Transactions On Computers. 36: 1349-1354. DOI: 10.1109/Tc.1987.5009474  0.33
1987 Dobkin DP, Edelsbrunner H. Space searching for intersecting objects Journal of Algorithms. 8: 348-361. DOI: 10.1016/0196-6774(87)90015-0  0.365
1987 Edelsbrunner H, Overmars MH. Zooming by repeated range detection Information Processing Letters. 24: 413-417. DOI: 10.1016/0020-0190(87)90120-7  0.366
1987 Shen X, Edelsbrunner H. A tight lower bound on the size of visibility graphs Information Processing Letters. 26: 61-64. DOI: 10.1016/0020-0190(87)90038-X  0.338
1987 Chazelle B, Edelsbrunner H. Linear space data structures for two types of range search Discrete & Computational Geometry. 2: 113-126. DOI: 10.1007/Bf02187875  0.387
1986 Edelsbrunner H, O’Rourke J, Seidel R. Constructing Arrangements of Lines and Hyperplanes with Applications Siam Journal On Computing. 15: 341-363. DOI: 10.1137/0215024  0.418
1986 Edelsbrunner H, Guibas LJ, Stolfi J. Optimal Point Location in a Monotone Subdivision Siam Journal On Computing. 15: 317-340. DOI: 10.1137/0215023  0.358
1986 Edelsbrunner H, Welzl E. Constructing Belts in Two-Dimensional Arrangements with Applications Siam Journal On Computing. 15: 271-284. DOI: 10.1137/0215019  0.322
1986 Edelsbrunner H, Waupotitsch R. Computing a ham-sandwich cut in two dimensions Journal of Symbolic Computation. 2: 171-178. DOI: 10.1016/S0747-7171(86)80020-7  0.329
1986 Edelsbrunner H, Stöckl G. The number of extreme pairs of finite point-sets in Euclidean spaces Journal of Combinatorial Theory, Series A. 43: 344-349. DOI: 10.1016/0097-3165(86)90075-0  0.376
1986 Edelsbrunner H, Welzl E. Halfplanar range search in linear space and O(n0.695) query time Information Processing Letters. 23: 289-293. DOI: 10.1016/0020-0190(86)90088-8  0.355
1986 Edelsbrunner H, Seidel R. Voronoi diagrams and arrangements Discrete & Computational Geometry. 1: 25-44. DOI: 10.1007/Bf02187681  0.391
1986 Edelsbrunner H. Edge-skeletons in arrangements with applications Algorithmica. 1: 93-109. DOI: 10.1007/Bf01840438  0.371
1985 Chazelle B, Edelsbrunner H. OPTIMAL SOLUTIONS FOR A CLASS OF POINT RETRIEVAL PROBLEMS Journal of Symbolic Computation. 1: 47-56. DOI: 10.1016/S0747-7171(85)80028-6  0.357
1985 Edelsbrunner H. Finding transversals for sets of simple geometric figures Theoretical Computer Science. 35: 55-69. DOI: 10.1016/0304-3975(85)90005-2  0.372
1985 Edelsbrunner H. Computing the extreme distances between two convex polygons Journal of Algorithms. 6: 213-224. DOI: 10.1016/0196-6774(85)90039-2  0.366
1985 Edelsbrunner H, Overmars MH. Batched dynamic solutions to decomposable searching problems Journal of Algorithms. 6: 515-542. DOI: 10.1016/0196-6774(85)90030-6  0.333
1985 Edelsbrunner H, Welzl E. On the number of line separations of a finite set in the plane Journal of Combinatorial Theory, Series A. 38: 15-29. DOI: 10.1016/0097-3165(85)90017-2  0.344
1985 Edelsbrunner H, Maurer H. Finding extreme points in three dimensions and solving the post-office problem in the plane Information Processing Letters. 21: 39-47. DOI: 10.1016/0020-0190(85)90107-3  0.364
1984 Edelsbrunner H, O'Rourke J, Welzl E. Stationing guards in rectilinear art galleries Computer Vision, Graphics, and Image Processing. 27: 167-176. DOI: 10.1016/S0734-189X(84)80041-9  0.388
1984 Edelsbrunner H, Overmars M, Seidel R. Some methods of computational geometry applied to computer graphics Computer Vision, Graphics, and Image Processing. 28: 92-108. DOI: 10.1016/0734-189X(84)90142-7  0.349
1984 Aurenhammer F, Edelsbrunner H. An optimal algorithm for constructing the weighted voronoi diagram in the plane Pattern Recognition. 17: 251-257. DOI: 10.1016/0031-3203(84)90064-5  0.344
1984 Day WHE, Edelsbrunner H. Efficient algorithms for agglomerative hierarchical clustering methods Journal of Classification. 1: 7-24. DOI: 10.1007/Bf01890115  0.314
1983 Edelsbrunner H, Kirkpatrick D, Seidel R. On the shape of a set of points in the plane Ieee Transactions On Information Theory. 29: 551-559. DOI: 10.1109/Tit.1983.1056714  0.408
1983 Edelsbrunner H. A new approach to rectangle intersections International Journal of Computer Mathematics. 13: 221-229. DOI: 10.1080/00207168308803365  0.357
1983 Edelsbrunner H. A new approach to rectangle intersections part I International Journal of Computer Mathematics. 13: 209-219. DOI: 10.1080/00207168308803364  0.347
1982 Edelsbrunner H, Maurer HA, Preparata FP, Rosenberg AL, Welzl E, Wood D. Stabbing line segments Bit. 22: 274-281. DOI: 10.1007/Bf01934440  0.355
1981 Edelsbrunner H, Maurer H. A space-optimal solution of general region location Theoretical Computer Science. 16: 329-336. DOI: 10.1016/0304-3975(81)90103-1  0.365
Show low-probability matches.