Hannes Krasser's Publications

This list is also available as BiBTeX file.

[1]
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:134-141, 2008. (Gzipped PostScript, 63 KB).

[2]
F. Aurenhammer and H. Krasser. Pseudo-simplicial complexes from maximal locally convex functions. Discrete & Computional Geometry, 35:201-221, 2006. (Gzipped PostScript, 124 KB).

[3]
F. Aurenhammer, R.L.S.Drysdale, and H. Krasser. Farthest line segment Voronoi diagrams. Information Processing Letters, 100:220-225, 2006. (Gzipped PostScript, 69 KB).

[4]
O. Aichholzer, F. Aurenhammer, C. Huemer, and H. Krasser. Transforming spanning trees and pseudo-triangulations. Information Processing Letters, 97:19-22, 2006. (Gzipped PostScript, 38 KB).

[5]
O. Aichholzer, F. Aurenhammer, and H. Krasser. On the crossing number of complete graphs. Computing, 76:165-176, 2006. (Gzipped PostScript, 95 KB). See also our crossing number homepage.

[6]
F. Aurenhammer and H. Krasser. Pseudo-tetrahedral complexes. In Proc. 21st European Workshop on Computational Geometry EuroCG '05, pages 85-88, Eindhoven, The Netherlands, 2005. (Gzipped PostScript, 62 KB).

[7]
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 Canadian Conference on Computational Geometry CCCG '05, pages 123-126, Windsor, Ontario, 2005. (Gzipped PostScript, 45 KB).

[8]
O. Aichholzer, F. Aurenhammer, C. Huemer, and H. Krasser. Transforming spanning trees and pseudo-triangulations. In Proc. 21st European Workshop on Computational Geometry EuroCG '05, pages 81-84, Eindhoven, The Netherlands, 2005. (Gzipped PostScript, 38 KB).

[9]
O. Aichholzer, C. Huemer, and H. Krasser. Triangulations without pointed spanning trees - extended abstract. In Proc. 20th European Workshop on Computational Geometry EWCG '04, pages 221-224, Sevilla, Spain, 2004. (Gzipped PostScript, 4 p., 131 KB).

[10]
O. Aichholzer, F. Aurenhammer, H. Krasser, and B. Speckmann. Convexity minimizes pseudo-triangulations. Computational Geometry: Theory and Applications, 28:3-10, 2004. (Gzipped PostScript, 8 p., 76 KB).

[11]
H. Krasser. Order Types of Point Sets in the Plane. PhD thesis, Institute for Theoretical Computer Science, Graz University of Technology, Austria, October 2003. (Gzipped PostScript, 104 p., 370 KB).

[12]
O. Aichholzer, D. Bremner, E.D. Demaine, F. Hurtado, E. Kranakis, H. Krasser, S. Ramaswami, S. Sethia, and J. Urrutia. Geometric games on triangulations. In Proc. 19th European Workshop on Computationl Geometry CG '03 Bonn, pages 89-92, Bonn, Germany, 2003. (Gzipped PostScript, 4 p., 111 KB).

[13]
O. Aichholzer, D. Bremner, E.D. Demaine, F. Hurtado, E. Kranakis, H. Krasser, S. Ramaswami, S. Sethia, and J. Urrutia. Playing with triangulations. In Lecture Notes in Computer Science 2866, Japanese Conference, JCDCG 2002, pages 22-37, 2003. (Gzipped PostScript, 17 p., 1145 KB).

[14]
O. Aichholzer, F. Aurenhammer, P. Brass, and H. Krasser. Pseudo-triangulations from surfaces and a novel type of edge flip. SIAM Journal on Computing, 32:1621-1653, 2003. (Gzipped PostScript, 33 p., 147 KB).

[15]
O. Aichholzer, F. Aurenhammer, P. Brass, and H. Krasser. Spatial embedding of pseudo-triangulations. In Proc. 19th Ann. ACM Symp. Computational Geometry, volume 19, pages 144-153, San Diego, California, USA, 2003. (Gzipped PostScript, 10 p., 96 KB).

[16]
O. Aichholzer, F. Aurenhammer, F. Hurtado, and H. Krasser. Towards compatible triangulations. Theoretical Computer Science, 296:3-13, 2003. Special Issue. (Gzipped PostScript, 13 p., 94 KB).

[17]
O. Aichholzer, F. Aurenhammer, and H. Krasser. Adapting (pseudo)-triangulations with a near-linear number of edge flips. In Lecture Notes in Computer Science 2748, Proc. 8th International Workshop on Algorithms and Data Structures (WADS), volume 2748, pages 12-24, 2003. (Gzipped PostScript, 12 p., 125 KB).

