Thomas Hackl

Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Clemens Huemer, Attila Pór, Francisco Santos, Bettina Speckmann, Birgit Vogtenhuber: Maximizing maximal angles for plane straight-line graphs. Comput. Geom. 46(1): 17-28 (2013)

Oswin Aichholzer, Ruy Fabila Monroy, Thomas Hackl, Marc J. van Kreveld, Alexander Pilz, Pedro Ramos, Birgit Vogtenhuber: Blocking Delaunay triangulations. Comput. Geom. 46(2): 154-159 (2013)

Andrei Asinowski, Jean Cardinal, Nathann Cohen, Sébastien Collette, Thomas Hackl, Michael Hoffmann, Kolja B. Knauer, Stefan Langerman, Michal Lason, Piotr Micek, Günter Rote, Torsten Ueckerdt: Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. CoRR abs/1302.2426 (2013)

Oswin Aichholzer, Ruy Fabila Monroy, Thomas Hackl, Clemens Huemer, Alexander Pilz, Birgit Vogtenhuber: Lower Bounds for the Number of Small Convex k-Holes. CCCG 2012: 247-252

Oswin Aichholzer, Howard Cheng, Satyan L. Devadoss, Thomas Hackl, Stefan Huber, Brian Li, Andrej Risteski: What makes a Tree a Straight Skeleton? CCCG 2012: 253-258

Oswin Aichholzer, Ruy Fabila Monroy, Thomas Hackl, Clemens Huemer, Jorge Urrutia: Empty Monochromatic Simplices. CoRR abs/1210.7043 (2012)

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. Geometry Appl. 21(1): 47-69 (2011)

Birgit Vogtenhuber, Oswin Aichholzer, Ruy Fabila Monroy, Clemens Huemer, Jorge Urrutia, Marco A. Heredia, Hernán González-Aguilar, Thomas Hackl, Pavel Valtr: On k-Gons and k-Holes in Point Sets. CCCG 2011

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)

Oswin Aichholzer, Sergio Cabello, Ruy Fabila Monroy, David Flores-Peñaloza, Thomas Hackl, Clemens Huemer, Ferran Hurtado, David R. Wood: Edge-Removal and Non-Crossing Configurations in Geometric Graphs. Discrete Mathematics & Theoretical Computer Science 12(1): 75-86 (2010)

Oswin Aichholzer, Thomas Hackl, Clemens Huemer, Ferran Hurtado, Birgit Vogtenhuber: Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons. SIAM J. Discrete Math. 23(4): 2147-2155 (2010)

Oswin Aichholzer, Wolfgang Aigner, Thomas Hackl, Nicola Wolpert: Exact Medial Axis Computation for Circular Arc Boundaries. Curves and Surfaces 2010: 28-42

Oswin Aichholzer, Ruy Fabila Monroy, Thomas Hackl, Alexander Pilz, Pedro Ramos, Marc J. van Kreveld, Birgit Vogtenhuber: Blocking delaunay triangulations. CCCG 2010: 21-24

Thomas Hackl, Oswin Aichholzer, Birgit Vogtenhuber: Compatible pointed pseudo-triangulations. CCCG 2010: 91-94

Oswin Aichholzer, Daniel Detassis, Thomas Hackl, Gerald Steinbauer, Johannes Thonhauser: Playing Pylos with an autonomous robot. IROS 2010: 2507-2508

Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Margot Rabl: Medial axis computation for planar free-form shapes. Computer-Aided Design 41(5): 339-349 (2009)

Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bettina Speckmann: On minimum weight pseudo-triangulations. Comput. Geom. 42(6-7): 627-631 (2009)

Oswin Aichholzer, Ruy Fabila Monroy, David Flores-Peñaloza, Thomas Hackl, Clemens Huemer, Jorge Urrutia: Empty monochromatic triangles. Comput. Geom. 42(9): 934-938 (2009)

Oswin Aichholzer, Thomas Hackl, David Orden, Pedro Ramos, Günter Rote, André Schulz, Bettina Speckmann: Flip Graphs of Bounded-Degree Triangulations. Electronic Notes in Discrete Mathematics 34: 509-513 (2009)

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

Tilmann Rabl, Andreas Lang, Thomas Hackl, Bernhard Sick, Harald Kosch: Generating Shifting Workloads to Benchmark Adaptability in Relational Database Systems. TPCTC 2009: 116-131

Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Alexander Pilz, Günter Rote, Bettina Speckmann, Birgit Vogtenhuber: Plane Graphs with Parity Constraints. WADS 2009: 13-24

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)

Oswin Aichholzer, Ruy Fabila Monroy, David Flores-Peñaloza, Thomas Hackl, Clemens Huemer, Jorge Urrutia: Empty Monochromatic Triangles. CCCG 2008

Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Clemens Huemer: Connecting colored point sets. Discrete Applied Mathematics 155(3): 271-278 (2007)

Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl: Pre-Triangulations and Liftable Complexes. Discrete & Computational Geometry 38(4): 701-725 (2007)

Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bettina Speckmann: On (Pointed) Minimum Weight Pseudo-Triangulations. CCCG 2007: 209-212

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

Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Clemens Huemer, Attila Pór, Francisco Santos, Bettina Speckmann, Birgit Vogtenhuber: Maximizing Maximal Angles for Plane Straight-Line Graphs. WADS 2007: 458-469

Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Clemens Huemer, Attila Pór, Francisco Santos, Bettina Speckmann, Birgit Vogtenhuber: Maximizing Maximal Angles for Plane Straight-Line Graphs. CoRR abs/0705.3820 (2007)

Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl: Pre-triangulations and liftable complexes. Symposium on Computational Geometry 2006: 282-291

Oswin Aichholzer, Thomas Hackl, Birgit Vogtenhuber, Clemens Huemer, Ferran Hurtado, Hannes Krasser: On the number of plane graphs. SODA 2006: 504-513

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