Background
Edelsbrunner, Herbert was born on March 14, 1958 in Graz, Styria, Austria. Son of Herbert and Berta Edelsbrunner.
http://www.amazon.com/Algorithms-Combinatorial-Geometry-Author-Edelsbrunner/dp/B010BCXG0M%3FSubscriptionId%3DAKIAJRRWTH346WSPOAFQ%26tag%3Dprabook-20%26linkCode%3Dsp1%26camp%3D2025%26creative%3D165953%26creativeASIN%3DB010BCXG0M
http://www.amazon.com/Combinatorial-Theoretical-COMBINATORIAL-THEORETICAL-Edelsbrunner/dp/B00AVH68TE%3FSubscriptionId%3DAKIAJRRWTH346WSPOAFQ%26tag%3Dprabook-20%26linkCode%3Dsp1%26camp%3D2025%26creative%3D165953%26creativeASIN%3DB00AVH68TE
(Computational geometry as an area of research in its own ...)
Computational geometry as an area of research in its own right emerged in the early seventies of this century. Right from the beginning, it was obvious that strong connections of various kinds exist to questions studied in the considerably older field of combinatorial geometry. For example, the combinatorial structure of a geometric problem usually decides which algorithmic method solves the problem most efficiently. Furthermore, the analysis of an algorithm often requires a great deal of combinatorial knowledge. As it turns out, however, the connection between the two research areas commonly referred to as computa tional geometry and combinatorial geometry is not as lop-sided as it appears. Indeed, the interest in computational issues in geometry gives a new and con structive direction to the combinatorial study of geometry. It is the intention of this book to demonstrate that computational and com binatorial investigations in geometry are doomed to profit from each other. To reach this goal, I designed this book to consist of three parts, acorn binatorial part, a computational part, and one that presents applications of the results of the first two parts. The choice of the topics covered in this book was guided by my attempt to describe the most fundamental algorithms in computational geometry that have an interesting combinatorial structure. In this early stage geometric transforms played an important role as they reveal connections between seemingly unrelated problems and thus help to structure the field.
http://www.amazon.com/Algorithms-Combinatorial-Geometry-Monographs-Theoretical/dp/3642648738%3FSubscriptionId%3DAKIAJRRWTH346WSPOAFQ%26tag%3Dprabook-20%26linkCode%3Dsp1%26camp%3D2025%26creative%3D165953%26creativeASIN%3D3642648738
http://www.amazon.com/Algorithms-Combinatorial-Geometry-Author-Edelsbrunner/dp/B010BCX9TA%3FSubscriptionId%3DAKIAJRRWTH346WSPOAFQ%26tag%3Dprabook-20%26linkCode%3Dsp1%26camp%3D2025%26creative%3D165953%26creativeASIN%3DB010BCX9TA
(Computational geometry as an area of research in its own ...)
Computational geometry as an area of research in its own right emerged in the early seventies of this century. Right from the beginning, it was obvious that strong connections of various kinds exist to questions studied in the considerably older field of combinatorial geometry. For example, the combinatorial structure of a geometric problem usually decides which algorithmic method solves the problem most efficiently. Furthermore, the analysis of an algorithm often requires a great deal of combinatorial knowledge. As it turns out, however, the connection between the two research areas commonly referred to as computa tional geometry and combinatorial geometry is not as lop-sided as it appears. Indeed, the interest in computational issues in geometry gives a new and con structive direction to the combinatorial study of geometry. It is the intention of this book to demonstrate that computational and com binatorial investigations in geometry are doomed to profit from each other. To reach this goal, I designed this book to consist of three parts, acorn binatorial part, a computational part, and one that presents applications of the results of the first two parts. The choice of the topics covered in this book was guided by my attempt to describe the most fundamental algorithms in computational geometry that have an interesting combinatorial structure. In this early stage geometric transforms played an important role as they reveal connections between seemingly unrelated problems and thus help to structure the field.
http://www.amazon.com/Algorithms-Combinatorial-Geometry-Monographs-Theoretical/dp/354013722X%3FSubscriptionId%3DAKIAJRRWTH346WSPOAFQ%26tag%3Dprabook-20%26linkCode%3Dsp1%26camp%3D2025%26creative%3D165953%26creativeASIN%3D354013722X
Edelsbrunner, Herbert was born on March 14, 1958 in Graz, Styria, Austria. Son of Herbert and Berta Edelsbrunner.
He received his Ph.D. in 1982 from Graz University of Technology, under the supervision of Hermann Maurer. His thesis was entitled “Intersection Problems in Computational Geometry.” After a brief assistant professorship at Graz, he joined the faculty of the University of Illinois at Urbana-Champaign in 1985, and moved to Duke University in 1999.
Since August 2009 he is Professor at the Institute of Science and Technology Austria (IST Austria) in Klosterneuburg. He was elected to the American Academy of Arts and Sciences in 2005, and received an honorary doctorate from Graz University of Technology in 2006. In 2008 he was elected to the German Academy of Sciences Leopoldina.
In 2014 he became one of ten inaugural fellows of the European Association for Theoretical Computer Science. Edelsbrunner's most heavily cited research contribution is his work with Ernst Mücke on alpha shapes, a technique for defining a sequence of multiscale approximations to the shape of a three-dimensional point cloud. In this technique, one varies a parameter alpha ranging from 0 to the diameter of the point cloud.
For each value of the parameter, the shape is approximated as the union of line segments, triangles, and tetrahedra defined by 2, 3, or 4 of the points respectively such that there exists a sphere of radius at most alpha containing only the defining points. Another heavily cited paper, also with Mücke, concerns “simulation of simplicity.” This is a technique for automatically converting algorithms that work only when their inputs are in general position (for instance, algorithms that may misbehave when some three input points are collinear) into algorithms that work robustly, correctly, and efficiently in the face of special-position inputs. Edelsbrunner has also made important contributions to algorithms for intersections of line segments, construction of K-sets, the ham sandwich theorem, Delaunay triangulation, point location, interval trees, fractional cascading, and protein docking.
(This book offers a modern approach to computational geome...)
(Computational geometry as an area of research in its own ...)
(Computational geometry as an area of research in its own ...)
[German Academy of Sciences Leopoldina. American Academy of Arts and Sciences]\r\nHe is also a member of the Academia Europaea.
Married Ping Fu, November 14, 1991. Children: Daniel, Xixi.