Franz Aurenhammer

108 papers A* 4A 2B 9C 3Misc 3Journal 65Unranked 19

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Arc-fibration kernels of arc-spline domains. Comput. Aided Geom. Des. Bastian Weiß, Bert Jüttler, Franz Aurenhammer
2022	J	`jnl`	Incremental Construction of Motorcycle Graphs. Algorithms Franz Aurenhammer, Christoph Ladurner, Michael Steinkogler
2021	B	`conf`	Piecewise-Linear Farthest-Site Voronoi Diagrams. ISAAC Franz Aurenhammer, Evanthia Papadopoulou, Martin Suderland
2020	J	`jnl`	Mitered Offsets and Skeletons for Circular Arc Polygons. Int. J. Comput. Geom. Appl. Bastian Weiß, Bert Jüttler, Franz Aurenhammer
2019	J	`jnl`	Partially walking a polygon. Comput. Geom. Franz Aurenhammer, Michael Steinkogler, Rolf Klein
2018	B	`conf`	Partially Walking a Polygon. ISAAC Franz Aurenhammer, Michael Steinkogler, Rolf Klein
2017	B	`conf`	Voronoi Diagrams for Parallel Halflines and Line Segments in Space. ISAAC Franz Aurenhammer, Bert Jüttler, Günter Paulini
2016	J	`jnl`	Straight Skeletons and Mitered Offsets of Nonconvex Polytopes. Discret. Comput. Geom. Franz Aurenhammer, Gernot Walzl
2015	J	`jnl`	3-Colorability of Pseudo-Triangulations. Int. J. Comput. Geom. Appl. Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Clemens Huemer, Alexander Pilz, Birgit Vogtenhuber
2015	J	`jnl`	On triangulation axes of polygons. Inf. Process. Lett. Wolfgang Aigner, Franz Aurenhammer, Bert Jüttler
2015	J	`jnl`	Triangulations with Circular Arcs. J. Graph Algorithms Appl. Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Katerina Cech Dobiásová, Bert Jüttler, Günter Rote
2014	J	`jnl`	A note on visibility-constrained Voronoi diagrams. Discret. Appl. Math. Franz Aurenhammer, Bing Su, Yin-Feng Xu, Binhai Zhu
2014	J	`jnl`	On k-convex point sets. Comput. Geom. Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Ferran Hurtado, Alexander Pilz, Pedro Ramos, Jorge Urrutia, Pavel Valtr, Birgit Vogtenhuber
2014	J	`jnl`	On shape Delaunay tessellations. Inf. Process. Lett. Franz Aurenhammer, Günter Paulini
2014	A*	`conf`	Polytope Offsets and Straight Skeletons in 3D. SoCG Franz Aurenhammer, Gernot Walzl
2013	B	`conf`	Structure and Computation of Straight Skeletons in 3-Space. ISAAC Franz Aurenhammer, Gernot Walzl
2013	—	`book`	Voronoi Diagrams and Delaunay Triangulations. Franz Aurenhammer, Rolf Klein, Der-Tsai Lee
2013	—	`conf`	Voronoi Diagrams from (Possibly Discontinuous) Embeddings. ISVD Mario Kapl, Franz Aurenhammer, Bert Jüttler
2012	J	`jnl`	Computing convex quadrangulations. Discret. Appl. Math. T. Schiffer, Franz Aurenhammer, M. Demuth
2012	J	`jnl`	On Computing the Convex Hull of (Piecewise) Curved Objects. Math. Comput. Sci. Franz Aurenhammer, Bert Jüttler
2012	J	`jnl`	On k-convex polygons. Comput. Geom. Oswin Aichholzer, Franz Aurenhammer, Erik D. Demaine, Ferran Hurtado, Pedro Ramos, Jorge Urrutia
2011	J	`jnl`	Computational and Structural Advantages of Circular Boundary Representation. Int. J. Comput. Geom. Appl. Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Margot Rabl, Zbynek Sír
2011	A	`conf`	Triangulations with Circular Arcs. GD Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Katerina Cech Dobiásová, Bert Jüttler, Günter Rote
2010	J	`jnl`	Divide-and-conquer for Voronoi diagrams revisited. Comput. Geom. Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Elisabeth Pilgerstorfer, Margot Rabl
2010	—	`conf`	Exact Medial Axis Computation for Triangulated Solids with Respect to Piecewise Linear Metrics. Curves and Surfaces Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Bert Jüttler
2010	J	`jnl`	On k-Convex Polygons CoRR Oswin Aichholzer, Franz Aurenhammer, Erik D. Demaine, Ferran Hurtado, Pedro Ramos, Jorge Urrutia
2010	—	`conf`	Straight skeletons for binary shapes. CVPR Workshops M. Demuth, Franz Aurenhammer, Axel Pinz
2009	—	`conf`	Divide-and-conquer for Voronoi diagrams revisited. SCG Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Elisabeth Pilgerstorfer, Margot Rabl
2009	J	`jnl`	Editorial. Comput. Geom. Oswin Aichholzer, Franz Aurenhammer
2009	J	`jnl`	Medial axis computation for planar free-form shapes. Comput. Aided Des. Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Margot Rabl
2009	J	`jnl`	On minimum weight pseudo-triangulations. Comput. Geom. Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bettina Speckmann
2009	—	`ch.`	Optimal Triangulations. Encyclopedia of Optimization Franz Aurenhammer, Yinfeng Xu
2009	J	`jnl`	Recovering Structure from Comput. Graph. Forum Oswin Aichholzer, Franz Aurenhammer, B. Kornberger, Simon Plantinga, Günter Rote, Astrid Sturm, Gert Vegter
2009	J	`jnl`	Small weak epsilon-nets. Comput. Geom. Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Carlos Seara, Shakhar Smorodinsky
2008	J	`jnl`	Matching edges and faces in polygonal partitions. Comput. Geom. Oswin Aichholzer, Franz Aurenhammer, Paola Gonzalez-Nava, Thomas Hackl, Clemens Huemer, Ferran Hurtado, Hannes Krasser, Saurabh Ray, Birgit Vogtenhuber
2008	J	`jnl`	Weighted skeletons and fixed-share decomposition. Comput. Geom. Franz Aurenhammer
2007	B	`conf`	Computational and Structural Advantages of Circular Boundary Representation. WADS Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Margot Oberneder, Zbynek Sír
2007	J	`jnl`	Connecting colored point sets. Discret. Appl. Math. Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Clemens Huemer
2007	J	`jnl`	Gray Code Enumeration of Plane Straight-Line Graphs. Graphs Comb. Oswin Aichholzer, Franz Aurenhammer, Clemens Huemer, Birgit Vogtenhuber
2007	—	`conf`	On (Pointed) Minimum Weight Pseudo-Triangulations. CCCG Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bettina Speckmann
2007	J	`jnl`	Pre-Triangulations and Liftable Complexes. Discret. Comput. Geom. Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl
2007	—	`conf`	Voronoi Diagrams for Oriented Spheres. ISVD Franz Aurenhammer, Johannes Wallner, Martin Peternell, Helmut Pottmann
2006	J	`jnl`	Farthest line segment Voronoi diagrams. Inf. Process. Lett. Franz Aurenhammer, Robert L. Scot Drysdale, Hannes Krasser
2006	J	`jnl`	On the Crossing Number of Complete Graphs. Computing Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser
2006	—	`conf`	Pre-triangulations and liftable complexes. SCG Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl
2006	J	`jnl`	Pseudo-Simplicial Complexes from Maximal Locally Convex Functions. Discret. Comput. Geom. Franz Aurenhammer, Hannes Krasser
2006	J	`jnl`	Transforming spanning trees and pseudo-triangulations. Inf. Process. Lett. Oswin Aichholzer, Franz Aurenhammer, Clemens Huemer, Hannes Krasser
2005	—	`conf`	Matching Edges and Faces in Polygonal Partitions. CCCG Oswin Aichholzer, Franz Aurenhammer, Paola Gonzalez-Nava, Thomas Hackl, Clemens Huemer, Ferran Hurtado, Hannes Krasser, Saurabh Ray, Birgit Vogtenhuber
2005	C	`conf`	Pseudo-tetrahedral complexes. EuroCG Franz Aurenhammer, Hannes Krasser
2005	—	`conf`	Small weak epsilon nets. CCCG Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Shakhar Smorodinsky, Carlos Seara
2005	C	`conf`	Transforming spanning trees and pseudo-triangulations. EuroCG Oswin Aichholzer, Franz Aurenhammer, Clemens Huemer, Hannes Krasser
2004	J	`jnl`	Convexity minimizes pseudo-triangulations. Comput. Geom. Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Bettina Speckmann
2004	J	`jnl`	Quickest Paths, Straight Skeletons, and the City Voronoi Diagram. Discret. Comput. Geom. Oswin Aichholzer, Franz Aurenhammer, Belén Palop
2003	B	`conf`	Adapting (Pseudo)-Triangulations with a Near-Linear Number of Edge Flips. WADS Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser
2003	J	`jnl`	Pseudotriangulations from Surfaces and a Novel Type of Edge Flip. SIAM J. Comput. Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Peter Braß
2003	—	`conf`	Spatial embedding of pseudo-triangulations. SCG Oswin Aichholzer, Franz Aurenhammer, Peter Braay
2003	J	`jnl`	Towards compatible triangulations. Theor. Comput. Sci. Oswin Aichholzer, Franz Aurenhammer, Ferran Hurtado, Hannes Krasser
2002	J	`jnl`	Approximating uniform triangular meshes in polygons. Theor. Comput. Sci. Franz Aurenhammer, Naoki Katoh, Hiromichi Kojima, Makoto Ohsaki, Yin-Feng Xu
2002	—	`conf`	Convexity minimizes pseudo-triangulations. CCCG Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Bettina Speckmann
2002	J	`jnl`	Enumerating Order Types for Small Point Sets with Applications. Order Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser
2002	—	`conf`	On the crossing number of complete graphs. SCG Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser
2002	—	`conf`	Quickest paths, straight skeletons, and the city Voronoi diagram. SCG Oswin Aichholzer, Franz Aurenhammer, Belén Palop
2002	J	`jnl`	Sequences of spanning trees and a fixed tree theorem. Comput. Geom. Oswin Aichholzer, Franz Aurenhammer, Ferran Hurtado
2001	J	`jnl`	Computational Geometry - Some Easy Questions and their Recent Solutions. J. Univers. Comput. Sci. Franz Aurenhammer
2001	—	`conf`	Enumerating order types for small sets with applications. SCG Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser
2001	J	`jnl`	Generalized self-approaching curves. Discret. Appl. Math. Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, Günter Rote
2001	Misc	`conf`	Towards Compatible Triangulations. COCOON Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Ferran Hurtado
2000	Misc	`conf`	Approximating Uniform Triangular Meshes in Polygons. COCOON Franz Aurenhammer, Naoki Katoh, Hiromichi Kojima, Makoto Ohsaki, Yinfeng Xu
2000	C	`conf`	Edge Operations on Non-Crossing Spanning Trees. EuroCG Oswin Aichholzer, Franz Aurenhammer, Ferran Hurtado
2000	—	`ch.`	Voronoi Diagrams. Handbook of Computational Geometry Franz Aurenhammer, Rolf Klein
1999	J	`jnl`	New Results on MWT Subgraphs. Inf. Process. Lett. Oswin Aichholzer, Franz Aurenhammer, Reinhard Hainz
1999	J	`jnl`	Skew Voronoi Diagrams. Int. J. Comput. Geom. Appl. Oswin Aichholzer, Franz Aurenhammer, Danny Z. Chen, D. T. Lee, Evanthia Papadopoulou
1998	J	`jnl`	Constant-Level Greedy Triangulations Approximate the MWT Well. J. Comb. Optim. Oswin Aichholzer, Franz Aurenhammer, Günter Rote, Yin-Feng Xu
1998	B	`conf`	Generalized Self-Approaching Curves. ISAAC Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, Günter Rote
1998	J	`jnl`	Minkowski-Type Theorems and Least-Squares Clustering. Algorithmica Franz Aurenhammer, F. Hoffmann, Boris Aronov
1997	—	`conf`	Voronoi Diagrams for Direction-Sensitive Distances. SCG Oswin Aichholzer, Franz Aurenhammer, Danny Z. Chen, D. T. Lee, Asish Mukhopadhyay, Evanthia Papadopoulou
1996	J	`jnl`	Classifying Hyperplanes in Hypercubes. SIAM J. Discret. Math. Oswin Aichholzer, Franz Aurenhammer
1996	Misc	`conf`	Straight Skeletons for General Polygonal Figures in the Plane. COCOON Oswin Aichholzer, Franz Aurenhammer
1996	J	`jnl`	Triangulations Intersect Nicely. Discret. Comput. Geom. Oswin Aichholzer, Franz Aurenhammer, Siu-Wing Cheng, Naoki Katoh, Günter Rote, Michael Taschwer, Yin-Feng Xu
1995	J	`jnl`	A Novel Type of Skeleton for Polygons. J. Univers. Comput. Sci. Oswin Aichholzer, Franz Aurenhammer, David Alberts, Bernd Gärtner
1995	J	`jnl`	Recognizing Binary Hamming Graphs in O(n² log n) Time. Math. Syst. Theory Franz Aurenhammer, Johann Hagauer
1995	—	`conf`	Triangulations Intersect Nicely. SCG Oswin Aichholzer, Franz Aurenhammer, Michael Taschwer, Günter Rote
1994	J	`jnl`	Faster Isometric Embedding in Products of Complete Graphs. Discret. Appl. Math. Franz Aurenhammer, Michael Formann, Ramana M. Idury, Alejandro A. Schäffer, Frank Wagner
1992	J	`jnl`	A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams. Int. J. Comput. Geom. Appl. Franz Aurenhammer, Otfried Schwarzkopf
1992	J	`jnl`	Cartesian Graph Factorization at Logarithmic Cost per Edge. Comput. Complex. Franz Aurenhammer, Johann Hagauer, Wilfried Imrich
1992	J	`jnl`	Computing equivalence classes among the edges of a graph with applications. Discret. Math. Franz Aurenhammer, Johann Hagauer
1992	—	`conf`	Minkowski-Type Theorems and Least-Squares Partitioning. SCG Franz Aurenhammer, Friedrich Hoffmann, Boris Aronov
1992	J	`jnl`	Searching for Segments with Largest Relative Overlap. Inf. Process. Lett. Franz Aurenhammer, Gerd Stöckl
1991	—	`conf`	A Simple On-Line Randomized Incremental Algorithm for Computing Higher Order Voronoi Diagrams. SCG Franz Aurenhammer, Otfried Schwarzkopf
1991	J	`jnl`	On the Peeper's Voronoi diagram. SIGACT News Franz Aurenhammer, Gerd Stöckl
1991	A*	`conf`	The Post Office Problem for Fuzzy Point Sets. Workshop on Computational Geometry Franz Aurenhammer, Gerd Stöckl, Emo Welzl
1991	J	`jnl`	Using Gale transforms in computational geometry. Math. Program. Franz Aurenhammer
1991	J	`jnl`	Voronoi Diagrams - A Survey of a Fundamental Geometric Data Structure. ACM Comput. Surv. Franz Aurenhammer
1990	J	`jnl`	A New Duality Result Concerning Voronoi Diagrams. Discret. Comput. Geom. Franz Aurenhammer
1990	J	`jnl`	A relationship between Gale transforms and Voronoi diagrams. Discret. Appl. Math. Franz Aurenhammer
1990	B	`conf`	Factoring Cartesian-Product Graphs at Logarithmic Cost per Edge. IPCO Franz Aurenhammer, Johann Hagauer, Wilfried Imrich
1990	B	`conf`	Recognizing Binary Hamming Graphs in O(n² log n) Time. WG Franz Aurenhammer, Johann Hagauer
1988	J	`jnl`	Improved Algorithms for Discs and Balls Using Power Diagrams. J. Algorithms Franz Aurenhammer
1988	J	`jnl`	On-Line Sorting of Twisted Sequences in Linear Time. BIT Franz Aurenhammer
1988	A*	`conf`	Using Gale Transforms in Computational Geometry. Workshop on Computational Geometry Franz Aurenhammer
1987	J	`jnl`	A Criterion for the Affine Equivalence of Cell Complexes in R Discret. Comput. Geom. Franz Aurenhammer
1987	A	`conf`	Geometric Relations Among Voronoi Diagrams. STACS Franz Aurenhammer, Hiroshi Imai
1987	—	`conf`	Jordan Sorting Via Convex Hulls of Certain Non-Simple Polygons. SCG Franz Aurenhammer
1987	J	`jnl`	Power Diagrams: Properties, Algorithms and Applications. SIAM J. Comput. Franz Aurenhammer
1987	J	`jnl`	Recognising Polytopical Cell Complexes and Constructing Projection Polyhedra. J. Symb. Comput. Franz Aurenhammer
1986	A*	`conf`	A New Duality Result Concerning Voronoi Diagrams. ICALP Franz Aurenhammer
1986	J	`jnl`	The One-Dimensional Weighted Voronoi Diagram. Inf. Process. Lett. Franz Aurenhammer
1984	J	`jnl`	An optimal algorithm for constructing the weighted voronoi diagram in the plane. Pattern Recognit. Franz Aurenhammer, Herbert Edelsbrunner