No photo of Franz Aurenhammer

Franz Aurenhammer

Univ.-Prof. Dipl.-Ing. Dr.techn.

1983 …2020
If you made any changes in Pure these will be visible here soon.

Research Output 1983 2019

Filter
Article
2019

Partially walking a polygon

Aurenhammer, F., Steinkogler, M. & Klein, R., 1 Nov 2019, In : Computational geometry. 84, p. 3-11 9 p.

Research output: Contribution to journalArticleResearchpeer-review

Polygon
Walk
Vertex of a graph
2016

Straight skeletons and mitered offsets of nonconvex polytopes

Aurenhammer, F. & Walzl, G. C., 8 Aug 2016, In : Discrete & computational geometry. 56, 3, p. 743-801

Research output: Contribution to journalArticleResearchpeer-review

File
Polytopes
Skeleton
Straight
Decomposition
Polytope
2015

3-Colorability of Pseudo-Triangulations

Aichholzer, O., Aurenhammer, F., Hackl, T., Pilz, A., Vogtenhuber, B. & Huemer, C., 2015, In : International Journal of Computational Geometry and Applications. p. 283-298

Research output: Contribution to journalArticleResearchpeer-review

On Triangulation Axes of Polygons

Aigner, W., Aurenhammer, F. & Jüttler, B., 2015, In : Information Processing Letters. 115, p. 45-51

Research output: Contribution to journalArticleResearchpeer-review

Open Access

Triangulations with circular arcs

Aichholzer, O., Aurenhammer, F., Aigner, W., Jüttler, B., Dobiásová, K. & Rote, G., 2015, In : Journal of Graph Algorithms and Applications . p. 43-65

Research output: Contribution to journalArticleResearchpeer-review

2014

A note on visibility-constrained Voronoi diagrams

Aurenhammer, F., Su, B., Xu, Y. & Zhu, B., 2014, In : Discrete applied mathematics. 174, p. 52-56

Research output: Contribution to journalArticleResearchpeer-review

On k-Convex Point Sets

Aichholzer, O., Aurenhammer, F., Hackl, T., Hurtado, F., Pilz, A., Ramos, P., Urrutia, J., Valtr, P. & Vogtenhuber, B., 2014, In : Computational geometry. 47, 8, p. 809-832

Research output: Contribution to journalArticleResearchpeer-review

On shape Delaunay tessellations

Aurenhammer, F. & Paulini, G., 2014, In : Information Processing Letters. 114, 10, p. 535-541

Research output: Contribution to journalArticleResearchpeer-review

2012

Computing Convex Quadrangulations

Schiffer, T., Aurenhammer, F. & Demuth, M., 2012, In : Discrete applied mathematics. 160, p. 648-656

Research output: Contribution to journalArticleResearchpeer-review

On Computing the Convex Hull of (Piecewise) Curved Objects

Aurenhammer, F. & Jüttler, B., 2012, In : Mathematics in computer science. 6, 3, p. 261-266

Research output: Contribution to journalArticleResearchpeer-review

On k-convex polygons

Aichholzer, O., Aurenhammer, F., Demaine, E., Hurtado, F., Ramos, P. A. & Urrutia, J., 2012, In : Computational geometry. 45, 3, p. 73-87

Research output: Contribution to journalArticleResearchpeer-review

2011

Computational and structural advantages of circular boundary representation

Aichholzer, O., Aurenhammer, F., Hackl, T., Jüttler, B., Oberneder, M. & Sir, Z., 2011, In : International Journal of Computational Geometry and Applications. 21, 1, p. 47-69

Research output: Contribution to journalArticleResearchpeer-review

2010

Divide-and conquer for Voronoi diagrams revisited

Aichholzer, O., Aigner, W., Aurenhammer, F., Hackl, T., Jüttler B., N. V., Pilgerstorfer E., N. V. & Rabl M., N. V., 2010, In : Computational geometry. 43, 8, p. 688-699

Research output: Contribution to journalArticleResearchpeer-review

2009

Medial axis computation for planar free-form shapes

Aichholzer, O., Aigner, W., Aurenhammer, F., Hackl, T., Jüttler, B. & Rabl, M., 2009, In : Computer-aided design. 41, 5, p. 339-349

Research output: Contribution to journalArticleResearchpeer-review

On minimum weight pseudo-triangulations

Aichholzer, O., Aurenhammer, F., Hackl, T. & Speckmann, B., 2009, In : Computational geometry. 42, 6-7, p. 627-631

