Franz Aurenhammer
- Computer Graphics and Computer-Aided Design top 0.1%
- Computer Vision and Pattern Recognition top 0.5%
- Signal Processing top 1%
- Computer Networks and Communications top 2%
- Computational Mechanics top 1%
- Co-authors
- Oswin AichholzerHerbert EdelsbrunnerRolf KleinDer-Tsai LeeHannes KrasserBoris AronovFriedrich HoffmannOtfried Schwarzkopf
- Topics
- Computational Geometry and Mesh Generation (78 papers)Digital Image Processing Techniques (23 papers)Advanced Graph Theory Research (23 papers)
In The Last Decade
Franz Aurenhammer
98 papers receiving 4.5k citations
Hit Papers
Peers
Comparison fields: 5 of 176
- Computer Graphics and Computer-Aided Design 1.8k
- Computer Vision and Pattern Recognition 1.2k
- Signal Processing 722
- Computer Networks and Communications 698
- Computational Mechanics 693
Countries citing papers authored by Franz Aurenhammer
This map shows the geographic impact of Franz Aurenhammer's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Franz Aurenhammer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Franz Aurenhammer more than expected).
Fields of papers citing papers by Franz Aurenhammer
This network shows the impact of papers produced by Franz Aurenhammer. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Franz Aurenhammer. The network helps show where Franz Aurenhammer may publish in the future.
Co-authorship network of co-authors of Franz Aurenhammer
This figure shows the co-authorship network connecting the top 25 collaborators of Franz Aurenhammer. A scholar is included among the top collaborators of Franz Aurenhammer based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Franz Aurenhammer. Franz Aurenhammer is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | Mitered offsets and straight skeletons for circular arc polygons | 1 |
| 2 | Voronoi diagrams for parallel halflines in 3D | 0 |
| 3 | 11 | |
| 4 | 2 | |
| 5 | On triangulation axes of polygons | 1 |
| 6 | 6 | |
| 7 | 1 | |
| 8 | 3-Colorability of pseudo-triangulations | 1 |
| 9 | 21 | |
| 10 | 6 | |
| 11 | 3 | |
| 12 | 0 | |
| 13 | 5 | |
| 14 | Small weak epsilon nets | 6 |
| 15 | Matching edges and faces in polygonal partitions | 2 |
| 16 | 11 | |
| 17 | 2 | |
| 18 | 10 | |
| 19 | 11 | |
| 20 | 0 |
About Franz Aurenhammer
Franz Aurenhammer is a scholar working on Computer Graphics and Computer-Aided Design, Discrete Mathematics and Combinatorics and Signal Processing, having authored 105 papers that have together received 4.8k indexed citations. Recurring topics across this work include Computational Geometry and Mesh Generation (78 papers), Digital Image Processing Techniques (23 papers) and Advanced Graph Theory Research (23 papers). The work is most often cited by research in Computer Graphics and Computer-Aided Design (1.8k citations), Signal Processing (722 citations) and Computer Vision and Pattern Recognition (1.2k citations). Franz Aurenhammer has collaborated with scholars based in Austria, China and Germany. Frequent co-authors include Oswin Aichholzer, Herbert Edelsbrunner, Rolf Klein, Der-Tsai Lee, Hannes Krasser, Boris Aronov, Friedrich Hoffmann, Otfried Schwarzkopf, Bert Jüttler and Wolfgang Aigner. Their work appears in journals such as ACM Computing Surveys, Pattern Recognition and Mathematical Programming.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.