default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFranz Aurenhammer
Person information
- affiliation: Graz University of Technology, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j63]Franz Aurenhammer, Christoph Ladurner
, Michael Steinkogler:
Incremental Construction of Motorcycle Graphs. Algorithms 15(7): 225 (2022)- 2021
- [c37]Franz Aurenhammer, Evanthia Papadopoulou, Martin Suderland:
Piecewise-Linear Farthest-Site Voronoi Diagrams. ISAAC 2021: 30:1-30:11 - 2020
- [j62]Bastian Weiß, Bert Jüttler, Franz Aurenhammer:
Mitered Offsets and Skeletons for Circular Arc Polygons. Int. J. Comput. Geom. Appl. 30(3&4): 235-256 (2020)
2010 – 2019
- 2019
- [j61]Franz Aurenhammer, Michael Steinkogler, Rolf Klein:
Partially walking a polygon. Comput. Geom. 84: 3-11 (2019) - 2018
- [c36]Franz Aurenhammer, Michael Steinkogler, Rolf Klein:
Partially Walking a Polygon. ISAAC 2018: 60:1-60:9 - 2017
- [c35]Franz Aurenhammer, Bert Jüttler, Günter Paulini:
Voronoi Diagrams for Parallel Halflines and Line Segments in Space. ISAAC 2017: 7:1-7:10 - 2016
- [j60]Franz Aurenhammer, Gernot Walzl:
Straight Skeletons and Mitered Offsets of Nonconvex Polytopes. Discret. Comput. Geom. 56(3): 743-801 (2016) - 2015
- [j59]Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Clemens Huemer, Alexander Pilz, Birgit Vogtenhuber:
3-Colorability of Pseudo-Triangulations. Int. J. Comput. Geom. Appl. 25(4): 283-298 (2015) - [j58]Wolfgang Aigner, Franz Aurenhammer, Bert Jüttler:
On triangulation axes of polygons. Inf. Process. Lett. 115(1): 45-51 (2015) - [j57]Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Katerina Cech Dobiásová, Bert Jüttler, Günter Rote:
Triangulations with Circular Arcs. J. Graph Algorithms Appl. 19(1): 43-65 (2015) - 2014
- [j56]Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Ferran Hurtado, Alexander Pilz, Pedro Ramos, Jorge Urrutia, Pavel Valtr, Birgit Vogtenhuber:
On k-convex point sets. Comput. Geom. 47(8): 809-832 (2014) - [j55]Franz Aurenhammer, Bing Su, Yin-Feng Xu, Binhai Zhu:
A note on visibility-constrained Voronoi diagrams. Discret. Appl. Math. 174: 52-56 (2014) - [j54]Franz Aurenhammer, Günter Paulini:
On shape Delaunay tessellations. Inf. Process. Lett. 114(10): 535-541 (2014) - [c34]Franz Aurenhammer, Gernot Walzl:
Polytope Offsets and Straight Skeletons in 3D. SoCG 2014: 98 - 2013
- [b1]Franz Aurenhammer, Rolf Klein, Der-Tsai Lee:
Voronoi Diagrams and Delaunay Triangulations. World Scientific 2013, ISBN 978-981-4447-63-8, pp. I-VIII, 1-337 - [c33]Franz Aurenhammer, Gernot Walzl:
Structure and Computation of Straight Skeletons in 3-Space. ISAAC 2013: 44-54 - [c32]Mario Kapl, Franz Aurenhammer, Bert Jüttler:
Voronoi Diagrams from (Possibly Discontinuous) Embeddings. ISVD 2013: 47-50 - 2012
- [j53]Oswin Aichholzer, Franz Aurenhammer, Erik D. Demaine, Ferran Hurtado, Pedro Ramos, Jorge Urrutia:
On k-convex polygons. Comput. Geom. 45(3): 73-87 (2012) - [j52]T. Schiffer, Franz Aurenhammer, M. Demuth:
Computing convex quadrangulations. Discret. Appl. Math. 160(4-5): 648-656 (2012) - [j51]Franz Aurenhammer, Bert Jüttler:
On Computing the Convex Hull of (Piecewise) Curved Objects. Math. Comput. Sci. 6(3): 261-266 (2012) - 2011
- [j50]Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Margot Rabl, Zbynek Sír:
Computational and Structural Advantages of Circular Boundary Representation. Int. J. Comput. Geom. Appl. 21(1): 47-69 (2011) - [c31]Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Katerina Cech Dobiásová, Bert Jüttler, Günter Rote:
Triangulations with Circular Arcs. GD 2011: 296-307 - 2010
- [j49]Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Elisabeth Pilgerstorfer, Margot Rabl:
Divide-and-conquer for Voronoi diagrams revisited. Comput. Geom. 43(8): 688-699 (2010) - [c30]Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Bert Jüttler:
Exact Medial Axis Computation for Triangulated Solids with Respect to Piecewise Linear Metrics. Curves and Surfaces 2010: 1-27 - [c29]M. Demuth, Franz Aurenhammer, Axel Pinz:
Straight skeletons for binary shapes. CVPR Workshops 2010: 9-16 - [i4]Oswin Aichholzer, Franz Aurenhammer, Erik D. Demaine, Ferran Hurtado, Pedro Ramos, Jorge Urrutia:
On k-Convex Polygons. CoRR abs/1007.3607 (2010)
2000 – 2009
- 2009
- [j48]Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Margot Rabl:
Medial axis computation for planar free-form shapes. Comput. Aided Des. 41(5): 339-349 (2009) - [j47]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) - [j46]Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Carlos Seara, Shakhar Smorodinsky:
Small weak epsilon-nets. Comput. Geom. 42(5): 455-462 (2009) - [j45]Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bettina Speckmann:
On minimum weight pseudo-triangulations. Comput. Geom. 42(6-7): 627-631 (2009) - [j44]Oswin Aichholzer, Franz Aurenhammer:
Editorial. Comput. Geom. 42(8): 723 (2009) - [c28]Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Elisabeth Pilgerstorfer, Margot Rabl:
Divide-and-conquer for Voronoi diagrams revisited. SCG 2009: 189-197 - [r1]Franz Aurenhammer, Yinfeng Xu:
Optimal Triangulations. Encyclopedia of Optimization 2009: 2757-2764 - 2008
- [j43]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) - [j42]Franz Aurenhammer:
Weighted skeletons and fixed-share decomposition. Comput. Geom. 40(2): 93-101 (2008) - 2007
- [j41]Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Clemens Huemer:
Connecting colored point sets. Discret. Appl. Math. 155(3): 271-278 (2007) - [j40]Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl:
Pre-Triangulations and Liftable Complexes. Discret. Comput. Geom. 38(4): 701-725 (2007) - [j39]Oswin Aichholzer, Franz Aurenhammer, Clemens Huemer, Birgit Vogtenhuber:
Gray Code Enumeration of Plane Straight-Line Graphs. Graphs Comb. 23(5): 467-479 (2007) - [c27]Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bettina Speckmann:
On (Pointed) Minimum Weight Pseudo-Triangulations. CCCG 2007: 209-212 - [c26]Franz Aurenhammer, Johannes Wallner, Martin Peternell, Helmut Pottmann:
Voronoi Diagrams for Oriented Spheres. ISVD 2007: 33-37 - [c25]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 - 2006
- [j38]Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser:
On the Crossing Number of Complete Graphs. Computing 76(1-2): 165-176 (2006) - [j37]Franz Aurenhammer, Hannes Krasser:
Pseudo-Simplicial Complexes from Maximal Locally Convex Functions. Discret. Comput. Geom. 35(2): 201-221 (2006) - [j36]Oswin Aichholzer, Franz Aurenhammer, Clemens Huemer, Hannes Krasser:
Transforming spanning trees and pseudo-triangulations. Inf. Process. Lett. 97(1): 19-22 (2006) - [j35]Franz Aurenhammer, Robert L. Scot Drysdale, Hannes Krasser:
Farthest line segment Voronoi diagrams. Inf. Process. Lett. 100(6): 220-225 (2006) - [c24]Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl:
Pre-triangulations and liftable complexes. SCG 2006: 282-291 - 2005
- [c23]Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Shakhar Smorodinsky, Carlos Seara:
Small weak epsilon nets. CCCG 2005: 52-56 - [c22]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 - [i3]Oswin Aichholzer, Franz Aurenhammer, Clemens Huemer, Hannes Krasser:
Transforming spanning trees and pseudo-triangulations. EuroCG 2005: 81-84 - [i2]Franz Aurenhammer, Hannes Krasser:
Pseudo-tetrahedral complexes. EuroCG 2005: 85-88 - 2004
- [j34]Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Bettina Speckmann:
Convexity minimizes pseudo-triangulations. Comput. Geom. 28(1): 3-10 (2004) - [j33]Oswin Aichholzer, Franz Aurenhammer, Belén Palop:
Quickest Paths, Straight Skeletons, and the City Voronoi Diagram. Discret. Comput. Geom. 31(1): 17-35 (2004) - 2003
- [j32]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) - [j31]Oswin Aichholzer, Franz Aurenhammer, Ferran Hurtado, Hannes Krasser:
Towards compatible triangulations. Theor. Comput. Sci. 296(1): 3-13 (2003) - [c21]Oswin Aichholzer, Franz Aurenhammer, Peter Braay:
Spatial embedding of pseudo-triangulations. SCG 2003: 144-153 - [c20]Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser:
Adapting (Pseudo)-Triangulations with a Near-Linear Number of Edge Flips. WADS 2003: 12-24 - 2002
- [j30]Oswin Aichholzer, Franz Aurenhammer, Ferran Hurtado:
Sequences of spanning trees and a fixed tree theorem. Comput. Geom. 21(1-2): 3-20 (2002) - [j29]Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser:
Enumerating Order Types for Small Point Sets with Applications. Order 19(3): 265-281 (2002) - [j28]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) - [c19]Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Bettina Speckmann:
Convexity minimizes pseudo-triangulations. CCCG 2002: 158-161 - [c18]Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser:
On the crossing number of complete graphs. SCG 2002: 19-24 - [c17]Oswin Aichholzer, Franz Aurenhammer, Belén Palop:
Quickest paths, straight skeletons, and the city Voronoi diagram. SCG 2002: 151-159 - 2001
- [j27]Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, Günter Rote:
Generalized self-approaching curves. Discret. Appl. Math. 109(1-2): 3-24 (2001) - [j26]Franz Aurenhammer:
Computational Geometry - Some Easy Questions and their Recent Solutions. J. Univers. Comput. Sci. 7(5): 338-354 (2001) - [c16]Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Ferran Hurtado:
Towards Compatible Triangulations. COCOON 2001: 101-110 - [c15]Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser:
Enumerating order types for small sets with applications. SCG 2001: 11-18 - 2000
- [c14]Franz Aurenhammer, Naoki Katoh, Hiromichi Kojima, Makoto Ohsaki, Yinfeng Xu:
Approximating Uniform Triangular Meshes in Polygons. COCOON 2000: 23-33 - [p1]Franz Aurenhammer, Rolf Klein:
Voronoi Diagrams. Handbook of Computational Geometry 2000: 201-290 - [i1]Oswin Aichholzer, Franz Aurenhammer, Ferran Hurtado:
Edge Operations on Non-Crossing Spanning Trees. EuroCG 2000: 121-125
1990 – 1999
- 1999
- [j25]Oswin Aichholzer, Franz Aurenhammer, Danny Z. Chen, D. T. Lee, Evanthia Papadopoulou:
Skew Voronoi Diagrams. Int. J. Comput. Geom. Appl. 9(3): 235-248 (1999) - [j24]Oswin Aichholzer, Franz Aurenhammer, Reinhard Hainz:
New Results on MWT Subgraphs. Inf. Process. Lett. 69(5): 215-219 (1999) - 1998
- [j23]Franz Aurenhammer, F. Hoffmann, Boris Aronov:
Minkowski-Type Theorems and Least-Squares Clustering. Algorithmica 20(1): 61-76 (1998) - [j22]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) - [c13]Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, Günter Rote:
Generalized Self-Approaching Curves. ISAAC 1998: 317-326 - 1997
- [c12]Oswin Aichholzer, Franz Aurenhammer, Danny Z. Chen, D. T. Lee, Asish Mukhopadhyay, Evanthia Papadopoulou:
Voronoi Diagrams for Direction-Sensitive Distances. SCG 1997: 418-420 - 1996
- [j21]Oswin Aichholzer, Franz Aurenhammer, Siu-Wing Cheng, Naoki Katoh, Günter Rote, Michael Taschwer, Yin-Feng Xu:
Triangulations Intersect Nicely. Discret. Comput. Geom. 16(4): 339-359 (1996) - [j20]Oswin Aichholzer, Franz Aurenhammer:
Classifying Hyperplanes in Hypercubes. SIAM J. Discret. Math. 9(2): 225-232 (1996) - [c11]Oswin Aichholzer, Franz Aurenhammer:
Straight Skeletons for General Polygonal Figures in the Plane. COCOON 1996: 117-126 - 1995
- [j19]Oswin Aichholzer, Franz Aurenhammer, David Alberts, Bernd Gärtner:
A Novel Type of Skeleton for Polygons. J. Univers. Comput. Sci. 1(12): 752-761 (1995) - [j18]Franz Aurenhammer, Johann Hagauer:
Recognizing Binary Hamming Graphs in O(n² log n) Time. Math. Syst. Theory 28(5): 387-395 (1995) - [c10]Oswin Aichholzer, Franz Aurenhammer, Michael Taschwer, Günter Rote:
Triangulations Intersect Nicely. SCG 1995: 220-229 - 1994
- [j17]Franz Aurenhammer, Michael Formann, Ramana M. Idury, Alejandro A. Schäffer, Frank Wagner:
Faster Isometric Embedding in Products of Complete Graphs. Discret. Appl. Math. 52(1): 17-28 (1994) - 1992
- [j16]Franz Aurenhammer, Johann Hagauer, Wilfried Imrich:
Cartesian Graph Factorization at Logarithmic Cost per Edge. Comput. Complex. 2: 331-349 (1992) - [j15]Franz Aurenhammer, Johann Hagauer:
Computing equivalence classes among the edges of a graph with applications. Discret. Math. 109(1-3): 3-12 (1992) - [j14]Franz Aurenhammer, Otfried Schwarzkopf:
A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams. Int. J. Comput. Geom. Appl. 2(4): 363-381 (1992) - [j13]Franz Aurenhammer, Gerd Stöckl:
Searching for Segments with Largest Relative Overlap. Inf. Process. Lett. 41(2): 103-108 (1992) - [c9]Franz Aurenhammer, Friedrich Hoffmann, Boris Aronov:
Minkowski-Type Theorems and Least-Squares Partitioning. SCG 1992: 350-357 - 1991
- [j12]Franz Aurenhammer:
Voronoi Diagrams - A Survey of a Fundamental Geometric Data Structure. ACM Comput. Surv. 23(3): 345-405 (1991) - [j11]Franz Aurenhammer:
Using Gale transforms in computational geometry. Math. Program. 52: 179-190 (1991) - [j10]Franz Aurenhammer, Gerd Stöckl:
On the Peeper's Voronoi diagram. SIGACT News 22(4): 50-59 (1991) - [c8]Franz Aurenhammer, Gerd Stöckl, Emo Welzl:
The Post Office Problem for Fuzzy Point Sets. Workshop on Computational Geometry 1991: 1-11 - [c7]Franz Aurenhammer, Otfried Schwarzkopf:
A Simple On-Line Randomized Incremental Algorithm for Computing Higher Order Voronoi Diagrams. SCG 1991: 142-151 - 1990
- [j9]Franz Aurenhammer:
A relationship between Gale transforms and Voronoi diagrams. Discret. Appl. Math. 28(2): 83-91 (1990) - [j8]Franz Aurenhammer:
A New Duality Result Concerning Voronoi Diagrams. Discret. Comput. Geom. 5: 243-254 (1990) - [c6]Franz Aurenhammer, Johann Hagauer, Wilfried Imrich:
Factoring Cartesian-Product Graphs at Logarithmic Cost per Edge. IPCO 1990: 29-44 - [c5]Franz Aurenhammer, Johann Hagauer:
Recognizing Binary Hamming Graphs in O(n² log n) Time. WG 1990: 90-98
1980 – 1989
- 1988
- [j7]Franz Aurenhammer:
On-Line Sorting of Twisted Sequences in Linear Time. BIT 28(2): 194-204 (1988) - [j6]Franz Aurenhammer:
Improved Algorithms for Discs and Balls Using Power Diagrams. J. Algorithms 9(2): 151-161 (1988) - [c4]Franz Aurenhammer:
Using Gale Transforms in Computational Geometry. Workshop on Computational Geometry 1988: 202-216 - 1987
- [j5]Franz Aurenhammer:
A Criterion for the Affine Equivalence of Cell Complexes in Rd and Convex Polyhedra in Rd+1+. Discret. Comput. Geom. 2: 49-64 (1987) - [j4]Franz Aurenhammer:
Recognising Polytopical Cell Complexes and Constructing Projection Polyhedra. J. Symb. Comput. 3(3): 249-255 (1987) - [j3]Franz Aurenhammer:
Power Diagrams: Properties, Algorithms and Applications. SIAM J. Comput. 16(1): 78-96 (1987) - [c3]Franz Aurenhammer:
Jordan Sorting Via Convex Hulls of Certain Non-Simple Polygons. SCG 1987: 21-29 - [c2]Franz Aurenhammer, Hiroshi Imai:
Geometric Relations Among Voronoi Diagrams. STACS 1987: 53-65 - 1986
- [j2]Franz Aurenhammer:
The One-Dimensional Weighted Voronoi Diagram. Inf. Process. Lett. 22(3): 119-123 (1986) - [c1]Franz Aurenhammer:
A New Duality Result Concerning Voronoi Diagrams. ICALP 1986: 21-30 - 1984
- [j1]Franz Aurenhammer, Herbert Edelsbrunner:
An optimal algorithm for constructing the weighted voronoi diagram in the plane. Pattern Recognit. 17(2): 251-257 (1984)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