Research output: Contribution to journalArticleResearchpeer-review

Small weak epsilon nets

Aranaov, B., Aurenhammer, F., Hurtado, F., Langerman, S., Rappaport, D., Smorodinsky, S. & Seara, C., 2009, In : Computational geometry. 42, p. 455-462

Research output: Contribution to journalArticleResearchpeer-review

2008

Matching edges and faces in polygonal partitions

Aichholzer, O., Aurenhammer, F., Gonzalez-Nava, P., Hackl, T., Huemer, C., Hurtado, F., Krasser, H., Ray, S. & Vogtenhuber, B., 2008, In : Computational geometry. 39, 2, p. 134-141

Research output: Contribution to journalArticleResearchpeer-review

2007

Connecting colored point sets

Aichholzer, O., Aurenhammer, F., Hackl, T. & Huemer, C., 2007, In : Discrete applied mathematics. 155, 3, p. 271-278

Research output: Contribution to journalArticleResearchpeer-review

Gray Code Enumeration of Plane Straight Line Graphs

Aichholzer, O., Aurenhammer, F., Huemer, C. & Vogtenhuber, B., 2007, In : Graphs and combinatorics. 23, 5, p. 467-479

Research output: Contribution to journalArticleResearchpeer-review

Pre-triangulations and liftable complexes

Aichholzer, O., Aurenhammer, F. & Hackl, T., 2007, In : Discrete & computational geometry. 38, p. 701-725

Research output: Contribution to journalArticleResearchpeer-review

Weighted skeletons and fixed-share decomposition

Aurenhammer, F., 2007, In : Computational geometry. 40, p. 93-101

Research output: Contribution to journalArticleResearchpeer-review

2006

Farthest line segment Voronoi diagrams

Aurenhammer, F., Drysdale, R. L. S. & Krasser, H., 2006, In : Information Processing Letters. 100, p. 220-225

Research output: Contribution to journalArticleResearchpeer-review

On the crossing number of complete graphs

Aichholzer, O., Aurenhammer, F. & Krasser, H., 2006, In : Computing <Wien>. 76, p. 165-176

Research output: Contribution to journalArticleResearchpeer-review

Pseudo-simplicial complexes from maximal locally convex functions

Aurenhammer, F. & Krasser H, N. V., 2006, In : Discrete & computational geometry. 35, p. 201-221

Research output: Contribution to journalArticleResearchpeer-review

Transforming spanning trees and pseudo-triangulations

Aichholzer, O., Aurenhammer, F., Huemer, C. & Krasser, H., 2006, In : Information Processing Letters. 97, p. 19-22

Research output: Contribution to journalArticleResearchpeer-review

2004

Convexity minimizes pseudo-triangulations

Aichholzer, O., Aurenhammer, F., Krasser, H. & Speckmann, B., 2004, In : Computational geometry. 28, p. 3-10

Research output: Contribution to journalArticleResearchpeer-review

Quickest paths, straight skeletons, and the city Voronoi diagram

Aichholzer, O., Aurenhammer, F. & Palop, B., 2004, In : Discrete & computational geometry. 31, 1, p. 17-35

Research output: Contribution to journalArticleResearchpeer-review

2003

Pseudo-triangulations from surfaces and a novel type of edge flip

Aichholzer, O., Aurenhammer, F., Brass, P. & Krasser, H., 2003, In : SIAM journal on computing. 32, p. 1621-1653

Research output: Contribution to journalArticleResearchpeer-review

Towards compatible triangulations

Aichholzer, O., Aurenhammer, F., Hurtado, F. & Krasser, H., 2003, In : Theoretical computer science. 296, p. 3-13

Research output: Contribution to journalArticleResearchpeer-review

2002

Evolution strategy and hierarchical clustering

Aichholzer, O., Aurenhammer, F., Brandstätter, B., Ebner, T., Krasser, H., Magele, C. & Mühlmann, M., 2002, In : IEEE Transactions on Magnetics. 38, 2, p. 1041-1044

Research output: Contribution to journalArticleResearchpeer-review

Points and combinatorics

Aichholzer, O., Aurenhammer, F. & Krasser, H., 2002, In : Telematik. 8, 1, p. 12-17

Research output: Contribution to journalArticleResearch

Voronoi diagrams - computational geometry's favorite

Aichholzer, O. & Aurenhammer, F., 2002, In : Telematik. 8, 1, p. 7-11

Research output: Contribution to journalArticleResearch

