Herbert Edelsbrunner

338 papers A* 41A 5B 15C 3Misc 4Journal 194Unranked 65

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Flips in two-dimensional hypertriangulations. Eur. J. Comb. Herbert Edelsbrunner, Alexey Garber, Mohadese Ghafari, Teresa Heiss, Morteza Saghafian
2026	J	`jnl`	Maximum Betti Numbers of Čech Complexes. Discret. Comput. Geom. Herbert Edelsbrunner, János Pach
2026	J	`jnl`	Maximum persistent Betti numbers of Čech complexes. J. Appl. Comput. Topol. Herbert Edelsbrunner, Matthew Kahle, Shu Kanazawa
2026	J	`jnl`	On the Size of Chromatic Delaunay Mosaics. Discret. Comput. Geom. Ranita Biswas, Sebastiano Cultrera di Montesano, Ondrej Draganov, Herbert Edelsbrunner, Morteza Saghafian
2025	J	`jnl`	Average and Expected Distortion of Voronoi Paths and Scapes. Discret. Comput. Geom. Herbert Edelsbrunner, Anton V. Nikitenko
2025	A*	`conf`	Banana Trees for the Persistence in Time Series Experimentally. SoCG Lara Ost, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner
2025	J	`jnl`	Counting Equilibria of the Electrostatic Potential. CoRR Herbert Edelsbrunner, Christopher Fillmore, Gonçalo Oliveira
2025	J	`jnl`	Expected Length of the Euclidean Minimum Spanning Tree and 1-norms of Chromatic Persistence Diagrams in the Plane. CoRR Ondrej Draganov, Herbert Edelsbrunner, Sophie Rosenmeier, Morteza Saghafian
2025	A*	`conf`	On Spheres with k Points Inside. SoCG Herbert Edelsbrunner, Alexey Garber, Morteza Saghafian
2025	J	`jnl`	The Beauty of Random Polytopes Inscribed in the 2-Sphere. Exp. Math. Arseniy V. Akopyan, Herbert Edelsbrunner, Anton V. Nikitenko
2025	—	`conf`	The Mid-sphere Cousin of the Medial Axis Transform. DGMM Herbert Edelsbrunner, Elizabeth Stephenson, Martin Hafskjold Thoresen
2025	J	`jnl`	The Mid-sphere Cousin of the Medial Axis Transform. CoRR Herbert Edelsbrunner, Elizabeth Stephenson, Martin Hafskjold Thoresen
2025	J	`jnl`	Tight Bounds Between the Jensen-Shannon Divergence and the Minmax Divergence. Entropy Arseniy V. Akopyan, Herbert Edelsbrunner, Ziga Virk, Hubert Wagner
2024	J	`jnl`	Banana Trees for the Persistence in Time Series Experimentally. CoRR Lara Ost, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner
2024	J	`jnl`	Brillouin Zones of Integer Lattices and Their Perturbations. SIAM J. Discret. Math. Herbert Edelsbrunner, Alexey Garber, Mohadese Ghafari, Teresa Heiss, Morteza Saghafian, Mathijs Wintraecken
2024	J	`jnl`	Chromatic Topological Data Analysis. CoRR Sebastiano Cultrera di Montesano, Ondrej Draganov, Herbert Edelsbrunner, Morteza Saghafian
2024	J	`jnl`	Depth in arrangements: Dehn-Sommerville-Euler relations with applications. J. Appl. Comput. Topol. Ranita Biswas, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Morteza Saghafian
2024	A*	`conf`	Dynamically Maintaining the Persistent Homology of Time Series. SODA Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Monika Henzinger, Lara Ost
2024	J	`jnl`	Geometric characterization of the persistence of 1D maps. J. Appl. Comput. Topol. Ranita Biswas, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Morteza Saghafian
2024	A*	`conf`	Maximum Betti Numbers of Čech Complexes. SoCG Herbert Edelsbrunner, János Pach
2024	J	`jnl`	Merge Trees of Periodic Filtrations. CoRR Herbert Edelsbrunner, Teresa Heiss
2024	J	`jnl`	On Angles in Higher Order Brillouin Tessellations and Related Tilings in the Plane. Discret. Comput. Geom. Herbert Edelsbrunner, Alexey Garber, Mohadese Ghafari, Teresa Heiss, Morteza Saghafian
2024	J	`jnl`	On Spheres with CoRR Herbert Edelsbrunner, Alexey Garber, Morteza Saghafian
2024	A	`conf`	The Euclidean MST-Ratio for Bi-Colored Lattices. GD Sebastiano Cultrera di Montesano, Ondrej Draganov, Herbert Edelsbrunner, Morteza Saghafian
2024	J	`jnl`	The Euclidean MST-ratio for Bi-colored Lattices. CoRR Sebastiano Cultrera di Montesano, Ondrej Draganov, Herbert Edelsbrunner, Morteza Saghafian
2024	J	`jnl`	Understanding Higher-Order Interactions in Information Space. Entropy Herbert Edelsbrunner, Katharina Ölsböck, Hubert Wagner
2023	J	`jnl`	A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes. Algorithmica Herbert Edelsbrunner, Georg Osang
2023	J	`jnl`	Computing the Volume, Surface Area, Mean, and Gaussian Curvatures of Molecules and Their Derivatives. J. Chem. Inf. Model. Patrice Koehl, Arseniy V. Akopyan, Herbert Edelsbrunner
2023	J	`jnl`	Dynamically Maintaining the Persistent Homology of Time Series. CoRR Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Monika Henzinger, Lara Ost
2023	J	`jnl`	Order-2 Delaunay Triangulations Optimize Angles. CoRR Herbert Edelsbrunner, Alexey Garber, Morteza Saghafian
2023	J	`jnl`	The Depth Poset of a Filtered Lefschetz Complex. CoRR Herbert Edelsbrunner, Marian Mrozek
2022	J	`jnl`	Brillouin Zones of Integer Lattices and Their Perturbations. CoRR Herbert Edelsbrunner, Alexey Garber, Mohadese Ghafari, Teresa Heiss, Morteza Saghafian, Mathijs Wintraecken
2022	J	`jnl`	Continuous and Discrete Radius Functions on Voronoi Tessellations and Delaunay Mosaics. Discret. Comput. Geom. Ranita Biswas, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Morteza Saghafian
2022	J	`jnl`	On Angles in Higher Order Brillouin Tessellations and Related Tilings in the Plane. CoRR Herbert Edelsbrunner, Alexey Garber, Mohadese Ghafari, Teresa Heiss, Morteza Saghafian
2022	J	`jnl`	On the Size of Chromatic Delaunay Mosaics. CoRR Ranita Biswas, Sebastiano Cultrera di Montesano, Ondrej Draganov, Herbert Edelsbrunner, Morteza Saghafian
2022	J	`jnl`	Persistent Homology of Chromatic Alpha Complexes. CoRR Sebastiano Cultrera di Montesano, Ondrej Draganov, Herbert Edelsbrunner, Morteza Saghafian
2021	A*	`conf`	Counting Cells of Order-k Voronoi Tessellations in ℝ³ with Morse Theory. SoCG Ranita Biswas, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Morteza Saghafian
2021	A*	`conf`	The Density Fingerprint of a Periodic Point Set. SoCG Herbert Edelsbrunner, Teresa Heiss, Vitaliy Kurlin, Philip Smith, Mathijs Wintraecken
2021	J	`jnl`	The Density Fingerprint of a Periodic Point Set. CoRR Herbert Edelsbrunner, Teresa Heiss, Vitaliy Kurlin, Philip Smith, Mathijs Wintraecken
2021	J	`jnl`	The Multi-Cover Persistence of Euclidean Balls. Discret. Comput. Geom. Herbert Edelsbrunner, Georg Osang
2021	J	`jnl`	Tri-Partitions and Bases of an Ordered Complex. CoRR Herbert Edelsbrunner, Katharina Ölsböck
2020	J	`jnl`	A Simple Algorithm for Higher-order Delaunay Mosaics and Alpha Shapes. CoRR Herbert Edelsbrunner, Georg Osang
2020	J	`jnl`	Topological data analysis in information space. J. Comput. Geom. Herbert Edelsbrunner, Ziga Virk, Hubert Wagner
2020	J	`jnl`	Tri-partitions and Bases of an Ordered Complex. Discret. Comput. Geom. Herbert Edelsbrunner, Katharina Ölsböck
2020	J	`jnl`	Čech-Delaunay gradient flow and homology inference for self-maps. J. Appl. Comput. Topol. Ulrich Bauer, Herbert Edelsbrunner, Grzegorz Jablonski, Marian Mrozek
2019	J	`jnl`	Holes and dependences in an ordered complex. Comput. Aided Geom. Des. Herbert Edelsbrunner, Katharina Ölsböck
2019	J	`jnl`	Poisson-Delaunay Mosaics of Order k. Discret. Comput. Geom. Herbert Edelsbrunner, Anton V. Nikitenko
2019	J	`jnl`	The Weighted Gaussian Curvature Derivative of a Space-Filling Diagram. CoRR Arseniy V. Akopyan, Herbert Edelsbrunner
2019	J	`jnl`	The Weighted Mean Curvature Derivative of a Space-Filling Diagram. CoRR Arseniy V. Akopyan, Herbert Edelsbrunner
2019	A*	`conf`	Topological Data Analysis in Information Space. SoCG Herbert Edelsbrunner, Ziga Virk, Hubert Wagner
2019	J	`jnl`	Topological Data Analysis in Information Space. CoRR Herbert Edelsbrunner, Ziga Virk, Hubert Wagner
2018	J	`jnl`	Multiple covers with balls I: Inclusion-exclusion. Comput. Geom. Herbert Edelsbrunner, Mabel Iglesias Ham
2018	J	`jnl`	On the Optimality of the FCC Lattice for Soft Sphere Packing. SIAM J. Discret. Math. Herbert Edelsbrunner, Mabel Iglesias Ham
2018	A*	`conf`	Smallest Enclosing Spheres and Chernoff Points in BregmanGeometry. SoCG Herbert Edelsbrunner, Ziga Virk, Hubert Wagner
2018	A*	`conf`	The Multi-cover Persistence of Euclidean Balls. SoCG Herbert Edelsbrunner, Georg Osang
2018	J	`jnl`	Topological data analysis with Bregman divergences. J. Comput. Geom. Herbert Edelsbrunner, Hubert Wagner
2017	J	`jnl`	Persistence in sampled dynamical systems faster. CoRR Ulrich Bauer, Herbert Edelsbrunner, Grzegorz Jablonski, Marian Mrozek
2017	J	`jnl`	The Voronoi functional is maximized by the Delaunay triangulation in the plane. Comb. Herbert Edelsbrunner, Alexey A. Glazyrin, Oleg R. Musin, Anton V. Nikitenko
2017	A*	`conf`	Topological Data Analysis with Bregman Divergences. SoCG Herbert Edelsbrunner, Hubert Wagner
2016	J	`jnl`	Multiple Covers with Balls II: Weighted Averages. Electron. Notes Discret. Math. Herbert Edelsbrunner, Mabel Iglesias Ham
2016	J	`jnl`	The classification of endoscopy images with persistent homology. Pattern Recognit. Lett. Olga Dunaeva, Herbert Edelsbrunner, Anton Lukyanov, Michael Machin, Daria Malkova, Roman Kuvaev, Sergey Kashin
2016	J	`jnl`	Topological Data Analysis with Bregman Divergences. CoRR Herbert Edelsbrunner, Hubert Wagner
2015	—	`conf`	Relaxed Disk Packing. CCCG Mabel Iglesias Ham, Herbert Edelsbrunner, Vitaliy Kurlin
2015	J	`jnl`	Relaxed Disk Packing. CoRR Herbert Edelsbrunner, Mabel Iglesias Ham, Vitaliy Kurlin
2015	J	`jnl`	The Persistent Homology of a Self-Map. Found. Comput. Math. Herbert Edelsbrunner, Grzegorz Jablonski, Marian Mrozek
2015	J	`jnl`	Triangulations from topologically correct digital Voronoi diagrams. Comput. Geom. Thanh-Tung Cao, Herbert Edelsbrunner, Tiow Seng Tan
2014	A*	`conf`	On the Computational Complexity of Betti Numbers: Reductions from Matrix Rank. SODA Herbert Edelsbrunner, Salman Parsa
2014	J	`jnl`	Stable Length Estimates of Tube-Like Shapes. J. Math. Imaging Vis. Herbert Edelsbrunner, Florian Pausinger
2014	Misc	`conf`	The Classification of Endoscopy Images with Persistent Homology. SYNASC Olga Dunaeva, Herbert Edelsbrunner, Anton Lukyanov, Michael Machin, Daria Malkova
2014	C	`conf`	The Geometry and Topology of Data Analysis. DATA Herbert Edelsbrunner
2014	A*	`conf`	The Morse Theory of Čech and Delaunay Filtrations. SoCG Ulrich Bauer, Herbert Edelsbrunner
2013	A	`conf`	3D kinetic alpha complexes and their implementation. ALENEX Michael Kerber, Herbert Edelsbrunner
2013	J	`jnl`	Add Isotropic Gaussian Kernels at Own Risk: More and More Resilient Modes in Higher Dimensions. Discret. Comput. Geom. Herbert Edelsbrunner, Brittany Terese Fasy, Günter Rote
2013	—	`conf`	Persistent Homology in Image Processing. GbRPR Herbert Edelsbrunner
2013	J	`jnl`	The Morse theory of Čech and Delaunay filtrations. CoRR Ulrich Bauer, Herbert Edelsbrunner
2012	J	`jnl`	A point calculus for interlevel set homology. Pattern Recognit. Lett. Paul Bendich, Sergio Cabello, Herbert Edelsbrunner
2012	—	`conf`	Add isotropic Gaussian kernels at own risk: more and more resilient modes in higher dimensions. SCG Herbert Edelsbrunner, Brittany Terese Fasy, Günter Rote
2012	—	`conf`	Alexander duality for functions: the persistent behavior of land and water and shore. SCG Herbert Edelsbrunner, Michael Kerber
2012	J	`jnl`	Dual Complexes of Cubical Subdivisions of ℝ n. Discret. Comput. Geom. Herbert Edelsbrunner, Michael Kerber
2012	—	`conf`	The Adaptive Topology of a Digital Image. ISVD Herbert Edelsbrunner, Olga Symonova
2012	J	`jnl`	The Medusa of Spatial Sorting: 3D Kinetic Alpha Complexes and Implementation CoRR Michael Kerber, Herbert Edelsbrunner
2012	J	`jnl`	The Medusa of Spatial Sorting: Topological Construction CoRR Herbert Edelsbrunner, Carl-Philipp Heisenberg, Michael Kerber, Gabriel Krens
2011	J	`jnl`	Alexander Duality for Functions: the Persistent Behavior of Land and Water and Shore CoRR Herbert Edelsbrunner, Michael Kerber
2011	J	`jnl`	Alpha, Betti and the Megaparsec Universe: On the Topology of the Cosmic Web. Trans. Comput. Sci. Rien van de Weygaert, Gert Vegter, Herbert Edelsbrunner, Bernard J. T. Jones, Pratyush Pranav, Changbom Park, Wojciech A. Hellwing, Bob Eldering, Nico Kruithof, E. G. P. (Patrick) Bos, Johan Hidding, Job Feldbrugge, Eline ten Have, Matti van Engelen, Manuel Caroli, Monique Teillaud
2011	J	`jnl`	Computing elevation maxima by searching the gauss sphere. ACM J. Exp. Algorithmics Bei Wang, Herbert Edelsbrunner, Dmitriy Morozov
2011	—	`conf`	Covering and Packing with Spheres by Diagonal Distortion in ℝ Rainbow of Computer Science Herbert Edelsbrunner, Michael Kerber
2011	A*	`conf`	Detailed reconstruction of 3D plant root shape. ICCV Ying Zheng, Steve Gu, Herbert Edelsbrunner, Carlo Tomasi, Philip Benfey
2011	A*	`conf`	Diffusion runs low on persistence fast. ICCV Chao Chen, Herbert Edelsbrunner
2011	J	`jnl`	Homology and Robustness of Level and Interlevel Sets CoRR Paul Bendich, Herbert Edelsbrunner, Dmitriy Morozov, Amit K. Patel
2011	J	`jnl`	Letter from the New Editors-in-Chief. Discret. Comput. Geom. Herbert Edelsbrunner, János Pach, Günter M. Ziegler
2011	J	`jnl`	Quantifying Transversality by Measuring the Robustness of Intersections. Found. Comput. Math. Herbert Edelsbrunner, Dmitriy Morozov, Amit K. Patel
2011	—	`ch.`	The Stability of the Apparent Contour of an Orientable 2-Manifold. Topological Methods in Data Analysis and Visualization Herbert Edelsbrunner, Dmitriy Morozov, Amit K. Patel
2010	—	`book`	Computational Topology - an Introduction. Herbert Edelsbrunner, John Harer
2010	J	`jnl`	Computing Robustness and Persistence for Images. IEEE Trans. Vis. Comput. Graph. Paul Bendich, Herbert Edelsbrunner, Michael Kerber
2010	J	`jnl`	Lipschitz Functions Have Found. Comput. Math. David Cohen-Steiner, Herbert Edelsbrunner, John Harer, Yuriy Mileyko
2010	B	`conf`	Mean-Payoff Automaton Expressions. CONCUR Krishnendu Chatterjee, Laurent Doyen, Herbert Edelsbrunner, Thomas A. Henzinger, Philippe Rannou
2010	J	`jnl`	Mean-payoff Automaton Expressions CoRR Krishnendu Chatterjee, Laurent Doyen, Herbert Edelsbrunner, Thomas A. Henzinger, Philippe Rannou
2010	B	`conf`	Persistent Homology under Non-uniform Error. MFCS Paul Bendich, Herbert Edelsbrunner, Michael Kerber, Amit K. Patel
2010	—	`conf`	The Robustness of Level Sets. ESA (1) Paul Bendich, Herbert Edelsbrunner, Dmitriy Morozov, Amit K. Patel
2009	B	`conf`	Computing Elevation Maxima by Searching the Gauss Sphere. SEA Bei Wang, Herbert Edelsbrunner, Dmitriy Morozov
2009	J	`jnl`	Extending Persistence Using Poincaré and Lefschetz Duality. Found. Comput. Math. David Cohen-Steiner, Herbert Edelsbrunner, John Harer
2009	J	`jnl`	Extending Persistence Using Poincaré and Lefschetz Duality. Found. Comput. Math. David Cohen-Steiner, Herbert Edelsbrunner, John Harer
2009	A*	`conf`	Persistent homology for kernels, images, and cokernels. SODA David Cohen-Steiner, Herbert Edelsbrunner, John Harer, Dmitriy Morozov
2009	J	`jnl`	Quantifying Transversality by Measuring the Robustness of Intersections CoRR Herbert Edelsbrunner, Dmitriy Morozov, Amit K. Patel
2009	—	`ch.`	Stability and Computation of Medial Axes - a State-of-the-Art Report. Mathematical Foundations of Scientific Visualization, Computer Graphics, and Massive Data Exploration Dominique Attali, Jean-Daniel Boissonnat, Herbert Edelsbrunner
2009	—	`conf`	The Persistent Morse Complex Segmentation of a 3-Manifold. 3DPH Herbert Edelsbrunner, John Harer
2008	—	`conf`	Reeb spaces of piecewise linear mappings. SCG Herbert Edelsbrunner, John Harer, Amit K. Patel
2008	—	`ch.`	Skeletal Structures. Shape Analysis and Structuring Silvia Biasotti, Dominique Attali, Jean-Daniel Boissonnat, Herbert Edelsbrunner, Gershon Elber, Michela Mortara, Gabriella Sanniti di Baja, Michela Spagnuolo, Mirela Tanase, Remco C. Veltkamp
2008	J	`jnl`	Time-varying Reeb graphs for continuous space-time data. Comput. Geom. Herbert Edelsbrunner, John Harer, Ajith Mascarenhas, Valerio Pascucci, Jack Snoeyink
2007	B	`conf`	Alpha-Beta Witness Complexes. WADS Dominique Attali, Herbert Edelsbrunner, John Harer, Yuriy Mileyko
2007	—	`conf`	An introduction to persistent homology. Symposium on Solid and Physical Modeling Herbert Edelsbrunner
2007	J	`jnl`	Inclusion-Exclusion Formulas from Independent Complexes. Discret. Comput. Geom. Dominique Attali, Herbert Edelsbrunner
2007	J	`jnl`	Inequalities for the Curvature of Curves and Surfaces. Found. Comput. Math. David Cohen-Steiner, Herbert Edelsbrunner
2007	A*	`conf`	Inferring Local Homology from Sampled Stratified Spaces. FOCS Paul Bendich, David Cohen-Steiner, Herbert Edelsbrunner, John Harer, Dmitriy Morozov
2007	J	`jnl`	Stability of Persistence Diagrams. Discret. Comput. Geom. David Cohen-Steiner, Herbert Edelsbrunner, John Harer
2007	—	`conf`	Weak witnesses for Delaunay triangulations of submanifolds. Symposium on Solid and Physical Modeling Dominique Attali, Herbert Edelsbrunner, Yuriy Mileyko
2006	J	`jnl`	Extreme Elevation on a 2-Manifold. Discret. Comput. Geom. Pankaj K. Agarwal, Herbert Edelsbrunner, John Harer, Yusu Wang
2006	J	`jnl`	Interface surfaces for protein-protein complexes. J. ACM Yih-En Andrew Ban, Herbert Edelsbrunner, Johannes Rudolph
2006	—	`conf`	Persistence-sensitive simplification functions on 2-manifolds. SCG Herbert Edelsbrunner, Dmitriy Morozov, Valerio Pascucci
2006	—	`conf`	Vines and vineyards by updating persistence in linear time. SCG David Cohen-Steiner, Herbert Edelsbrunner, Dmitriy Morozov
2005	Misc	`conf`	Coarse and Reliable Geometric Alignment for Protein Docking. Pacific Symposium on Biocomputing Yusu Wang, Pankaj K. Agarwal, P. Brown, Herbert Edelsbrunner, Johannes Rudolph
2005	B	`conf`	Extraction and Simplification of Iso-surfaces in Tandem. Symposium on Geometry Processing Dominique Attali, David Cohen-Steiner, Herbert Edelsbrunner
2005	—	`conf`	Inclusion-exclusion formulas from independent complexes. SCG Dominique Attali, Herbert Edelsbrunner
2005	—	`conf`	Inequalities for the curvature of curves and surfaces. SCG David Cohen-Steiner, Herbert Edelsbrunner
2005	Misc	`conf`	Session Introduction: Biogeometry: Applications of Computational Geometry to Molecular Structure. Pacific Symposium on Biocomputing Alexander Tropsha, Herbert Edelsbrunner
2005	—	`conf`	Stability of persistence diagrams. SCG David Cohen-Steiner, Herbert Edelsbrunner, John Harer
2005	B	`conf`	Surface Tiling with Differential Topology. Symposium on Geometry Processing Herbert Edelsbrunner
2004	J	`jnl`	A Topological Hierarchy for Functions on Triangulated Surfaces. IEEE Trans. Vis. Comput. Graph. Peer-Timo Bremer, Herbert Edelsbrunner, Bernd Hamann, Valerio Pascucci
2004	—	`ch.`	Biological applications of computational topology. Handbook of Discrete and Computational Geometry, 2nd Ed. Herbert Edelsbrunner
2004	J	`jnl`	Computing the Writhing Number of a Polygonal Knot. Discret. Comput. Geom. Pankaj K. Agarwal, Herbert Edelsbrunner, Yusu Wang
2004	—	`conf`	Extreme elevation on a 2-manifold. SCG Pankaj K. Agarwal, Herbert Edelsbrunner, John Harer, Yusu Wang
2004	B	`conf`	Interface surfaces for protein-protein complexes. RECOMB Yih-En Andrew Ban, Herbert Edelsbrunner, Johannes Rudolph
2004	C	`conf`	Local Search Heuristic for Rigid Protein Docking. WABI Vicky Choi, Pankaj K. Agarwal, Herbert Edelsbrunner, Johannes Rudolph
2004	A	`conf`	Local and Global Comparison of Continuous Functions. IEEE Visualization Herbert Edelsbrunner, John Harer, Vijay Natarajan, Valerio Pascucci
2004	J	`jnl`	Loops in Reeb Graphs of 2-Manifolds. Discret. Comput. Geom. Kree Cole-McLaughlin, Herbert Edelsbrunner, John Harer, Vijay Natarajan, Valerio Pascucci
2004	J	`jnl`	Simplification of Three-Dimensional Density Maps. IEEE Trans. Vis. Comput. Graph. Vijay Natarajan, Herbert Edelsbrunner
2004	J	`jnl`	The Area Derivative of a Space-Filling Diagram. Discret. Comput. Geom. Robert L. Bryant, Herbert Edelsbrunner, Patrice Koehl, Michael Levitt
2004	—	`conf`	Time-varying reeb graphs for continuous space-time data. SCG Herbert Edelsbrunner, John Harer, Ajith Mascarenhas, Valerio Pascucci
2003	A	`conf`	A Multi-Resolution Data Structure for 2-Dimensional Morse Functions. IEEE Visualization Peer-Timo Bremer, Herbert Edelsbrunner, Bernd Hamann, Valerio Pascucci
2003	—	`conf`	Area and Perimeter Derivatives of a Union of Disks. Computer Science in Perspective Ho-Lun Cheng, Herbert Edelsbrunner
2003	J	`jnl`	Area, perimeter and derivatives of a skin curve. Comput. Geom. Ho-Lun Cheng, Herbert Edelsbrunner
2003	J	`jnl`	Hierarchical Morse - Smale Complexes for Piecewise Linear 2-Manifolds. Discret. Comput. Geom. Herbert Edelsbrunner, John Harer, Afra Zomorodian
2003	—	`conf`	Loops in reeb graphs of 2-manifolds. SCG Kree Cole-McLaughlin, Herbert Edelsbrunner, John Harer, Vijay Natarajan, Valerio Pascucci
2003	—	`conf`	Morse-smale complexes for piecewise linear 3-manifolds. SCG Herbert Edelsbrunner, John Harer, Vijay Natarajan, Valerio Pascucci
2003	J	`jnl`	Relaxed Scheduling in Dynamic Skin Triangulation CoRR Herbert Edelsbrunner, Alper Üngör
2002	J	`jnl`	Algorithmic issues in modeling motion. ACM Comput. Surv. 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
2002	J	`jnl`	An Experimental Study of Sliver Exudation. Eng. Comput. Herbert Edelsbrunner, Damrong Guoy
2002	A*	`conf`	Computing the writhing number of a polygonal knot. SODA Pankaj K. Agarwal, Herbert Edelsbrunner, Yusu Wang
2002	—	`conf`	Element Quality and Tetrahedral Meshes (Invited Talk). IMR Herbert Edelsbrunner
2002	J	`jnl`	Fast Software for Box Intersections. Int. J. Comput. Geom. Appl. Afra Zomorodian, Herbert Edelsbrunner
2002	—	`conf`	Relaxed Scheduling in Dynamic Skin Triangulation. JCDCG Herbert Edelsbrunner, Alper Üngör
2002	J	`jnl`	Sink Insertion for Mesh Improvement. Int. J. Found. Comput. Sci. Herbert Edelsbrunner, Damrong Guoy
2002	J	`jnl`	Topological Persistence and Simplification. Discret. Comput. Geom. Herbert Edelsbrunner, David Letscher, Afra Zomorodian
2001	J	`jnl`	180 Wrapped Tubes. J. Univers. Comput. Sci. Herbert Edelsbrunner
2001	—	`conf`	An Experimental Study of Sliver Exudation. IMR Herbert Edelsbrunner, Damrong Guoy
2001	C	`conf`	Computing Linking Numbers of a Filtration. WABI Herbert Edelsbrunner, Afra Zomorodian
2001	J	`jnl`	Design and analysis of planar shape deformation. Comput. Geom. Siu-Wing Cheng, Herbert Edelsbrunner, Ping Fu, Ka-Po Lam
2001	J	`jnl`	Dynamic Skin Triangulation. Discret. Comput. Geom. Ho-Lun Cheng, Tamal K. Dey, Herbert Edelsbrunner, John Sullivan
2001	A*	`conf`	Dynamic skin triangulation. SODA Ho-Lun Cheng, Tamal K. Dey, Herbert Edelsbrunner, John Sullivan
2001	—	`book`	Geometry and Topology for Mesh Generation. Herbert Edelsbrunner
2001	—	`conf`	Hierarchical morse complexes for piecewise linear 2-manifolds. SCG Herbert Edelsbrunner, John Harer, Afra Zomorodian
2001	J	`jnl`	Shape space from deformation. Comput. Geom. Ho-Lun Cheng, Herbert Edelsbrunner, Ping Fu
2001	—	`conf`	Sink-insertion for mesh improvement. SCG Herbert Edelsbrunner, Damrong Guoy
2000	J	`jnl`	Adaptive Simplicial Grids from Cross-Sections of Monotone Complexes. Int. J. Comput. Geom. Appl. Herbert Edelsbrunner, Roman Waupotitsch
2000	J	`jnl`	Edgewise Subdivision of a Simplex. Discret. Comput. Geom. Herbert Edelsbrunner, Daniel R. Grayson
2000	—	`conf`	Fast software for box intersections. SCG Afra Zomorodian, Herbert Edelsbrunner
2000	J	`jnl`	Sliver exudation. J. ACM Siu-Wing Cheng, Tamal K. Dey, Herbert Edelsbrunner, Michael A. Facello, Shang-Hua Teng
2000	A*	`conf`	Smoothing and cleaning up slivers. STOC Herbert Edelsbrunner, Xiang-Yang Li, Gary L. Miller, Andreas Stathopoulos, Dafna Talmor, Shang-Hua Teng, Alper Üngör, Noel Walkington
2000	A*	`conf`	Topological Persistence and Simplification. FOCS Herbert Edelsbrunner, David Letscher, Afra Zomorodian
1999	J	`jnl`	Deformable Smooth Surface Design. Discret. Comput. Geom. Herbert Edelsbrunner
1999	—	`conf`	Edgewise Subdivision of a Simplex. SCG Herbert Edelsbrunner, Daniel R. Grayson
1999	J	`jnl`	Emerging Challenges in Computational Topology CoRR 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
1999	—	`conf`	Mesh Association: Formulation and Algorithms. IMR Xiangmin Jiao, Herbert Edelsbrunner, Michael T. Heath
1999	—	`conf`	Sliver Exudation. SCG Siu-Wing Cheng, Tamal K. Dey, Herbert Edelsbrunner, Michael A. Facello, Shang-Hua Teng
1998	—	`conf`	Design and Analysis of Planar Shape Deformation. SCG Siu-Wing Cheng, Herbert Edelsbrunner, Ping Fu, Ka-Po Lam
1998	J	`jnl`	On the Definition and the Construction of Pockets in Macromolecules. Discret. Appl. Math. Herbert Edelsbrunner, Michael A. Facello, Jie Liang
1998	B	`conf`	Shape Reconstruction with Delaunay Complex. LATIN Herbert Edelsbrunner
1998	Misc	`conf`	Shape Space from Deformation. PG Ho-Lun Cheng, Herbert Edelsbrunner, Ping Fu
1998	—	`conf`	Wrapping 3D Scanning Data. Three-Dimensional Image Capture and Applications Herbert Edelsbrunner, Michael A. Facello, Ping Fu, Jiang Qian, Dmitry V. Nekhayev
1997	J	`jnl`	A Combinatorial Approach to Cartograms. Comput. Geom. Herbert Edelsbrunner, Roman Waupotitsch
1997	—	`conf`	Auditory Morse Analysis of Triangulated Manifolds. VisMath Ulrike Axen, Herbert Edelsbrunner
1997	J	`jnl`	Cutting Dense Point Sets in Half. Discret. Comput. Geom. Herbert Edelsbrunner, Pavel Valtr, Emo Welzl
1997	J	`jnl`	Inclusion - Exclusion Complexes for Pseudodisk Collections. Discret. Comput. Geom. Herbert Edelsbrunner, Edgar A. Ramos
1997	J	`jnl`	Triangulating Topological Spaces. Int. J. Comput. Geom. Appl. Herbert Edelsbrunner, Nimish R. Shah
1996	B	`conf`	Geometric modeling in CAVE. VRST Herbert Edelsbrunner, Ping Fu, Jiang Qian
1996	J	`jnl`	Incremental Topological Flipping Works for Regular Triangulations. Algorithmica Herbert Edelsbrunner, Nimish R. Shah
1996	J	`jnl`	Lines in Space: Combinatorics and Algorithms. Algorithmica Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jorge Stolfi
1996	J	`jnl`	Triangulating the Surface of a Molecule. Discret. Appl. Math. Nataraj Akkiraju, Herbert Edelsbrunner
1996	J	`jnl`	Viewing geometric protein structures from inside a CAVE. IEEE Computer Graphics and Applications Nataraj Akkiraju, Herbert Edelsbrunner, Ping Fu, Jiang Qian
1995	—	`conf`	A Combinatorial Approach to Cartograms. SCG Herbert Edelsbrunner, Roman Waupotitsch
1995	A*	`conf`	Algebraic Decompositions of Non-Convex Polyhedra. FOCS Herbert Edelsbrunner
1995	J	`jnl`	An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere. Comput. Aided Geom. Des. Cecil Jose A. Delfinado, Herbert Edelsbrunner
1995	J	`jnl`	Improved Bounds on Weak epsilon-Nets for Convex Sets. Discret. Comput. Geom. Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, Micha Sharir, Emo Welzl
1995	—	`conf`	Measuring proteins and voids in proteins. HICSS (5) Herbert Edelsbrunner, Michael A. Facello, Ping Fu, Jie Liang
1995	—	`conf`	Smooth Surfaces for Multi-Scale Shape Representation. FSTTCS Herbert Edelsbrunner
1995	J	`jnl`	The Union of Balls and Its Dual Shape. Discret. Comput. Geom. Herbert Edelsbrunner
1994	J	`jnl`	Algorithms for Bichromatic Line-Segment Problems Polyhedral Terrains. Algorithmica Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
1994	J	`jnl`	Counting Triangle Crossing and Halving Planes. Discret. Comput. Geom. Tamal K. Dey, Herbert Edelsbrunner
1994	—	`conf`	Cutting Dense Point Sets in Half. SCG Herbert Edelsbrunner, Pavel Valtr, Emo Welzl
1994	—	`conf`	Modeling with Simplicial Complexes. CCCG Herbert Edelsbrunner
1994	J	`jnl`	Ray Shooting in Polygons Using Geodesic Triangulations. Algorithmica Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink
1994	J	`jnl`	Selecting Heavily Covered Points. SIAM J. Comput. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir
1994	J	`jnl`	Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. CoRR Herbert Edelsbrunner, Ernst P. Mücke
1994	J	`jnl`	Three-dimensional alpha shapes. CoRR Herbert Edelsbrunner, Ernst P. Mücke
1994	J	`jnl`	Three-dimensional alpha shapes. ACM Trans. Graph. Herbert Edelsbrunner, Ernst P. Mücke
1994	—	`conf`	Triangulating Topological Spaces. SCG Herbert Edelsbrunner, Nimish R. Shah
1993	J	`jnl`	A Quadratic Time Algorithm for the Minimax Length Triangulation. SIAM J. Comput. Herbert Edelsbrunner, Tiow Seng Tan
1993	—	`conf`	An Incremental Algorithm for Betti Numbers of Simplicial Complexes. SCG Cecil Jose A. Delfinado, Herbert Edelsbrunner
1993	J	`jnl`	An Upper Bound for Conforming Delaunary Triangulations. Discret. Comput. Geom. Herbert Edelsbrunner, Tiow Seng Tan
1993	—	`ch.`	Computational Geometry. Current Trends in Theoretical Computer Science Herbert Edelsbrunner
1993	—	`ch.`	Computational Geometry. Current Trends in Theoretical Computer Science Herbert Edelsbrunner
1993	J	`jnl`	Computing a Face in an Arrangement of Line Segments and Related Problems. SIAM J. Comput. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink
1993	—	`conf`	Counting Triangle Crossings and Halving Planes. SCG Tamal K. Dey, Herbert Edelsbrunner
1993	J	`jnl`	Diameter, Width, Closest Line Pair, and Parametric Searching. Discret. Comput. Geom. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
1993	J	`jnl`	Edge Insertion for Optimal Triangulations. Discret. Comput. Geom. Marshall W. Bern, Herbert Edelsbrunner, David Eppstein, Scott A. Mitchell, Tiow Seng Tan
1993	A*	`conf`	Improved bounds on weak epsilon-nets for convex sets. STOC Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, Micha Sharir, Emo Welzl
1993	J	`jnl`	On the Zone Theorem for Hyperplane Arrangements. SIAM J. Comput. Herbert Edelsbrunner, Raimund Seidel, Micha Sharir
1993	—	`conf`	The Union of Balls and Its Dual Shape. SCG Herbert Edelsbrunner
1992	J	`jnl`	An O(n SIAM J. Sci. Comput. Herbert Edelsbrunner, Tiow Seng Tan, Roman Waupotitsch
1992	J	`jnl`	An Optimal Algorithm for Intersecting Line Segments in the Plane. J. ACM Bernard Chazelle, Herbert Edelsbrunner
1992	—	`conf`	An Upper Bound for Conforming Delaunay Triangulations. SCG Herbert Edelsbrunner, Tiow Seng Tan
1992	J	`jnl`	Arrangements of Curves in the Plane - Topology, Combinatorics and Algorithms. Theor. Comput. Sci. Herbert Edelsbrunner, Leonidas J. Guibas, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir
1992	—	`conf`	Diameter, Width, Closest Line Pair, and Parametric Searching. SCG Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
1992	B	`conf`	Edge Insertion for Optional Triangulations. LATIN Marshall W. Bern, Herbert Edelsbrunner, David Eppstein, Scott A. Mitchell, Tiow Seng Tan
1992	—	`conf`	Incremental Topological Flipping Works for Regular Triangulations. SCG Herbert Edelsbrunner, Nimish R. Shah
1992	J	`jnl`	Optimal Time Bounds for Some Proximity Problems in the Plane. Inf. Process. Lett. Alok Aggarwal, Herbert Edelsbrunner, Prabhakar Raghavan, Prasoon Tiwari
1992	J	`jnl`	The number of edges of many faces in a line segment arrangement. Comb. Boris Aronov, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
1992	—	`conf`	Three-Dimensional Alpha Shapes. VVS Herbert Edelsbrunner, Ernst P. Mücke
1991	A*	`conf`	A Quadratic Time Algorithm for The MinMax Length Triangulation (Extended Abstract) FOCS Herbert Edelsbrunner, Tiow Seng Tan
1991	J	`jnl`	A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and its Applications. Theor. Comput. Sci. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
1991	J	`jnl`	A lower bound on the number of unit distances between the vertices of a convex polygon. J. Comb. Theory A Herbert Edelsbrunner, Péter Hajnal
1991	J	`jnl`	An O(n log² h) Time Algorithm for the Three-Dimensional Convex Hull Problem. SIAM J. Comput. Herbert Edelsbrunner, Weiping Shi
1991	A*	`conf`	Computing a Face in an Arrangement of Line Segments. SODA Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink
1991	J	`jnl`	Corrigendum: Topologically Sweeping an Arrangement. J. Comput. Syst. Sci. Herbert Edelsbrunner, Leonidas J. Guibas
1991	J	`jnl`	Counting and Cutting Cycles of Lines and Rods in Space. Comput. Geom. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink
1991	J	`jnl`	Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs. Discret. Comput. Geom. Pankaj K. Agarwal, Herbert Edelsbrunner, Otfried Schwarzkopf
1991	—	`conf`	On the Zone Theorem for Hyperplane Arrangements. New Results and New Trends in Computer Science Herbert Edelsbrunner, Raimund Seidel, Micha Sharir
1991	—	`conf`	Optimal Triangulations by Retriangulating. ISA Herbert Edelsbrunner
1991	J	`jnl`	Points and Triangles in the Plane and Halving Planes in Space. Discret. Comput. Geom. Boris Aronov, Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Rephael Wenger
1991	A*	`conf`	Ray Shooting in Polygons Using Geodesic Triangulations. ICALP Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink
1990	—	`conf`	A Hyperplane Incidence Problem with Applications to Counting Distances. Applied Geometry And Discrete Mathematics Herbert Edelsbrunner, Micha Sharir
1990	—	`conf`	A Hyperplane Incidence Problem with Applications to Counting Distances. SIGAL International Symposium on Algorithms Herbert Edelsbrunner, Micha Sharir
1990	—	`conf`	An O(n SCG Herbert Edelsbrunner, Tiow Seng Tan, Roman Waupotitsch
1990	J	`jnl`	An acyclicity theorem for cell complexes in d dimension. Comb. Herbert Edelsbrunner
1990	J	`jnl`	Combinatorial Complexity Bounds for Arrangement of Curves and Spheres. Discret. Comput. Geom. Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl
1990	A*	`conf`	Counting and Cutting Cycles of Lines and Rods in Space FOCS Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink
1990	J	`jnl`	Covering convex sets with non-overlapping polygons. Discret. Math. Herbert Edelsbrunner, Arch Douglas Robison, Xiaojun Shen
1990	—	`conf`	Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs. SCG Pankaj K. Agarwal, Herbert Edelsbrunner, Otfried Schwarzkopf, Emo Welzl
1990	—	`conf`	Lines in Space-A Collection of Results. Discrete and Computational Geometry Herbert Edelsbrunner
1990	—	`conf`	Points and Triangles in the Plane and Halving Planes in Space. SCG Boris Aronov, Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Rephael Wenger
1990	—	`ch.`	Probing Convex Polytopes. Autonomous Robot Vehicles David P. Dobkin, Herbert Edelsbrunner, Chee K. Yap
1990	J	`jnl`	Ranking intervals under visibility constraints. Int. J. Comput. Math. Herbert Edelsbrunner, Mark H. Overmars, Emo Welzl, Irith Ben-Arroyo Hartman, Jack A. Feldman
1990	J	`jnl`	Searching for Empty Convex Polygons. Algorithmica David P. Dobkin, Herbert Edelsbrunner, Mark H. Overmars
1990	J	`jnl`	Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. ACM Trans. Graph. Herbert Edelsbrunner, Ernst P. Mücke
1990	—	`conf`	Slimming Down by Adding: Selecting Heavily Covered Points. SCG Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir
1990	J	`jnl`	Tetrahedrizing Point Sets in Three Dimensions. J. Symb. Comput. Herbert Edelsbrunner, Franco P. Preparata, Douglas B. West
1990	J	`jnl`	The Complexity and Construction of Many Faces in Arrangement of Lines and of Segments. Discret. Comput. Geom. Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
1990	J	`jnl`	The Complexity of Many Cells in Arrangements of Planes and Related Problems. Discret. Comput. Geom. Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
1990	J	`jnl`	The Computational Geometry Column. Bull. EATCS Herbert Edelsbrunner
1990	J	`jnl`	The Maximum Number of Ways To Stab n Convex Nonintersecting Sets in the Plane Is 2n-2. Discret. Comput. Geom. Herbert Edelsbrunner, Micha Sharir
1989	A*	`conf`	A Singly-Expenential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications. ICALP Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
1989	—	`conf`	An Acyclicity Theorem for Cell Complexes in SCG Herbert Edelsbrunner
1989	B	`conf`	Combinatorial and Computational Results for Line Arrangements in Space. WADS Herbert Edelsbrunner
1989	J	`jnl`	Implicitly Representing Arrangements of Lines or Segments. Discret. Comput. Geom. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl
1989	A*	`conf`	Lines in Space-Combinatorics, Algorithms and Applications STOC Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
1989	J	`jnl`	On Arrangement of Jordan Arcs with Three Intersection per Pair. Discret. Comput. Geom. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink
1989	J	`jnl`	Partitioning Space for Range Queries. SIAM J. Comput. F. Frances Yao, David P. Dobkin, Herbert Edelsbrunner, Mike Paterson
1989	J	`jnl`	Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane. Theor. Comput. Sci. Herbert Edelsbrunner, Günter Rote, Emo Welzl
1989	J	`jnl`	The Complexity of Cutting Complexes. Discret. Comput. Geom. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas
1989	J	`jnl`	The Computation Geometry Column. Bull. EATCS Herbert Edelsbrunner
1989	J	`jnl`	The Computation Geometry Column. Bull. EATCS Herbert Edelsbrunner
1989	J	`jnl`	The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications. Discret. Comput. Geom. Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
1989	J	`jnl`	The Upper Envelope of Piecewise Linear Functions: Tight Bounds on the Number of Faces. Discret. Comput. Geom. Herbert Edelsbrunner
1989	J	`jnl`	Topologically Sweeping an Arrangement. J. Comput. Syst. Sci. Herbert Edelsbrunner, Leonidas J. Guibas
1988	A*	`conf`	An Optimal Algorithm for Intersecting Line Segments in the Plane FOCS Bernard Chazelle, Herbert Edelsbrunner
1988	A*	`conf`	Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms. ICALP Herbert Edelsbrunner, Leonidas J. Guibas, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir
1988	A*	`conf`	Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces FOCS Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl
1988	A*	`conf`	Geometric Structures in Computational Geometry. ICALP Herbert Edelsbrunner
1988	—	`conf`	Implicitly Representing Arrangements of Lines or Segments. SCG Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl
1988	J	`jnl`	Minimum Polygonal Separation Inf. Comput. Herbert Edelsbrunner, Franco P. Preparata
1988	—	`conf`	On Arrangements of Jordan Arcs with Three Intersections per Pair. SCG Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink
1988	J	`jnl`	Probing Convex Polygons with X-Rays. SIAM J. Comput. Herbert Edelsbrunner, Steven Skiena
1988	—	`ed.`	Proceedings of the Fourth Annual Symposium on Computational Geometry, Urbana-Champaign, IL, USA, June 6-8, 1988 SCG Herbert Edelsbrunner
1988	—	`conf`	Searching for Empty Convex Polygons. SCG David P. Dobkin, Herbert Edelsbrunner, Mark H. Overmars
1988	—	`conf`	Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms. SCG Herbert Edelsbrunner, Ernst P. Mücke
1988	B	`conf`	Tetrahedrizing Point Sets in Three Dimensions. ISSAC Herbert Edelsbrunner, Franco P. Preparata
1988	—	`conf`	The Complexity of Many Faces in Arrangements of Lines and of Segments. SCG Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
1988	J	`jnl`	The computational Geometry Column. Bull. EATCS Herbert Edelsbrunner
1988	J	`jnl`	The computational Geometry Column. Bull. EATCS Herbert Edelsbrunner
1987	J	`jnl`	A Tight Lower Bound on the Size of Visibility Graphs. Inf. Process. Lett. Xiaojun Shen, Herbert Edelsbrunner
1987	—	`book`	Algorithms in Combinatorial Geometry Herbert Edelsbrunner
1987	J	`jnl`	An Improved Algorithm for Constructing IEEE Trans. Computers Bernard Chazelle, Herbert Edelsbrunner
1987	J	`jnl`	Linear Space Data Structures for Two Types of Range Search. Discret. Comput. Geom. Bernard Chazelle, Herbert Edelsbrunner
1987	A*	`conf`	On the Lower Envelope of Bivariate Functions and its Applications FOCS Herbert Edelsbrunner, János Pach, Jacob T. Schwartz, Micha Sharir
1987	J	`jnl`	Space Searching for Intersecting Objects. J. Algorithms David P. Dobkin, Herbert Edelsbrunner
1987	A*	`conf`	Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane. ICALP Herbert Edelsbrunner, Günter Rote, Emo Welzl
1987	A*	`conf`	The Complexity of Cutting Convex Polytopes STOC Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas
1987	J	`jnl`	The Computational Geometry Column. Bull. EATCS Herbert Edelsbrunner
1987	J	`jnl`	Zooming by Repeated Range Detection. Inf. Process. Lett. Herbert Edelsbrunner, Mark H. Overmars
1986	J	`jnl`	Computing a Ham-Sandwich Cut in Two Dimensions. J. Symb. Comput. Herbert Edelsbrunner, Roman Waupotitsch
1986	J	`jnl`	Constructing Arrangements of Lines and Hyperplanes with Applications. SIAM J. Comput. Herbert Edelsbrunner, Joseph O'Rourke, Raimund Seidel
1986	J	`jnl`	Constructing Belts in Two-Dimensional Arrangements with Applications. SIAM J. Comput. Herbert Edelsbrunner, Emo Welzl
1986	J	`jnl`	Edge-Skeletons in Arrangements with Applications. Algorithmica Herbert Edelsbrunner
1986	J	`jnl`	Halfplanar Range Search in Linear Space and O(n^(0.695)) Query Time. Inf. Process. Lett. Herbert Edelsbrunner, Emo Welzl
1986	—	`conf`	Linear Data Structures for Two Types of Range Search. SCG Bernard Chazelle, Herbert Edelsbrunner
1986	J	`jnl`	On the maximal number of edges of many faces in an arrangement. J. Comb. Theory A Herbert Edelsbrunner, Emo Welzl
1986	J	`jnl`	Optimal Point Location in a Monotone Subdivision. SIAM J. Comput. Herbert Edelsbrunner, Leonidas J. Guibas, Jorge Stolfi
1986	A*	`conf`	Probing Convex Polytopes STOC David P. Dobkin, Herbert Edelsbrunner, Chee-Keng Yap
1986	J	`jnl`	Rectangular Point Location in d Dimensions with Applications. Comput. J. Herbert Edelsbrunner, G. Haring, D. Hilbert
1986	J	`jnl`	The complexity of cells in three-dimensional arrangements. Discret. Math. Herbert Edelsbrunner, David Haussler
1986	J	`jnl`	The number of extreme pairs of finite point-sets in Euclidean spaces. J. Comb. Theory A Herbert Edelsbrunner, Gerd Stöckl
1986	A*	`conf`	Topologically Sweeping an Arrangement STOC Herbert Edelsbrunner, Leonidas J. Guibas
1986	J	`jnl`	Voronoi Diagrams and Arrangements. Discret. Comput. Geom. Herbert Edelsbrunner, Raimund Seidel
1985	—	`conf`	An improved algorithm for constructing kth-order Voronoi diagrams. SCG Bernard Chazelle, Herbert Edelsbrunner
1985	J	`jnl`	Batched Dynamic Solutions to Decomposable Searching Problems. J. Algorithms Herbert Edelsbrunner, Mark H. Overmars
1985	J	`jnl`	Computing the Extreme Distances Between Two Convex Polygons. J. Algorithms Herbert Edelsbrunner
1985	J	`jnl`	Finding Extreme Points in Three Dimensions and Solving the Post-Office Problem in the Plane. Inf. Process. Lett. Herbert Edelsbrunner, Hermann A. Maurer
1985	J	`jnl`	Finding Transversals for Sets of Simple Geometric Figures. Theor. Comput. Sci. Herbert Edelsbrunner
1985	J	`jnl`	On the Number of Line Separations of a Finite Set in the Plane. J. Comb. Theory A Herbert Edelsbrunner, Emo Welzl
1985	A*	`conf`	Optimal Solutions for a Class of Point Retrieval Problems. ICALP Bernard Chazelle, Herbert Edelsbrunner
1985	J	`jnl`	Optimal Solutions for a Class of Point Retrieval Problems. J. Symb. Comput. Bernard Chazelle, Herbert Edelsbrunner
1985	—	`conf`	Voronoi diagrams and arrangements. SCG Herbert Edelsbrunner, Raimund Seidel
1984	J	`jnl`	An optimal algorithm for constructing the weighted voronoi diagram in the plane. Pattern Recognit. Franz Aurenhammer, Herbert Edelsbrunner
1984	J	`jnl`	Computing the Connected Components of Simple Rectilinear Geometrical Objects in D-Space. RAIRO Theor. Informatics Appl. Herbert Edelsbrunner, Jan van Leeuwen, Thomas Ottmann, Derick Wood
1984	A	`conf`	Key-Problems and Key-Methods in Computational Geormetry. STACS Herbert Edelsbrunner
1984	B	`conf`	Monotone Edge Sequences in Line Arrangements and Applications (Extended Abstract). MFCS Herbert Edelsbrunner, Emo Welzl
1984	J	`jnl`	Some methods of computational geometry applied to computer graphics. Comput. Vis. Graph. Image Process. Herbert Edelsbrunner, Mark H. Overmars, Raimund Seidel
1984	A*	`conf`	Space Searching for Intersecting Objects FOCS David P. Dobkin, Herbert Edelsbrunner
1983	A*	`conf`	Constructing Arrangements of Lines and Hyperplanes with Applications FOCS Herbert Edelsbrunner, Joseph O'Rourke, Raimund Seidel
1983	B	`conf`	Finding Extreme Distances between Convex Polygons. WG Herbert Edelsbrunner
1983	A*	`conf`	On the Number of Equal-Sized Semisapces of a Set of Points in the Plane (Extended Abstract). ICALP Herbert Edelsbrunner, Emo Welzl
1983	J	`jnl`	On the shape of a set of points in the plane. IEEE Trans. Inf. Theory Herbert Edelsbrunner, David G. Kirkpatrick, Raimund Seidel
1982	J	`jnl`	On the Equivalence of Some Rectangle Problems. Inf. Process. Lett. Herbert Edelsbrunner, Mark H. Overmars
1982	J	`jnl`	Polygonal Intersection Searching. Inf. Process. Lett. Herbert Edelsbrunner, Hermann A. Maurer, David G. Kirkpatrick
1982	J	`jnl`	Stabbing Line Segments. BIT Herbert Edelsbrunner, Hermann A. Maurer, Franco P. Preparata, Arnold L. Rosenberg, Emo Welzl, Derick Wood
1981	J	`jnl`	A Space-Optimal Solution of General Region Location. Theor. Comput. Sci. Herbert Edelsbrunner, Hermann A. Maurer
1981	J	`jnl`	On the Intersection of Orthogonal Objects. Inf. Process. Lett. Herbert Edelsbrunner, Hermann A. Maurer
1981	B	`conf`	The Shape of a Set of Points in the Plane. WG Herbert Edelsbrunner, David G. Kirkpatrick, Raimund Seidel