Edelsbrunner, Herbert.
Edelsbrunner, Herbert, 1958-....
Herbert Edelsbrunner American-Austrian computer scientist
VIAF ID: 85219456 ( Personal )
Permalink: http://viaf.org/viaf/85219456
Preferred Forms
- 200 _ | ‡a Edelsbrunner ‡b Herbert ‡f 1958-....
-
-
-
- 100 1 _ ‡a Edelsbrunner, Herbert
- 100 1 _ ‡a Edelsbrunner, Herbert
- 100 1 0 ‡a Edelsbrunner, Herbert
-
-
-
-
- 100 1 _ ‡a Edelsbrunner, Herbert ‡d 1958-
- 100 1 _ ‡a Edelsbrunner, Herbert ‡d 1958-...
-
- 100 1 _ ‡a Edelsbrunner, Herbert, ‡d 1958-....
-
- 100 0 _ ‡a Herbert Edelsbrunner ‡c American-Austrian computer scientist
4xx's: Alternate Name Forms (15)
5xx's: Related Names (6)
- 510 2 _ ‡a Institute of Science and Technology - Austria
- 510 2 _ ‡a Institute of Science and Technology - Austria ‡g Klosterneuburg ‡e Affiliation
- 510 2 _ ‡a Springer Science+Business Media
- 510 2 _ ‡a Springer-Verlag (Berlin)
- 510 2 _ ‡a Technische Universität Graz
- 510 2 _ ‡a University of Waterloo. Department of Computer Science
Works
Title | Sources |
---|---|
Algorithms in combinatorial geometry | |
The complexity of cutting complexes, 1987 | |
The complexity of many faces in arrangements of lines and segments | |
Computing the connected components of simple rectilinear geometrical objects in D-space | |
Cutting dense point sets in half | |
Geometric Algebra with Applications in Engineering | |
Graphics in Flatland : a case study | |
Kumiawase kikagaku no arugorizumu | |
Minimum polygonal separation | |
n86109710 | |
An optimal algorithm for intersecting line segments in the plane | |
Probing convex polygons with x-rays | |
Ranking intervals under visibility constraints | |
Searching for empty convex polygons | |
A Short Course in Computational Geometry and Topology | |
Testing the necklace condition for shortest tours and optimal factors in the plane | |
Tetrahedrizing point sets in three dimensions | |
Topologically sweeping an arrangement, 1986: | |
組合せ幾何学のアルゴリズム |