2001

Generalized self-approaching curves

Aichholzer, O., Aurenhammer, F., Icking, C., Klein, R., Langetepe, E. & Rote, G., 2001, In : Discrete applied mathematics. 109, 1-2, p. 3-24

Research output: Contribution to journalArticleResearchpeer-review

1999

New results on MWT subgraphs

Aichholzer, O., Aurenhammer, F. & Hainz, R., 1999, In : Information Processing Letters. 69, p. 215-219

Research output: Contribution to journalArticleResearchpeer-review

Skew Voronoi diagrams

Aichholzer, O., Aurenhammer, F., Chen, D. Z., Lee, D. T. & Papadopoulou, E., 1999, In : International Journal of Computational Geometry and Applications. 9, 3, p. 235-247

Research output: Contribution to journalArticleResearchpeer-review

1998

Constant-level greedy triangulations approximate the MWT well

Aichholzer, O., Aurenhammer, F., Rote, G. & Xu, Y., 1998, In : Journal of combinatorial optimization. 2, p. 361-369

Research output: Contribution to journalArticleResearchpeer-review

1996

Triangulations intersect nicely

Aichholzer, O., Aurenhammer, F., Cheng, S-W., Katoh, N., Rote, G., Taschwer, M. & Xu, Y-F., 1996, In : Discrete & computational geometry. 16, 4, p. 339-359

Research output: Contribution to journalArticleResearchpeer-review

Triangulation
Intersect
Independence System
Network Flow
Point Sets
1995

A novel type of skeleton for polygons

Aichholzer, O., Alberts, D., Aurenhammer, F. & Gärtner, B., 1995, In : Journal of Universal Computer Science . 1, 12, p. 752-761

Research output: Contribution to journalArticleResearchpeer-review

1994

Faster isometric embedding in products of complete graphs

Aurenhammer, F., Forman M., N. V., Idury R., N. V., Schäffer A., N. V. & Wagner F., N. V., 1994, In : Discrete applied mathematics. 52, p. 17-28

Research output: Contribution to journalArticleResearchpeer-review

1993

Voronoi diagrams - a survey of a fundamental geometric data structure

Aurenhammer, F., 1993, In : ACM Computing Surveys. p. 131-185

Research output: Contribution to journalArticleResearchpeer-review

1992

A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams

Aurenhammer, F. & Schwarzkopf, O., 1992, In : International Journal of Computational Geometry and Applications. 2, 4, p. 363-381

Research output: Contribution to journalArticleResearchpeer-review

Cartesian graph factorization at logarithmic cost per edge

Aurenhammer, F., Hagauer, J. & Imrich, W., 1992, In : Computational complexity. 2, 4, p. 331-349

Research output: Contribution to journalArticleResearchpeer-review

Computing equivalence classes among the edges of a graph with applications

Aurenhammer, F. & Hagauer, J., 1992, In : Discrete Mathematics. 109, 1-3, p. 3-12

Research output: Contribution to journalArticleResearchpeer-review

Searching for segments with largest relative operlap

Aurenhammer, F. & Stöckl, G., 1992, In : Information Processing Letters. 41, 2, p. 103-108

Research output: Contribution to journalArticleResearchpeer-review

1991

On the peeper's Voronoi diagram

Aurenhammer, F. & Stöckl, G., 1991, In : SIGACT news. 22, 4, p. 50-59

Research output: Contribution to journalArticleResearch

Using Gale transforms in computational geometry

Aurenhammer, F., 1991, In : Mathematical programming. 52, p. 179-190

Research output: Contribution to journalArticleResearchpeer-review

Voronoi diagrams - a survey of a fundamental geometric data structure

Aurenhammer, F., 1991, In : ACM Computing Surveys. 23, 3, p. 345-405

Research output: Contribution to journalArticleResearchpeer-review

1990

A new duality result concerning Voronoi diagrams

Aurenhammer, F., 1990, In : Discrete & computational geometry. 5, 3, p. 243-254

Research output: Contribution to journalArticleResearchpeer-review

A relationship between Gale transforms and Voronoi diagrams

Aurenhammer, F., 1990, In : Discrete applied mathematics. 28, p. 83-91

Research output: Contribution to journalArticleResearchpeer-review

1988

Geometric relations among Voronoi diagrams

Aurenhammer, F. & Imai, H., 1988, In : Geometriae dedicata. 27, 1, p. 65-75

Research output: Contribution to journalArticleResearchpeer-review