Franz Aurenhammer
Graz University of Technology
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Franz Aurenhammer.
ACM Computing Surveys | 1991
Franz Aurenhammer
Computational geometry is concerned with the design and analysis of algorithms for geometrical problems. In addition, other more practically oriented, areas of computer science— such as computer graphics, computer-aided design, robotics, pattern recognition, and operations research—give rise to problems that inherently are geometrical. This is one reason computational geometry has attracted enormous research interest in the past decade and is a well-established area today. (For standard sources, we refer to the survey article by Lee and Preparata [19841 and to the textbooks by Preparata and Shames [1985] and Edelsbrunner [1987bl.) Readers familiar with the literature of computational geometry will have noticed, especially in the last few years, an increasing interest in a geometrical construct called the Voronoi diagram. This trend can also be observed in combinatorial geometry and in a considerable number of articles in natural science journals that address the Voronoi diagram under different names specific to the respective area. Given some number of points in the plane, their Voronoi diagram divides the plane according to the nearest-neighbor
SIAM Journal on Computing | 1987
Franz Aurenhammer
The power pow
Journal of Universal Computer Science | 1996
Oswin Aichholzer; Franz Aurenhammer; David Alberts; Bernd Gärtner
(x,s)
Pattern Recognition | 1984
Franz Aurenhammer; Herbert Edelsbrunner
of a point x with respect to a sphere s in Euclidean d-space
Handbook of Computational Geometry | 2000
Franz Aurenhammer
E^d
Algorithmica | 1998
Franz Aurenhammer; F. Hoffmann; Boris Aronov
is given by
Discrete and Computational Geometry | 1987
Franz Aurenhammer
d^2 (x,z) - r^2
Computer-aided Design | 2009
Oswin Aichholzer; Wolfgang Aigner; Franz Aurenhammer; Thomas Hackl; Bert Jüttler; Margot Rabl
, where d denotes the Euclidean distance function, and z and r are the center and the radius of s. The power diagram of a finite set S of spheres in
Discrete and Computational Geometry | 2004
Oswin Aichholzer; Franz Aurenhammer; Belén Palop
E^d
Journal of Algorithms | 1988
Franz Aurenhammer
is a cell complex that associates each