Publications of Herbert Edelsbrunner :chronological combined listing:
%% Journal articles or Book chapters PUBLISHED
@article{fds1228,
Author = {H. Edelsbrunner},
Title = {180 wrapped tubes},
Journal = {J. Univ. Comput. Sci.},
Volume = {7},
Pages = {379-399},
Year = {2001},
Key = {fds1228}
}
@article{fds1229,
Author = {H.-L. Cheng and T. K. Dey and J. Sullivan and H.
Edelsbrunner},
Title = {Dynamic skin triangulation},
Journal = {The Micha Sharir Birthday Issue, eds.P. Agarwal, D. Halperin
and R. Pollack, Discrete Comput. Geom.},
Volume = {25},
Pages = {525-568},
Year = {2001},
Key = {fds1229}
}
@article{fds1231,
Author = {H.-L. Cheng and P. Fu and H. Edelsbrunner},
Title = {Shape space from deformation},
Journal = {Comput. Geom. Theory Appl.},
Volume = {19},
Pages = {191-204},
Year = {2001},
Key = {fds1231}
}
@article{fds1232,
Author = {S.-W. Cheng and P. Fu and P. Lam and H. Edelsbrunner},
Title = {Design and analysis of planar shape deformation},
Journal = {Comput. Geom. Theory Appl.},
Volume = {19},
Pages = {205-218},
Year = {2001},
Key = {fds1232}
}
@article{fds1233,
Author = {H. Edelsbrunner},
Title = {Triangulations and meshes in computational
geometry},
Journal = {Acta Numerica},
Pages = {133-213},
Year = {2000},
Key = {fds1233}
}
@article{fds1234,
Author = {D. R. Grayson and H. Edelsbrunner},
Title = {Edgewise subdivision of a simplex},
Journal = {Discrete Comput. Geom.},
Volume = {24},
Pages = {707-719},
Year = {2000},
Key = {fds1234}
}
@article{fds1235,
Author = {S.-W. Cheng and T. K. Dey and M. A. Facello and S.-H. Teng and H.
Edelsbrunner},
Title = {Sliver exudation},
Journal = {J. Assoc. Comput. Mach.},
Volume = {47},
Pages = {273-277},
Year = {2000},
Key = {fds1235}
}
@article{fds1237,
Author = {R. Waupotitsch and H. Edelsbrunner},
Title = {Adaptive simplicial grids from cross-sections of monotone
complexes},
Journal = {Internat. J. Comput. Geom. Appl.},
Volume = {10},
Pages = {267-284},
Year = {2000},
Key = {fds1237}
}
@article{fds1246,
Author = {H. Edelsbrunner},
Title = {Spielereien mit Kreisen und Kugeln. Zum Thema Form und
Verformung},
Booktitle = {Zur Kunst des formalen Denkens,153-171},
Publisher = {Passagen Verlag, Wien, Austria},
Editor = {R. E. Burkard and W. Maas und P. Weibel},
Year = {2000},
Key = {fds1246}
}
@article{fds1236,
Author = {T. K. Dey and S. Guha and D. V. Nekhayev and H.
Edelsbrunner},
Title = {Topology preserving edge contraction},
Journal = {Publ. Inst. Math. (Beograd) (N. S.)},
Volume = {66},
Pages = {23-45},
Year = {1999},
Key = {fds1236}
}
@article{fds1241,
Author = {H. Edelsbrunner},
Title = {Deformable smooth surface design},
Journal = {Discrete Comput. Geom.},
Volume = {21},
Pages = {87-115},
Year = {1999},
Key = {fds1241}
}
@article{fds1249,
Author = {T. K. Dey and S. Guha and H. Edelsbrunner},
Title = {Computational topology},
Booktitle = {Advances in Discrete and Computational Geometry,
109-143},
Publisher = {Contemporary Mathematics 223, AMS, Providence,},
Editor = {B. Chazelle and J. E. Goodman and R. Pollack},
Year = {1999},
Key = {fds1249}
}
@article{fds1238,
Author = {J. Liang and C. Woodward and H. Edelsbrunner},
Title = {Anatomy of protein pockets and cavities: measurement of
binding site geometry and implications for ligand
design},
Journal = {Protein Science},
Volume = {7},
Pages = {1884-1897},
Year = {1998},
Key = {fds1238}
}
@article{fds1239,
Author = {J. Liang and P. Fu and P. V. Sudhakar and S. Subramaniam and H.
Edelsbrunner},
Title = {Analytic shape computation of macromolecules II:
inaccessible cavities in proteins},
Journal = {Proteins: Structure, Function, and Genetics},
Volume = {33},
Pages = {18-29},
Year = {1998},
Key = {fds1239}
}
@article{fds1240,
Author = {J. Liang and P. Fu and P. V. Sudhakar and S. Subramaniam and H.
Edelsbrunner},
Title = {Analytic shape computation of macromolecules I: molecular
area and volume through alpha shape},
Journal = {Proteins: Structure, Function, and Genetics},
Volume = {33},
Pages = {1-17},
Year = {1998},
Key = {fds1240}
}
@article{fds1242,
Author = {M. Facello and J. Liang and H. Edelsbrunner},
Title = {On the definition and the construction of pockets in
macromolecules},
Journal = {Discrete Appl. Math.},
Volume = {88},
Pages = {83-102},
Year = {1998},
Key = {fds1242}
}
@article{fds1247,
Author = {U. Axen and H. Edelsbrunner},
Title = {Auditory Morse analysis of triangulated manifolds},
Booktitle = {Mathematical Visualization, 223-236},
Publisher = {Springer-Verlag, Berlin, Germany},
Editor = {H.-C. Hege and K. Polthier},
Year = {1998},
Key = {fds1247}
}
@article{fds1248,
Author = {H. Edelsbrunner},
Title = {Geometry for modeling biomolecules},
Booktitle = {Robotics: The Algorithmic Perspective, The Third Workshop on
the Algorithmic Foundations of Robotics,
265-277},
Publisher = {A. K. Peters, Natick, Massachusetts},
Editor = {P. Agarwal and L. Kavraki and M. Mason},
Year = {1998},
Key = {fds1248}
}
@article{fds1243,
Author = {R. Waupotitsch and H. Edelsbrunner},
Title = {A combinatorial approach to cartograms},
Journal = {J. Comput. Geom. Theory Appl.},
Volume = {7},
Pages = {343-360},
Year = {1997},
Key = {fds1243}
}
@article{fds1244,
Author = {E. A. Ramos and H. Edelsbrunner},
Title = {Inclusion-exclusion complexes for pseudodisk
collections},
Journal = {Discrete Comput. Geom.},
Volume = {17},
Pages = {287-306},
Year = {1997},
Key = {fds1244}
}
@article{fds1245,
Author = {P. Valtr and E. Welzl and H. Edelsbrunner},
Title = {Cutting dense point sets in half},
Journal = {Discrete Comput. Geom.},
Volume = {17},
Pages = {243-255},
Year = {1997},
Key = {fds1245}
}
@article{fds1862,
Author = {N. R. Shah and H. Edelsbrunner},
Title = {Triangulating topological spaces},
Journal = {Internat. J. Comput. Geom. Appl.},
Volume = {7},
Pages = {365-378},
Year = {1997},
Key = {fds1862}
}
@article{fds1863,
Author = {N. Akkiraju and P. Fu and J. Qian and H. Edelsbrunner},
Title = {Viewing geometric protein structures from inside a
cave},
Journal = {IEEE Comput. Graphics Appl.},
Volume = {16},
Pages = {58-61},
Year = {1996},
Key = {fds1863}
}
@article{fds1864,
Author = {N. Akkiraju and H. Edelsbrunner},
Title = {Triangulating the surface of a molecule},
Journal = {Discrete Appl. Math.},
Volume = {71},
Pages = {5-22},
Year = {1996},
Key = {fds1864}
}
@article{fds1865,
Author = {N. R. Shah and H. Edelsbrunner},
Title = {Incremental topological ipping works for regular
triangulations},
Journal = {Algorithmica},
Volume = {15},
Pages = {223-241},
Year = {1996},
Key = {fds1865}
}
@article{fds1866,
Author = {B. Chazelle and L. J. Guibas and M. Sharir and J. Stolfi and H.
Edelsbrunner},
Title = {Lines in space: combinatorics and algorithms},
Journal = {Algorithmica},
Volume = {15},
Pages = {428-447},
Year = {1996},
Key = {fds1866}
}
@article{fds1867,
Author = {C. J. A. Delfinado and H. Edelsbrunner},
Title = {An incremental algorithm for Betti numbers of simplicial
complexes on the 3-sphere},
Journal = {Comput. Aided Geom. Design},
Volume = {17},
Pages = {771-784},
Year = {1995},
Key = {fds1867}
}
@article{fds1868,
Author = {H. Edelsbrunner},
Title = {The union of balls and its dual shape},
Journal = {Discrete Comput. Geom.},
Volume = {13},
Pages = {415-440},
Booktitle = {Laszlo Fejes Toth Festschrift},
Editor = {I. Barany and J. Pach},
Year = {1995},
Key = {fds1868}
}
@article{fds1869,
Author = {B. Chazelle and M. Grigni and L. J. Guibas and M. Sharir and E. Welzl and H. Edelsbrunner},
Title = {Improved bounds on weak " -nets for convex
sets},
Journal = {Discrete Comput. Geom.},
Volume = {13},
Pages = {1-15},
Year = {1995},
Key = {fds1869}
}
@article{fds1870,
Author = {T. R. Dey and H. Edelsbrunner},
Title = {Counting triangle crossings and halving planes},
Journal = {Discrete Comput. Geom.},
Volume = {12},
Pages = {281-289},
Year = {1994},
Key = {fds1870}
}
@article{fds1871,
Author = {E. P. Mucke and H. Edelsbrunner},
Title = {Three-dimensional alpha shapes},
Journal = {ACM Trans. Graphics},
Volume = {13},
Pages = {43-72},
Year = {1994},
Key = {fds1871}
}
@article{fds1872,
Author = {B. Chazelle and M. Grigni and L. J. Guibas and J. E. Hershberger and M.
Sharir, J. Snoeyink and H. Edelsbrunner},
Title = {Ray shooting in polygons using geodesic triangulations},
Journal = {Algorithmica},
Volume = {12},
Pages = {54-68},
Year = {1994},
Key = {fds1872}
}
@article{fds1873,
Author = {B. Chazelle and L. J. Guibas and M. Sharir and H.
Edelsbrunner},
Title = {Algorithms for bichromatic line segment problems and
polyhedral terrains},
Journal = {Algorithmica},
Volume = {11},
Pages = {116-132},
Year = {1994},
Key = {fds1873}
}
@article{fds1874,
Author = {B. Chazelle and L. J. Guibas and J. E. Hershberger and R. Seidel and M.
Sharir and H. Edelsbrunner},
Title = {Selecting heavily covered points},
Journal = {SIAM J. Comput.},
Volume = {23},
Pages = {1138-1151},
Year = {1994},
Key = {fds1874}
}
@article{fds1250,
Author = {H. Edelsbrunner},
Title = {Computational geometry},
Booktitle = {Chapter 1 in Current Trends in Theoretical Computer Science,
Essays and Tutorials, 1-48},
Publisher = {World Scientific, Singapore},
Editor = {G. Rozenberg and A. Salomaa},
Year = {1993},
Key = {fds1250}
}
@article{fds1875,
Author = {B. Chazelle and L. J. Guibas and M. Sharir and H.
Edelsbrunner},
Title = {Diameter, width, closest line pair, and parametric
searching},
Journal = {Discrete Comput. Geom.},
Volume = {10},
Pages = {183-196},
Year = {1993},
Key = {fds1875}
}
@article{fds1876,
Author = {T. S. Tan and H. Edelsbrunner},
Title = {An upper bound for conforming Delaunay triangulations},
Journal = {Discrete Comput. Geom.},
Volume = {10},
Pages = {197-213},
Year = {1993},
Key = {fds1876}
}
@article{fds1877,
Author = {T. S. Tan and H. Edelsbrunner},
Title = {A quadratic time algorithm for the minmax length
triangulation},
Journal = {SIAM J. Comput.},
Volume = {22},
Pages = {527-551},
Year = {1993},
Key = {fds1877}
}
@article{fds1878,
Author = {M. Bern and D. Eppstein and S. Mitchell and T. S. Tan and H.
Edelsbrunner},
Title = {Edge insertion for optimal triangulations},
Journal = {Discrete Comput. Geom.},
Volume = {10},
Pages = {47-65},
Year = {1993},
Key = {fds1878}
}
@article{fds1879,
Author = {B. Chazelle and L. J. Guibas and M. Sharir and J. Snoeyink and H.
Edelsbrunner},
Title = {Computing a face in an arrangement of line segments and
related problems},
Journal = {SIAM J. Comput.},
Volume = {22},
Pages = {1286-1302},
Year = {1993},
Key = {fds1879}
}
@article{fds1880,
Author = {R. Seidel and M. Sharir and H. Edelsbrunner},
Title = {On the zone theorem for hyperplane arrangements},
Journal = {SIAM J. Comput.},
Volume = {22},
Pages = {418-429},
Year = {1993},
Key = {fds1880}
}
@article{fds1251,
Author = {H. Edelsbrunner},
Title = {Geometric algorithms},
Booktitle = {Chapter 2.9 in Handbook of Convex Geometry,
699-735},
Publisher = {North-Holland},
Editor = {P. Gruber and J. Wills},
Year = {1992},
Key = {fds1251}
}
@article{fds1881,
Author = {A. Aggarwal and P. Raghavan and P. Tiwari and H.
Edelsbrunner},
Title = {Optimal time bounds for some proximity problems in the
plane},
Journal = {Inform. Process. Lett.},
Volume = {42},
Pages = {55-60},
Year = {1992},
Key = {fds1881}
}
@article{fds1882,
Author = {T. S. Tan and R. Waupotitsch and H. Edelsbrunner},
Title = {An O log time algorithm for the minmax angle
triangulation},
Journal = {SIAM J. Sci. Stat. Comput.},
Volume = {13},
Pages = {994-1008},
Year = {1992},
Key = {fds1882}
}
@article{fds1883,
Author = {B. Aronov and L. J. Guibas and M. Sharir and H.
Edelsbrunner},
Title = {The number of edges of many faces in a line segment
arrangement},
Journal = {Combinatorica},
Volume = {12},
Pages = {261-274},
Year = {1992},
Key = {fds1883}
}
@article{fds1884,
Author = {B. Chazelle and L. J. Guibas and R. Pollack and R. Seidel and M. Sharir and J. Snoeyink and H. Edelsbrunner},
Title = {Counting and cutting cycles of lines and rods in
space},
Journal = {Computational Geometry: Theory and Applications},
Volume = {1},
Pages = {305-323},
Year = {1992},
Key = {fds1884}
}
@article{fds1885,
Author = {L. J. Guibas and J. Pach and R. Pollack and R. Seidel and M. Sharir and H. Edelsbrunner},
Title = {Arrangements of curves in the plane - topology,
combinatorics, and algorithms},
Journal = {Theoret. Comput. Sci.},
Volume = {92},
Pages = {319-336},
Year = {1992},
Key = {fds1885}
}
@article{fds1886,
Author = {B. Chazelle and H. Edelsbrunner},
Title = {An optimal algorithm for intersecting line segments in the
plane},
Journal = {J. Assoc. Comput. Mach.},
Volume = {39},
Pages = {1-54},
Year = {1992},
Key = {fds1886}
}
@article{fds1252,
Author = {H. Edelsbrunner},
Title = {Lines in space - a collection of results},
Series = {DIAMCS Series in Discrete Mathematics and Theoretical
Computer Science, vol. 6},
Booktitle = {Discrete and Computational Geometry, 77-93},
Editor = {R. Pollack and W. Steiger},
Year = {1991},
Key = {fds1252}
}
@article{fds1253,
Author = {M. Sharir and H. Edelsbrunner},
Title = {A hyperplane incidence problem with applications to counting
distances},
Series = {DIMACS Series in Discrete Mathematics and Theoretical
Computer Science},
Booktitle = {Applied Geometry and Discrete Mathematics The Victor Klee
Festschrift, 253-263},
Editor = {P. Gritzmann and B. Sturmfels},
Year = {1991},
Key = {fds1253}
}
@article{fds1887,
Author = {B. Aronov and B. Chazelle and L. J. Guibas and M. Sharir and R. Wenger and H. Edelsbrunner},
Title = {Points and triangles in the plane and halving planes in
space},
Journal = {Discrete Comput. Geom.},
Volume = {6},
Pages = {435-442},
Year = {1991},
Key = {fds1887}
}
@article{fds1888,
Author = {P. K. Agarwal and O. Schwarzkopf and E. Welzl and H.
Edelsbrunner},
Title = {Euclidean minimum spanning trees and bichromatic closest
pairs},
Journal = {Discrete Comput. Geom.},
Volume = {6},
Pages = {407-422},
Year = {1991},
Key = {fds1888}
}
@article{fds1889,
Author = {W. Shi and H. Edelsbrunner},
Title = {An O log time algorithm for the three-dimensional convex
hull problem},
Journal = {SIAM J. Comput.},
Volume = {20},
Pages = {259-269},
Year = {1991},
Key = {fds1889}
}
@article{fds1890,
Author = {B. Chazelle and L. J. Guibas and M. Sharir and H.
Edelsbrunner},
Title = {A singly exponential stratification scheme for real
semi-algebraic varieties and its applications},
Journal = {Theoret. Comput. Sci.},
Volume = {84},
Pages = {77-105},
Year = {1991},
Key = {fds1890}
}
@article{fds1891,
Author = {P. Hajnal and H. Edelsbrunner},
Title = {A lowerbound on thenumber of unit distances between the
vertices of a convex polygon},
Journal = {J. Combin. Theory Ser. A},
Volume = {56},
Pages = {312-316},
Year = {1991},
Key = {fds1891}
}
@article{fds1913,
Author = {H. Edelsbrunner},
Title = {Corrigendum},
Journal = {J. Comput. System Sci.},
Volume = {42},
Pages = {249-251},
Year = {1991},
Key = {fds1913}
}
@article{fds1254,
Author = {D. P. Dobkin and C. K. Yap and H. Edelsbrunner},
Title = {Probing convex polytopes},
Booktitle = {Autonomous Robot Vehicles, 328-341},
Publisher = {Springer-Verlag, New York},
Editor = {I. J. Cox and G. T. Wilfong},
Year = {1990},
Key = {fds1254}
}
@article{fds1892,
Author = {M. H. Overmars and E. Welzl and I. Ben-Arroyo Hartman and J. A.
Feldman and H. Edelsbrunner},
Title = {Ranking intervals under visibility constraints},
Journal = {Internat. J. Comput. Math.},
Volume = {34},
Pages = {129-144},
Year = {1990},
Key = {fds1892}
}
@article{fds1893,
Author = {F. P. Preparata and D. B. West and H. Edelsbrunner},
Title = {Tetrahedrizing point sets in three dimensions},
Journal = {J. Symbolic Comput.},
Volume = {10},
Pages = {335-347},
Year = {1990},
Key = {fds1893}
}
@article{fds1894,
Author = {L. J. Guibas and M. Sharir and H. Edelsbrunner},
Title = {The complexity ofmany cells in arrangements of planes and
related problems},
Journal = {Discrete Comput. Geom.},
Volume = {5},
Pages = {197-216},
Year = {1990},
Key = {fds1894}
}
@article{fds1895,
Author = {L. J. Guibas and M. Sharir and H. Edelsbrunner},
Title = {The complexity and construction of many faces in
arrangements of lines and of segments},
Journal = {Discrete Comput. Geom.},
Volume = {5},
Pages = {161-196},
Year = {1990},
Key = {fds1895}
}
@article{fds1896,
Author = {K. L. Clarkson and L. G. Guibas and M. Sharir and E. Welzl and H.
Edelsbrunner},
Title = {Combinatorial complexity bounds for arrangements of curves
and spheres},
Journal = {Discrete Comput. Geom.},
Volume = {5},
Pages = {99-160},
Year = {1990},
Key = {fds1896}
}
@article{fds1897,
Author = {H. Edelsbrunner},
Title = {An acyclicity theorem for cell complexes in d
dimensions},
Journal = {Combinatorica},
Volume = {10},
Pages = {251-260},
Year = {1990},
Key = {fds1897}
}
@article{fds1898,
Author = {D. L. Souvaine and H. Edelsbrunner},
Title = {Computing least median of squares regression lines and
guided topological sweep},
Journal = {J. Amer. Statist. Assoc.},
Volume = {85},
Pages = {115-119},
Year = {1990},
Key = {fds1898}
}
@article{fds1899,
Author = {D. P. Dobkin and M. H. Overmars and H. Edelsbrunner},
Title = {Searching for empty convex polygons},
Journal = {Algorithmica},
Volume = {5},
Pages = {561-571},
Year = {1990},
Key = {fds1899}
}
@article{fds1900,
Author = {E. P. Mucke and H. Edelsbrunner},
Title = {Simulation of simplicity: a technique to cope with
degenerate cases in geometric algorithms},
Journal = {ACM Trans. Graphics},
Volume = {9},
Pages = {66-104},
Year = {1990},
Key = {fds1900}
}
@article{fds1901,
Author = {A. D. Robison and X. J. Shen and H. Edelsbrunner},
Title = {Covering convex sets with non-overlapping
polygons},
Journal = {Discrete Math.},
Volume = {81},
Pages = {153-164},
Year = {1990},
Key = {fds1901}
}
@article{fds1902,
Author = {M. Sharir and H. Edelsbrunner},
Title = {The maximum number of ways to stab n convex nonintersecting
sets in the plane is 2 n},
Journal = {Discrete Comput. Geom.},
Volume = {5},
Pages = {35-42},
Year = {1990},
Key = {fds1902}
}
@article{fds1903,
Author = {L. J. Guibas and J. Hershberger and R. Seidel and M. Sharir and J.
Snoeyink, E. Welzl and H. Edelsbrunner},
Title = {Implicitly representing arrangements of lines or
segments},
Journal = {Discrete Comput. Geom.},
Volume = {4},
Pages = {433-466},
Year = {1989},
Key = {fds1903}
}
@article{fds1904,
Author = {L. J. Guibas and J. Hershberger and J. Pach and R. Pollack and R.
Seidel, M. Sharir and J. Snoeyink and H. Edelsbrunner},
Title = {On arrangements of Jordan arcs with three intersections per
pair},
Journal = {Discrete Comput. Geom.},
Volume = {4},
Pages = {523-539},
Year = {1989},
Key = {fds1904}
}
@article{fds1905,
Author = {F. F. Yao and D. P. Dobkin and M. S. Paterson and H.
Edelsbrunner},
Title = {Partitioning space for range queries},
Journal = {SIAM J. Comput.},
Volume = {18},
Pages = {371-384},
Year = {1989},
Key = {fds1905}
}
@article{fds1906,
Author = {N. Hasan and R. Seidel and X. J. Shen and H. Edelsbrunner},
Title = {Circles through two points that always enclose many
points},
Journal = {Geometriae Dedicata},
Volume = {32},
Pages = {1-12},
Year = {1989},
Key = {fds1906}
}
@article{fds1907,
Author = {H. Edelsbrunner},
Title = {The upper envelope of piecewise linear functions: tight
bounds on the number of faces},
Journal = {Discrete Comput. Geom.},
Volume = {4},
Pages = {337-343},
Year = {1989},
Key = {fds1907}
}
@article{fds1908,
Author = {L. J. Guibas and M. Sharir and H. Edelsbrunner},
Title = {The upper envelope of piecewise linear functions: algorithms
and applications},
Journal = {Discrete Comput. Geom.},
Volume = {4},
Pages = {311-336},
Year = {1989},
Key = {fds1908}
}
@article{fds1909,
Author = {G. Rote and E. Welzl and H. Edelsbrunner},
Title = {Testing the necklace condition for shortest tours and
optimal factors in the plane},
Journal = {Theoret. Comput. Sci.},
Volume = {66},
Pages = {157-180},
Year = {1989},
Key = {fds1909}
}
@article{fds1910,
Author = {B. Chazelle and L. J. Guibas and H. Edelsbrunner},
Title = {The complexity of cutting complexes},
Journal = {Discrete Comput. Geom.},
Volume = {4},
Pages = {139-182},
Year = {1989},
Key = {fds1910}
}
@article{fds1911,
Author = {S. S. Skiena and H. Edelsbrunner},
Title = {On the number of furthest neighbour pairs in a point
set},
Journal = {Amer. Math. Monthly},
Volume = {96},
Pages = {614-618},
Year = {1989},
Key = {fds1911}
}
@article{fds1912,
Author = {L. J. Guibas and H. Edelsbrunner},
Title = {Topologically sweeping an arrangement},
Journal = {J. Comput. System Sci.},
Volume = {38},
Pages = {165-194},
Year = {1989},
Key = {fds1912}
}
@article{fds1914,
Author = {S. S. Skiena and H. Edelsbrunner},
Title = {Probing convex polygons with x-rays},
Journal = {SIAM J. Comput.},
Volume = {17},
Pages = {870-882},
Year = {1988},
Key = {fds1914}
}
@article{fds1915,
Author = {F. P. Preparata and H. Edelsbrunner},
Title = {Minimum polygonal separation},
Journal = {Inform. and Comput.},
Volume = {77},
Pages = {218-232},
Year = {1988},
Key = {fds1915}
}
@article{fds1916,
Author = {X. J. Shen and H. Edelsbrunner},
Title = {A tight lower bound on the size of visibility
graphs},
Journal = {Inform. Process. Lett.},
Volume = {26},
Pages = {61-64},
Year = {1987},
Key = {fds1916}
}
@article{fds1918,
Author = {B. Chazelle and H. Edelsbrunner},
Title = {Linear space data structures for two types of range
search},
Journal = {Discrete Comput. Geom.},
Volume = {2},
Pages = {113-126},
Year = {1987},
Key = {fds1918}
}
@article{fds1919,
Author = {B. Chazelle and H. Edelsbrunner},
Title = {An improved algorithm for constructing k -order Voronoi
diagrams},
Journal = {IEEE Trans. Comput.},
Volume = {C-36},
Pages = {1349-1354},
Year = {1987},
Key = {fds1919}
}
@article{fds1920,
Author = {M. H. Overmars and H. Edelsbrunner},
Title = {Zooming by repeated range detection},
Journal = {Inform. Process. Lett.},
Volume = {24},
Pages = {413-417},
Year = {1987},
Key = {fds1920}
}
@article{fds1921,
Author = {D. P. Dobkin and H. Edelsbrunner},
Title = {Space searching for intersecing objects},
Journal = {J. Algorithms},
Volume = {8},
Pages = {348-361},
Year = {1987},
Key = {fds1921}
}
@article{fds1922,
Author = {R. Waupotitsch and H. Edelsbrunner},
Title = {Computing a ham-sandwich cutintwo dimensions},
Journal = {J. Symbolic Comput.},
Volume = {2},
Pages = {171-178},
Year = {1986},
Key = {fds1922}
}
@article{fds1923,
Author = {R. Seidel and H. Edelsbrunner},
Title = {Voronoi diagrams and arrangements},
Journal = {Discrete Comput. Geom.},
Volume = {1},
Pages = {25-44},
Year = {1986},
Key = {fds1923}
}
@article{fds1924,
Author = {G. Stockl and H. Edelsbrunner},
Title = {The number of extreme pairs of finite point-sets in
Euclidean spaces},
Journal = {J. Combin. Theory Ser. A},
Volume = {43},
Pages = {344-349},
Year = {1986},
Key = {fds1924}
}
@article{fds1925,
Author = {H. Edelsbrunner},
Title = {Edge-skeletons in arrangements with applications},
Journal = {Algorithmica},
Volume = {1},
Pages = {93-109},
Year = {1986},
Key = {fds1925}
}
@article{fds1926,
Author = {D. Haussler and H. Edelsbrunner},
Title = {The complexity of cells in three-dimensional
arrangements},
Journal = {Discrete Math.},
Volume = {60},
Pages = {139-146},
Year = {1986},
Key = {fds1926}
}
@article{fds1927,
Author = {J. O'Rourke and R. Seidel and H. Edelsbrunner},
Title = {Constructing arrangements of lines and hyperplanes with
applications},
Journal = {SIAM J. Comput.},
Volume = {15},
Pages = {341-363},
Year = {1986},
Key = {fds1927}
}
@article{fds1928,
Author = {J. W. Jaromczyk and H. Edelsbrunner},
Title = {How often can you see yourself in a convex configuration of
mirrors?},
Journal = {Congressus Numerantium},
Volume = {53},
Pages = {193-200},
Year = {1986},
Key = {fds1928}
}
@article{fds1929,
Author = {G. Haring and D. Hilbert and H. Edelsbrunner},
Title = {Rectangular point location in d dimensions with
applications},
Journal = {Comput. J.},
Volume = {29},
Pages = {76-82},
Year = {1986},
Key = {fds1929}
}
@article{fds1930,
Author = {L. J. Guibas and J. Stolfi and H. Edelsbrunner},
Title = {Optimal point location in a monotone subdivision},
Journal = {SIAM J. Comput.},
Volume = {15},
Pages = {317-340},
Year = {1986},
Key = {fds1930}
}
@article{fds1931,
Author = {E. Welzl and H. Edelsbrunner},
Title = {Halfplanar range search in linear space and O( n query
time},
Journal = {Inform. Process. Lett.},
Volume = {23},
Pages = {289-293},
Year = {1986},
Key = {fds1931}
}
@article{fds1932,
Author = {E. Welzl and H. Edelsbrunner},
Title = {On the maximal number of edges of many faces in an
arrangement},
Journal = {J. Combin. Theory Ser. A},
Volume = {41},
Pages = {159-166},
Year = {1986},
Key = {fds1932}
}
@article{fds1933,
Author = {E. Welzl and H. Edelsbrunner},
Title = {Constructing belts in two-dimensional arrangements with
applications},
Journal = {SIAM J. Comput.},
Volume = {15},
Pages = {271-284},
Year = {1986},
Key = {fds1933}
}
@article{fds1934,
Author = {B. Chazelle and H. Edelsbrunner},
Title = {Optimal solutions for a class of point retrieval
problems},
Journal = {J. Symbolic Comput.},
Volume = {1},
Pages = {47-56},
Year = {1985},
Key = {fds1934}
}
@article{fds1935,
Author = {W. H. E. Day and H. Edelsbrunner},
Title = {Investigation of proportional link linkage clustering
methods},
Journal = {J. Classification},
Volume = {2},
Pages = {239-254},
Year = {1985},
Key = {fds1935}
}
@article{fds1936,
Author = {H. A. Maurer and H. Edelsbrunner},
Title = {Finding extreme points in three dimensions and solving the
post-oÆce problem in the plane},
Journal = {Inform. Process. Lett.},
Volume = {21},
Pages = {39-47},
Year = {1985},
Key = {fds1936}
}
@article{fds1937,
Author = {M. H. Overmars and H. Edelsbrunner},
Title = {Batched dynamic solutions to decomposable searching
problems},
Journal = {J. Algorithms},
Volume = {6},
Pages = {515-542},
Year = {1985},
Key = {fds1937}
}
@article{fds1938,
Author = {E. Welzl and H. Edelsbrunner},
Title = {On the number of line separations of a finite set in the
plane},
Journal = {J. Combin. Theory Ser. A},
Volume = {38},
Pages = {15-29},
Year = {1985},
Key = {fds1938}
}
@article{fds1939,
Author = {H. Edelsbrunner},
Title = {Computing the extreme distances between two convex
polygons},
Journal = {J. Algorithms},
Volume = {6},
Pages = {213-224},
Year = {1985},
Key = {fds1939}
}
@article{fds1940,
Author = {H. Edelsbrunner},
Title = {Finding transversals for sets of simple geometric
figures},
Journal = {Theoret. Comput. Sci.},
Volume = {35},
Pages = {55-69},
Year = {1985},
Key = {fds1940}
}
@article{fds1941,
Author = {W. H. E. Day and H. Edelsbrunner},
Title = {EÆcient algorithms for agglomerative hierarchical
clustering methods},
Journal = {J. Classification},
Volume = {1},
Pages = {7-24},
Year = {1984},
Key = {fds1941}
}
@article{fds1942,
Author = {M. H. Overmars and R. Seidel and H. Edelsbrunner},
Title = {Some methods of computational geometry applied to computer
graphics},
Journal = {Comput. Vision, Graphics, Image Process},
Volume = {28},
Pages = {92-108},
Year = {1984},
Key = {fds1942}
}
@article{fds1943,
Author = {J. O'Rourke and E. Welzl and H. Edelsbrunner},
Title = {Stationing guards in rectilinear art galleries},
Journal = {Comput. Vision, Graphics, Image Process},
Volume = {28},
Pages = {167-176},
Year = {1984},
Key = {fds1943}
}
@article{fds1944,
Author = {F. Aurenhammer and H. Edelsbrunner},
Title = {An optimal algorithm for constructing the weighted Voronoi
diagram in the plane},
Journal = {Pattern Recognition},
Volume = {17},
Pages = {251-257},
Year = {1984},
Key = {fds1944}
}
@article{fds1945,
Author = {J. v. Leeuwen and Th. Ottmann and D. Wood and H.
Edelsbrunner},
Title = {Computing the connected components of simple rectilinear
geometrical objects in d -space},
Journal = {RAIRO Inform. Theor.},
Volume = {18},
Pages = {171-183},
Year = {1984},
Key = {fds1945}
}
@article{fds1255,
Author = {M. H. Overmars and D. Wood and H. Edelsbrunner},
Title = {Graphics in Flatland: a case study},
Booktitle = {Advances in Computing Research, Vol. 1, 35-59},
Publisher = {Jai Press, London},
Editor = {F. P. Preparata},
Year = {1983},
Key = {fds1255}
}
@article{fds1256,
Author = {W. Bucher and H. Edelsbrunner},
Title = {On expected-and worst-case segment trees},
Booktitle = {Advances in Computing Research Vol. 1, 109-125},
Publisher = {Jai Press, London},
Editor = {F. P. Preparata},
Year = {1983},
Key = {fds1256}
}
@article{fds1946,
Author = {D. G. Kirkpatrick and R. Seidel and H. Edelsbrunner},
Title = {On the shape of a set of points in the plane},
Journal = {IEEE Trans. Inform. Theory},
Volume = {IT-29},
Pages = {551-559},
Year = {1983},
Key = {fds1946}
}
@article{fds1947,
Author = {H. Edelsbrunner},
Title = {A new approach to rectangle intersections - part
II},
Journal = {Internat. J. Comput. Math.},
Volume = {13},
Pages = {221-229},
Year = {1983},
Key = {fds1947}
}
@article{fds1948,
Author = {H. Edelsbrunner},
Title = {A new approach to rectangle intersections - part
I},
Journal = {Internat. J. Comput. Math.},
Volume = {13},
Pages = {209-219},
Year = {1983},
Key = {fds1948}
}
@article{fds1949,
Author = {H. A. Maurer and F. P. Preparata and A. L. Rosenberg and E. Welzl and D.
Wood and H. Edelsbrunner},
Title = {Stabbing line segments},
Journal = {BIT},
Volume = {22},
Pages = {274-281},
Year = {1982},
Key = {fds1949}
}
@article{fds1950,
Author = {M. H. Overmars and H. Edelsbrunner},
Title = {On the equivalence of some rectangle problems},
Journal = {Inform. Process. Lett.},
Volume = {14},
Pages = {124-127},
Year = {1982},
Key = {fds1950}
}
@article{fds1951,
Author = {D. G. Kirkpatrick and H. A. Maurer and H. Edelsbrunner},
Title = {Polygonal intersection searching},
Journal = {Inform. Process. Lett.},
Volume = {14},
Pages = {74-79},
Year = {1982},
Key = {fds1951}
}
@article{fds1952,
Author = {H. A. Maurer and H. Edelsbrunner},
Title = {A space-optimal solution of general region
location},
Journal = {Theoret. Comput. Sci.},
Volume = {16},
Pages = {329-336},
Year = {1981},
Key = {fds1952}
}
@article{fds1953,
Author = {H. A. Maurer and H. Edelsbrunner},
Title = {On the intersection of orthogonal objects},
Journal = {Inform. Process. Lett.},
Volume = {13},
Pages = {177-181},
Year = {1981},
Key = {fds1953}
}
%% Journal or Book articles OFFICIALLY ACCEPTED
@article{fds1227,
Author = {D. Letscher and A. Zomorodian and H. Edelsbrunner},
Title = {Topological persistence and simplification},
Journal = {Discrete Comput. Geom.},
Year = {2002},
Key = {fds1227}
}
@article{fds1230,
Author = {A. Zomorodian and H. Edelsbrunner},
Title = {Fast software for box intersections},
Journal = {Internat. J. Comput. Geom. Appl.},
Year = {2002},
Key = {fds1230}
}
%% Books PUBLISHED
@article{fds1225,
Author = {H. Edelsbrunner},
Title = {Geometry and Topology for Mesh Generation},
Publisher = {Cambridge Univ. Press, England},
Year = {2001},
Key = {fds1225}
}
@article{fds1226,
Author = {H. Edelsbrunner},
Title = {Algorithms in Combinatorial Geometry},
Publisher = {Springer-Verlag, Heidelberg, Germany, 1987},
Year = {1995},
Key = {fds1226}
}