| * | 2009 |
|---|
| 72 | EE | Oswin Aichholzer,
Wolfgang Aigner,
Franz Aurenhammer,
Thomas Hackl,
Bert Jüttler,
Elisabeth Pilgerstorfer,
Margot Rabl:
Divide-and-conquer for Voronoi diagrams revisited.
Symposium on Computational Geometry 2009: 189-197 |
| 71 | EE | Franz Aurenhammer,
Yinfeng Xu:
Optimal Triangulations.
Encyclopedia of Optimization 2009: 2757-2764 |
| 70 | EE | Oswin Aichholzer,
Franz Aurenhammer,
B. Kornberger,
Simon Plantinga,
Günter Rote,
Astrid Sturm,
Gert Vegter:
Recovering Structure from r-Sampled Objects.
Comput. Graph. Forum 28(5): 1349-1360 (2009) |
| 2008 |
|---|
| 69 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Paola Gonzalez-Nava,
Thomas Hackl,
Clemens Huemer,
Ferran Hurtado,
Hannes Krasser,
Saurabh Ray,
Birgit Vogtenhuber:
Matching edges and faces in polygonal partitions.
Comput. Geom. 39(2): 134-141 (2008) |
| 68 | EE | Franz Aurenhammer:
Weighted skeletons and fixed-share decomposition.
Comput. Geom. 40(2): 93-101 (2008) |
| 2007 |
|---|
| 67 | | Oswin Aichholzer,
Franz Aurenhammer,
Thomas Hackl,
Bettina Speckmann:
On (Pointed) Minimum Weight Pseudo-Triangulations.
CCCG 2007: 209-212 |
| 66 | EE | Franz Aurenhammer,
Johannes Wallner,
Martin Peternell,
Helmut Pottmann:
Voronoi Diagrams for Oriented Spheres.
ISVD 2007: 33-37 |
| 65 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Thomas Hackl,
Bert Jüttler,
Margot Oberneder,
Zbynek Sír:
Computational and Structural Advantages of Circular Boundary Representation.
WADS 2007: 374-385 |
| 64 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Thomas Hackl:
Pre-Triangulations and Liftable Complexes.
Discrete & Computational Geometry 38(4): 701-725 (2007) |
| 63 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Thomas Hackl,
Clemens Huemer:
Connecting colored point sets.
Discrete Applied Mathematics 155(3): 271-278 (2007) |
| 2006 |
|---|
| 62 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Thomas Hackl:
Pre-triangulations and liftable complexes.
Symposium on Computational Geometry 2006: 282-291 |
| 61 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Hannes Krasser:
On the Crossing Number of Complete Graphs.
Computing 76(1-2): 165-176 (2006) |
| 60 | EE | Franz Aurenhammer,
Hannes Krasser:
Pseudo-Simplicial Complexes from Maximal Locally Convex Functions.
Discrete & Computational Geometry 35(2): 201-221 (2006) |
| 59 | EE | Franz Aurenhammer,
Robert L. Scot Drysdale,
Hannes Krasser:
Farthest line segment Voronoi diagrams.
Inf. Process. Lett. 100(6): 220-225 (2006) |
| 58 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Clemens Huemer,
Hannes Krasser:
Transforming spanning trees and pseudo-triangulations.
Inf. Process. Lett. 97(1): 19-22 (2006) |
| 2005 |
|---|
| 57 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Paola Gonzalez-Nava,
Thomas Hackl,
Clemens Huemer,
Ferran Hurtado,
Hannes Krasser,
Saurabh Ray,
Birgit Vogtenhuber:
Matching Edges and Faces in Polygonal Partitions.
CCCG 2005: 126-129 |
| 56 | EE | Boris Aronov,
Franz Aurenhammer,
Ferran Hurtado,
Stefan Langerman,
David Rappaport,
Shakhar Smorodinsky,
Carlos Seara:
Small weak epsilon nets.
CCCG 2005: 52-56 |
| 2004 |
|---|
| 55 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Hannes Krasser,
Bettina Speckmann:
Convexity minimizes pseudo-triangulations.
Comput. Geom. 28(1): 3-10 (2004) |
| 54 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Belén Palop:
Quickest Paths, Straight Skeletons, and the City Voronoi Diagram.
Discrete & Computational Geometry 31(1): 17-35 (2004) |
| 2003 |
|---|
| 53 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Peter Braay:
Spatial embedding of pseudo-triangulations.
Symposium on Computational Geometry 2003: 144-153 |
| 52 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Hannes Krasser:
Adapting (Pseudo)-Triangulations with a Near-Linear Number of Edge Flips.
WADS 2003: 12-24 |
| 51 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Hannes Krasser,
Peter Braß:
Pseudotriangulations from Surfaces and a Novel Type of Edge Flip.
SIAM J. Comput. 32(6): 1621-1653 (2003) |
| 50 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Ferran Hurtado,
Hannes Krasser:
Towards compatible triangulations.
Theor. Comput. Sci. 296(1): 3-13 (2003) |
| 2002 |
|---|
| 49 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Hannes Krasser,
Bettina Speckmann:
Convexity minimizes pseudo-triangulations.
CCCG 2002: 158-161 |
| 48 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Belén Palop:
Quickest paths, straight skeletons, and the city Voronoi diagram.
Symposium on Computational Geometry 2002: 151-159 |
| 47 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Hannes Krasser:
On the crossing number of complete graphs.
Symposium on Computational Geometry 2002: 19-24 |
| 46 | | Oswin Aichholzer,
Franz Aurenhammer,
Ferran Hurtado:
Sequences of spanning trees and a fixed tree theorem.
Comput. Geom. 21(1-2): 3-20 (2002) |
| 45 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Hannes Krasser:
Enumerating Order Types for Small Point Sets with Applications.
Order 19(3): 265-281 (2002) |
| 44 | | Franz Aurenhammer,
Naoki Katoh,
Hiromichi Kojima,
Makoto Ohsaki,
Yin-Feng Xu:
Approximating uniform triangular meshes in polygons.
Theor. Comput. Sci. 289(2): 879-895 (2002) |
| 2001 |
|---|
| 43 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Hannes Krasser,
Ferran Hurtado:
Towards Compatible Triangulations.
COCOON 2001: 101-110 |
| 42 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Hannes Krasser:
Enumerating order types for small sets with applications.
Symposium on Computational Geometry 2001: 11-18 |
| 41 | | Oswin Aichholzer,
Franz Aurenhammer,
Christian Icking,
Rolf Klein,
Elmar Langetepe,
Günter Rote:
Generalized self-approaching curves.
Discrete Applied Mathematics 109(1-2): 3-24 (2001) |
| 40 | EE | Franz Aurenhammer:
Computational Geometry - Some Easy Questions and their Recent Solutions.
J. UCS 7(5): 338-354 (2001) |
| 2000 |
|---|
| 39 | EE | Franz Aurenhammer,
Naoki Katoh,
Hiromichi Kojima,
Makoto Ohsaki,
Yinfeng Xu:
Approximating Uniform Triangular Meshes in Polygons.
COCOON 2000: 23-33 |
| 38 | | Oswin Aichholzer,
Franz Aurenhammer,
Ferran Hurtado:
Edge Operations on Non-Crossing Spanning Trees.
EWCG 2000: 121-125 |
| 1999 |
|---|
| 37 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Reinhard Hainz:
New Results on MWT Subgraphs.
Inf. Process. Lett. 69(5): 215-219 (1999) |
| 36 | | Oswin Aichholzer,
Franz Aurenhammer,
Danny Z. Chen,
D. T. Lee,
Evanthia Papadopoulou:
Skew Voronoi Diagrams.
Int. J. Comput. Geometry Appl. 9(3): 235- (1999) |
| 1998 |
|---|
| 35 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Christian Icking,
Rolf Klein,
Elmar Langetepe,
Günter Rote:
Generalized Self-Approaching Curves.
ISAAC 1998: 317-326 |
| 34 | | Franz Aurenhammer,
F. Hoffmann,
Boris Aronov:
Minkowski-Type Theorems and Least-Squares Clustering.
Algorithmica 20(1): 61-76 (1998) |
| 33 | | Oswin Aichholzer,
Franz Aurenhammer,
Günter Rote,
Yin-Feng Xu:
Constant-Level Greedy Triangulations Approximate the MWT Well.
J. Comb. Optim. 2(4): 361-369 (1998) |
| 1997 |
|---|
| 32 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Danny Z. Chen,
D. T. Lee,
Asish Mukhopadhyay,
Evanthia Papadopoulou:
Voronoi Diagrams for Direction-Sensitive Distances.
Symposium on Computational Geometry 1997: 418-420 |
| 1996 |
|---|
| 31 | | Oswin Aichholzer,
Franz Aurenhammer:
Straight Skeletons for General Polygonal Figures in the Plane.
COCOON 1996: 117-126 |
| 30 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Siu-Wing Cheng,
Naoki Katoh,
Günter Rote,
Michael Taschwer,
Yin-Feng Xu:
Triangulations Intersect Nicely.
Discrete & Computational Geometry 16(4): 339-359 (1996) |
| 29 | EE | Oswin Aichholzer,
Franz Aurenhammer:
Classifying Hyperplanes in Hypercubes.
SIAM J. Discrete Math. 9(2): 225-232 (1996) |
| 1995 |
|---|
| 28 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Michael Taschwer,
Günter Rote:
Triangulations Intersect Nicely.
Symposium on Computational Geometry 1995: 220-229 |
| 27 | EE | Oswin Aichholzer,
Franz Aurenhammer,
David Alberts,
Bernd Gärtner:
A Novel Type of Skeleton for Polygons.
J. UCS 1(12): 752-761 (1995) |
| 26 | | Franz Aurenhammer,
Johann Hagauer:
Recognizing Binary Hamming Graphs in O(n² log n) Time.
Mathematical Systems Theory 28(5): 387-395 (1995) |
| 1994 |
|---|
| 25 | EE | Franz Aurenhammer,
Michael Formann,
Ramana M. Idury,
Alejandro A. Schäffer,
Frank Wagner:
Faster Isometric Embedding in Products of Complete Graphs.
Discrete Applied Mathematics 52(1): 17-28 (1994) |
| 1992 |
|---|
| 24 | EE | Franz Aurenhammer,
Friedrich Hoffman,
Boris Aronov:
Minkowski-Type Theorems and Least-Squares Partitioning.
Symposium on Computational Geometry 1992: 350-357 |
| 23 | | Franz Aurenhammer,
Johann Hagauer,
Wilfried Imrich:
Cartesian Graph Factorization at Logarithmic Cost per Edge.
Computational Complexity 2: 331-349 (1992) |
| 22 | EE | Franz Aurenhammer,
Johann Hagauer:
Computing equivalence classes among the edges of a graph with applications.
Discrete Mathematics 109(1-3): 3-12 (1992) |
| 21 | | Franz Aurenhammer,
Gerd Stöckl:
Searching for Segments with Largest Relative Overlap.
Inf. Process. Lett. 41(2): 103-108 (1992) |
| 20 | | Franz Aurenhammer,
Otfried Schwarzkopf:
A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams.
Int. J. Comput. Geometry Appl. 2(4): 363-381 (1992) |
| 1991 |
|---|
| 19 | EE | Franz Aurenhammer,
Otfried Schwarzkopf:
A Simple On-Line Randomized Incremental Algorithm for Computing Higher Order Voronoi Diagrams.
Symposium on Computational Geometry 1991: 142-151 |
| 18 | | Franz Aurenhammer,
Gerd Stöckl,
Emo Welzl:
The Post Office Problem for Fuzzy Point Sets.
Workshop on Computational Geometry 1991: 1-11 |
| 17 | | Franz Aurenhammer:
Voronoi Diagrams - A Survey of a Fundamental Geometric Data Structure.
ACM Comput. Surv. 23(3): 345-405 (1991) |
| 16 | | Franz Aurenhammer:
Using Gale transforms in computational geometry.
Math. Program. 52: 179-190 (1991) |
| 1990 |
|---|
| 15 | | Franz Aurenhammer,
Johann Hagauer,
Wilfried Imrich:
Factoring Cartesian-Product Graphs at Logarithmic Cost per Edge.
IPCO 1990: 29-44 |
| 14 | EE | Franz Aurenhammer,
Johann Hagauer:
Recognizing Binary Hamming Graphs in O(n² log n) Time.
WG 1990: 90-98 |
| 13 | | Franz Aurenhammer:
A New Duality Result Concerning Voronoi Diagrams.
Discrete & Computational Geometry 5: 243-254 (1990) |
| 12 | EE | Franz Aurenhammer:
A relationship between Gale transforms and Voronoi diagrams.
Discrete Applied Mathematics 28(2): 83-91 (1990) |
| 1988 |
|---|
| 11 | | Franz Aurenhammer:
Using Gale Transforms in Computational Geometry.
Workshop on Computational Geometry 1988: 202-216 |
| 10 | | Franz Aurenhammer:
On-Line Sorting of Twisted Sequences in Linear Time.
BIT 28(2): 194-204 (1988) |
| 9 | | Franz Aurenhammer:
Improved Algorithms for Discs and Balls Using Power Diagrams.
J. Algorithms 9(2): 151-161 (1988) |
| 1987 |
|---|
| 8 | EE | Franz Aurenhammer,
Hiroshi Imai:
Geometric Relations Among Voronoi Diagrams.
STACS 1987: 53-65 |
| 7 | EE | Franz Aurenhammer:
Jordan Sorting Via Convex Hulls of Certain Non-Simple Polygons.
Symposium on Computational Geometry 1987: 21-29 |
| 6 | | Franz Aurenhammer:
A Criterion for the Affine Equivalence of Cell Complexes in Rd and Convex Polyhedra in Rd+1+.
Discrete & Computational Geometry 2: 49-64 (1987) |
| 5 | | Franz Aurenhammer:
Recognising Polytopical Cell Complexes and Constructing Projection Polyhedra.
J. Symb. Comput. 3(3): 249-255 (1987) |
| 4 | | Franz Aurenhammer:
Power Diagrams: Properties, Algorithms and Applications.
SIAM J. Comput. 16(1): 78-96 (1987) |
| 1986 |
|---|
| 3 | EE | Franz Aurenhammer:
A New Duality Result Concerning Voronoi Diagrams.
ICALP 1986: 21-30 |
| 2 | | Franz Aurenhammer:
The One-Dimensional Weighted Voronoi Diagram.
Inf. Process. Lett. 22(3): 119-123 (1986) |
| 1984 |
|---|
| 1 | EE | Franz Aurenhammer,
Herbert Edelsbrunner:
An optimal algorithm for constructing the weighted voronoi diagram in the plane.
Pattern Recognition 17(2): 251-257 (1984) |
