フォロー
Franz Aurenhammer
Franz Aurenhammer
Professor for Theoretical Computer Science, TU Graz, Austria
確認したメール アドレス: igi.tugraz.at
タイトル
引用先
引用先
Voronoi diagrams—a survey of a fundamental geometric data structure
F Aurenhammer
ACM Computing Surveys (CSUR) 23 (3), 345-405, 1991
61621991
Power diagrams: properties, algorithms and applications
F Aurenhammer
SIAM journal on computing 16 (1), 78-96, 1987
11381987
Voronoi Diagrams.
F Aurenhammer, R Klein
Handbook of computational geometry 5 (10), 201-290, 2000
11092000
Voronoi diagrams and Delaunay triangulations
F Aurenhammer, R Klein, DT Lee
World Scientific Publishing Company, 2013
5882013
A novel type of skeleton for polygons
O Aichholzer, F Aurenhammer, D Alberts, B Gärtner
J. UCS The Journal of Universal Computer Science: Annual Print and CD-ROM …, 1996
4791996
An optimal algorithm for constructing the weighted Voronoi diagram in the plane
F Aurenhammer, H Edelsbrunner
Pattern recognition 17 (2), 251-257, 1984
4051984
Minkowski-type theorems and least-squares clustering
F Aurenhammer, F Hoffmann, B Aronov
Algorithmica 20, 61-76, 1998
2791998
Straight skeletons for general polygonal figures in the plane
O Aichholzer, F Aurenhammer
Computing and Combinatorics: Second Annual International Conference, COCOON …, 1996
2681996
Enumerating order types for small sets with applications
O Aichholzer, F Aurenhammer, H Krasser
Proceedings of the seventeenth annual symposium on Computational geometry, 11-18, 2001
1852001
Handbook of computational geometry
F Aurenhammer, R Klein
Chapt 5, 201-290, 2000
1442000
Medial axis computation for planar free–form shapes
O Aichholzer, W Aigner, F Aurenhammer, T Hackl, B Jüttler, M Rabl
Computer-Aided Design 41 (5), 339-349, 2009
1242009
A criterion for the affine equivalence of cell complexes inRd and convex polyhedra inRd+1
F Aurenhammer
Discrete & Computational Geometry 2 (1), 49-64, 1987
1201987
A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams
F Aurenhammer, O Schwarzkopf
Proceedings of the seventh annual symposium on Computational geometry, 142-151, 1991
1081991
Quickest paths, straight skeletons, and the city Voronoi diagram
O Aichholzer, F Aurenhammer, B Palop
Proceedings of the eighteenth annual symposium on Computational geometry …, 2002
862002
Cartesian graph factorization at logarithmic cost per edge
F Aurenhammer, J Hagauer, W Imrich
Computational complexity 2, 331-349, 1992
851992
Improved algorithms for discs and balls using power diagrams
F Aurenhammer
Journal of Algorithms 9 (2), 151-161, 1988
791988
Triangulations intersect nicely
O Aichholzer, G Rote
Proceedings of the eleventh annual symposium on Computational geometry, 220-229, 1995
751995
Farthest line segment Voronoi diagrams
F Aurenhammer, RLS Drysdale, H Krasser
Information Processing Letters 100 (6), 220-225, 2006
652006
Pseudotriangulations from surfaces and a novel type of edge flip
O Aichholzer, F Aurenhammer, H Krasser, P Brass
SIAM Journal on Computing 32 (6), 1621-1653, 2003
602003
Recognising polytopical cell complexes and constructing projection polyhedra
F Aurenhammer
Journal of Symbolic Computation 3 (3), 249-255, 1987
591987
現在システムで処理を実行できません。しばらくしてからもう一度お試しください。
論文 1–20