[18]
O. Aichholzer, D. Bremner, E.D. Demaine, F. Hurtado, E. Kranakis, H. Krasser, S. Ramaswami, S. Sethia, and J. Urrutia. Playing with triangulations. In Proc. Japan Conference on Discrete and Computational Geometry JCDCG 2002, pages 46-54, Tokyo, Japan, 2002. (Gzipped PostScript, 17 p., 1145 KB).

[19]
O. Aichholzer, F. Aurenhammer, and H. Krasser. On the crossing number of complete graphs. In Proc. 18th Ann. ACM Symp. Computational Geometry, pages 19-24, Barcelona, Spain, 2002. (Gzipped PostScript, 6 p., 121 KB). See also our crossing number homepage.

[20]
O. Aichholzer, F. Aurenhammer, and H. Krasser. On the crossing number of complete graphs - extended abstract. In Proc. 18th European Workshop on Computationl Geometry CG '02 Warszawa, pages 90-92, Warszawa, Poland, 2002. (Gzipped PostScript, 3 p., 40 KB). See also our crossing number homepage.

[21]
O. Aichholzer, F. Aurenhammer, and H. Krasser. Enumerating order types for small point sets with applications. Order, 19:265-281, 2002. (Gzipped PostScript, 8 p., 70 KB). See also our order type homepage.

[22]
O. Aichholzer, F. Aurenhammer, and H. Krasser. Points and combinatorics. Special Issue on Foundations of Information Processing of TELEMATIK, 1:12-17, 2002. (Gzipped PostScript, 9 p., 74 KB).

[23]
O. Aichholzer, F. Aurenhammer, and H. Krasser. Progress on rectilinear crossing numbers. Technical report, IGI-TU Graz, Austria, 2002. (Gzipped PostScript, 8 p., 66 KB). See also our crossing number homepage.

[24]
O. Aichholzer, F. Aurenhammer, H. Krasser, and B. Speckmann. Convexity minimizes pseudo-triangulations. In Proc. 14th Annual Canadian Conference on Computational Geometry CCCG 2002, pages 158-161, Lethbridge, Alberta, Canada, 2002. (Gzipped PostScript, 4 p., 135 KB).

[25]
O. Aichholzer and H. Krasser. The point set order type data base: A collection of applications and results. In Proc. 13th Annual Canadian Conference on Computational Geometry CCCG 2001, pages 17-20, Waterloo, Ontario, Canada, 2001. (Gzipped PostScript, 10 p., 91 KB). See also our order type homepage.

[26]
O. Aichholzer, F. Aurenhammer, B. Brandtstätter, H. Krasser, C. Magele, M. Mühlmann, and W. Renhart. Evolution trategy and ierarchical lustering. In 13th COMPUMAG Conference on the Computation of Electromagnetic Fields, Lyon-Evian, France, 2001. (Gzipped PostScript, 2 p., 253 KB).

[27]
O. Aichholzer, F. Aurenhammer, F. Hurtado, and H. Krasser. Towards compatible triangulations. In Jie Wang, editor, Proc. 7th Ann. Int'l. Computing and Combinatorics Conf. COCOON'01, Lecture Notes in Computer Science, volume 2108, pages 101-110, Guilin, China, 2001. Springer Verlag. (Gzipped PostScript, 10 p., 75 KB).

[28]
O. Aichholzer, F. Aurenhammer, and H. Krasser. On compatible triangulations of point sets. In Proc. 17th European Workshop on Computational Geometry CG '2001, pages 23-26, Berlin, Germany, 2001. (Gzipped PostScript, 4 p., 42 KB).

[29]
O. Aichholzer, F. Aurenhammer, and H. Krasser. Enumerating order types for small point sets with applications. In Proc. 17th Ann. ACM Symp. Computational Geometry, pages 11-18, Medford, Massachusetts, USA, 2001. (Gzipped PostScript, 8 p., 70 KB). See also our order type homepage.

[30]
O. Aichholzer, F. Aurenhammer, B. Brandtstätter, T. Ebner, H. Krasser, and C. Magele. Niching evolution strategy with cluster algorithms. In 9th Biennial IEEE Conf. Electromagnetic Field Computations, Milwaukee, Wisconsin, USA, 2000. (Gzipped PostScript, 4 p., 334 KB).

[31]
H. Krasser. Kompatible triangulierungen ebener punktmengen. Master's thesis, Institute for Theoretical Computer Science, Graz University of Technology, Austria, June 1999. (in German). (Gzipped PostScript, 80 p., 202 KB).