[ Back to Thomas Hackl's main page | To the Institute for Software Technology ]

Thomas Hackl's Publications

This list is also available as BiBTeX file.

[1]
O. Aichholzer, T. Hackl, M. Hoffmann, C. Huemer, F. Santos, B. Speckmann, and B. Vogtenhuber. Maximizing maximal angles for plane straight line graphs. submitted to journal, 2010.

[2]
O. Aichholzer, T. Hackl, C. Huemer, F. Hurtado, and B. Vogtenhuber. Large bichromatic point sets admit empty monochromatic 4-gons. SIAM Journal on Discrete Mathematics (SIDMA), 23(4):2147-2155, 2010.

[3]
O. Aichholzer, S. Cabello, R. Fabila-Monroy, D. Flores-Peñaloza, T. Hackl, C. Huemer, F. Hurtado, and D.R. Wood. Edge-removal and non-crossing configurations in geometric graphs. Discrete Mathematics & Theoretical Computer Science (DMTCS), page to appear, 2010.

[4]
O. Aichholzer, F. Aurenhammer, T. Hackl, B. Jüttler, M.Oberneder, and Z. Sír. Computational and structural advantages of circular boundary representation. Int'l. Journal of Computational Geometry & Applications, page to appear, 2010. Special Issue.

[5]
O. Aichholzer, W. Aigner, F. Aurenhammer, T. Hackl, B. Jüttler, E. Pilgerstorfer, and M. Rabl. Divide-and conquer for Voronoi diagrams revisited. Computational Geometry: Theory and Applications, page to appear, 2010. (PDF, 1167352 bytes).

[6]
O. Aichholzer, T. Hackl, M. Hoffmann, A. Pilz, G. Rote, B. Speckmann, and B. Vogtenhuber. Plane graphs with parity constraints. In Lecture Notes in Computer Science, Proc. 11th International Workshop on Algorithms and Data Structures (WADS), volume 5664, pages 13-24, Banff, Alberta, Canada, 2009. (PDF, 270717 bytes).

[7]
O. Aichholzer, T. Hackl, C. Huemer, F. Hurtado, and B. Vogtenhuber. Large bichromatic point sets admit empty monochromatic 4-gons. In Proc. 25th European Workshop on Computational Geometry EuroCG '09, pages 133-136, Brussels, Belgium, 2009. (PDF, 131721 bytes).

[8]
O. Aichholzer, T. Hackl, D. Orden, P. Ramos, G. Rote, A. Schulz, and B. Speckmann. Flip graphs of bounded-degree triangulations. In Electronic Notes in Discrete Mathematics: Proc. European Conference on Combinatorics, Graph Theory and Applications EuroComb 2009, volume 34, pages 509-513, Bordeaux, France, 2009.

[9]
O. Aichholzer, R. Fabila-Monroy, D. Flores-Peñaloza, T. Hackl, C. Huemer, and J. Urrutia. Empty monochromatic triangles. Computational Geometry: Theory and Applications, 42(9):934-938, 2009.

[10]
O. Aichholzer, R. Fabila-Monroy, D. Flores-Peñaloza, T. Hackl, C. Huemer, J. Urrutia, and B. Vogtenhuber. Modem illumination of monotone polygons. In Proc. 25th European Workshop on Computational Geometry EuroCG '09, pages 167-170, Brussels, Belgium, 2009. (PDF, 99624 bytes).

[11]
O. Aichholzer, F. Aurenhammer, T. Hackl, and B. Speckmann. On minimum weight pseudo-triangulations. Computational Geometry: Theory and Applications, 42(6-7):627-631, 2009. (PDF, 101244 bytes).

[12]
O. Aichholzer, F. Aurenhammer, O. Devillers, T. Hackl, M. Teillaud, and B. Vogtenhuber. Lower and upper bounds on the number of empty cylinders and ellipsoids. In Proc. 25th European Workshop on Computational Geometry EuroCG '09, pages 139-142, Brussels, Belgium, 2009. (PDF, 211170 bytes). Also available as Research Report RR-6748 "Counting Quadrics and Delaunay Triangulations and a new Convex Hull Theorem", INRIA, 2008, at http://hal.inria.fr/inria-00343651.

[13]
O. Aichholzer, W. Aigner, F. Aurenhammer, T. Hackl, B. Jüttler, and M. Rabl. Medial axis computation for planar free-form shapes. Computer-Aided Design, 41(5):339-349, 2009. Special issue: Voronoi Diagrams and their Applications. (PDF, 1207115 bytes).

[14]
O. Aichholzer, W. Aigner, F. Aurenhammer, T. Hackl, B. Jüttler, E. Pilgerstorfer, and M. Rabl. Divide-and-conquer for voronoi diagrams revisited. In Proc. 25th European Workshop on Computational Geometry EuroCG '09, pages 293-296, Brussels, Belgium, 2009. (PDF, 145028 bytes).

[15]
O. Aichholzer, W. Aigner, F. Aurenhammer, T. Hackl, B. Jüttler, E. Pilgerstorfer, and M. Rabl. Divide-and-conquer for voronoi diagrams revisited. In 25th Ann. ACM Symp. Computational Geometry, pages 189-197, Aarhus, Denmark, 2009. (PDF, 1167352 bytes).

[16]
O. Aichholzer, R. Fabila-Monroy, D. Flores-Peñaloza, T. Hackl, C. Huemer, and J. Urrutia. Empty monochromatic triangles. In Proc. 20th Annual Canadian Conference on Computational Geometry CCCG 2008, pages 75-78, Montreal, Quebec, Canada, 2008. (PDF, 123429 bytes).

[17]
O. Aichholzer, S. Cabello, R. Fabila-Monroy, D. Flores-Peñaloza, T. Hackl, C. Huemer, F. Hurtado, and D.R. Wood. Edge-removal and non-crossing configurations in geometric graphs. In Proc. 24th European Workshop on Computational Geometry EuroCG '08, pages 119-122, Nancy, France, 2008. (PDF, 165239 bytes).

[18]
O. Aichholzer, F. Aurenhammer, P. Gonzalez-Nava, T. Hackl, C. Huemer, F. Hurtado, H. Krasser, S. Ray, and B. Vogtenhuber. Matching edges and faces in polygonal partitions. Computational Geometry: Theory and Applications, 39(2):134-141, 2008. (Gzipped PostScript, 10 pages, 62603 bytes).

[19]
O. Aichholzer, F. Aurenhammer, T. Hackl, B. Kornberger, S. Plantinga, G. Rote, A. Sturm, and G. Vegter. Seed polytopes for incremental approximation. In Proc. 24th European Workshop on Computational Geometry EuroCG '08, pages 13-16, Nancy, France, 2008. (Gzipped PostScript, 4 pages, 198383 bytes).

[20]
O. Aichholzer, T. Hackl, C. Huemer, F. Hurtado, H. Krasser, and B. Vogtenhuber. On the number of plane geometric graphs. Graphs and Combinatorics (Springer), 23(1):67-84, 2007. (Gzipped PostScript, 16 pages, 238847 bytes).

[21]
O. Aichholzer, T. Hackl, M. Hoffmann, C. Huemer, F. Santos, B. Speckmann, and B. Vogtenhuber. Maximizing maximal angles for plane straight line graphs. In Proc. 23rd European Workshop on Computational Geometry EuroCG '07, pages 98-101, Graz, Austria, 2007. (PDF, 190360 bytes). Also available as FSP-report S092-48, Austria, 2007, at http://www.ig.jku.at/cgi-bin/CGI/Reports.pl.

[22]
O. Aichholzer, T. Hackl, M. Hoffmann, C. Huemer, A. Por, F. Santos, B. Speckmann, and B. Vogtenhuber. Maximizing maximal angles for plane straight line graphs. In Lecture Notes in Computer Science, Proc. 10th International Workshop on Algorithms and Data Structures (WADS), volume 4619, pages 458-469, Halifax, Nova Scotia, Canada, 2007. (PDF, 426080 bytes).

[23]
O. Aichholzer and T. Hackl, editors. Collection of Abstracts of the 23rd European Workshop on Computational Geometry 2007, Graz, Austria, 2007. Available at the conference homepage http://ewcg07.tugraz.at/EuroCG2007Abstracts.pdf.

[24]
O. Aichholzer, F. Aurenhammer, T. Hackl, and C. Huemer. Connecting colored point sets. Discrete Applied Mathematics, 155(3):271-278, 2007. (Gzipped PostScript, 9 pages, 94471 bytes). Also available as FSP-report S092-45, Austria, 2006, at http://www.ig.jku.at/cgi-bin/CGI/Reports.pl.

[25]
O. Aichholzer, F. Aurenhammer, and T. Hackl. Pre-triangulations and liftable complexes. Discrete & Computational Geometry, 38:701-725, 2007. (Gzipped PostScript, 25 pages, 175458 bytes).

[26]
O. Aichholzer, F. Aurenhammer, T. Hackl, B. Kornberger, M. Peternell, and H. Pottmann. Approximating boundary-triangulated objects with balls. In Proc. 23rd European Workshop on Computational Geometry EuroCG '07, pages 130-133, Graz, Austria, 2007. (PDF, 191559 bytes). Also available as FSP-report S092-49, Austria, 2007, at http://www.ig.jku.at/cgi-bin/CGI/Reports.pl.

[27]
O. Aichholzer, F. Aurenhammer, T. Hackl, B. Jüttler, M.Oberneder, and Z. Sír. Computational and structural advantages of circular boundary representation. In Lecture Notes in Computer Science, Proc. 10th International Workshop on Algorithms and Data Structures (WADS), volume 4619, pages 374-385, Halifax, Nova Scotia, Canada, 2007. (Gzipped PostScript, 17 pages, 119734 bytes). Also available as FSP-report S092-38, Austria, 2006, at http://www.ig.jku.at/cgi-bin/CGI/Reports.pl.

[28]
O. Aichholzer, F. Aurenhammer, T. Hackl, and B. Speckmann. On (pointed) minimum weight pseudo-triangulations. In Proc. 19th Annual Canadian Conference on Computational Geometry CCCG 2007, pages 209-212, Ottawa, Ontario, Canada, 2007. (PDF, 111677 bytes).

[29]
O. Aichholzer, T. Hackl, C. Huemer, F. Hurtado, H. Krasser, and B. Vogtenhuber. On the number of plane graphs. In Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 504-513, Miami, Florida, USA, 2006. (PDF, 198074 bytes). Also available as FSP-report S092-8, Austria, 2006, at http://www.ig.jku.at/cgi-bin/CGI/Reports.pl.

[30]
O. Aichholzer, F. Aurenhammer, and T. Hackl. Pre-triangulations and liftable complexes. In 22nd Ann. ACM Symp. Computational Geometry, pages 282-291, Sedona, Arizona, USA, 2006. (Gzipped PostScript, 11 pages, 97656 bytes). Also available as FSP-report S092-6, Austria, 2006, at http://www.ig.jku.at/cgi-bin/CGI/Reports.pl.

[31]
O. Aichholzer, T. Hackl, C. Huemer, F. Hurtado, H. Krasser, and B. Vogtenhuber. Bounding the number of plane graphs. In Proc. 15th Annual Fall Workshop on Computational Geometry and Visualization, pages 31-32, Philadelphia, Pennsylvania, USA, 2005.

[32]
O. Aichholzer, F. Aurenhammer, P. Gonzalez-Nava, T. Hackl, C. Huemer, F. Hurtado, H. Krasser, S. Ray, and B. Vogtenhuber. Matching edges and faces in polygonal partitions. In Proc. 17th Annual Canadian Conference on Computational Geometry CCCG 2005, pages 123-126, Windsor, Ontario, Canada, 2005. (Gzipped PostScript, 4 pages, 56205 bytes). Also available as FSP-report S092-4, Austria, 2005, at http://www.ig.jku.at/cgi-bin/CGI/Reports.pl.

[33]
T. Hackl. Manipulation of pseudo-triangular surfaces. Master's thesis, IGI-TU Graz, Austria, 2004. (Gzipped PostScript, 2314490 bytes). (PDF, 2786870 bytes).

The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.