Franz Aurenhammer: Publications

This list is also available as BiBTeX file.

[1]
T. Schiffer, F. Aurenhammer, and M. Demuth. Computing convex quadrangulations. Discrete Applied Mathematics, 160:648-656, 2012. (PostScript, 790 KB).

[2]
O. Aichholzer, F. Aurenhammer, E.D. Demaine, F. Hurtado, P. Ramos, and J. Urrutia. On k-convex polygons. Computational Geometry: Theory and Applications, 45:73-87, 2012.

[3]
O. Aichholzer, F. Aurenhammer, T. Hackl, B. Juettler, M. Oberneder, and Z. Sir. Computational and structural advantages of circular boundary representation. Int'l Journal of Computational Geometry & Applications, 21:47-69, 2011. (Gzipped PostScript, 20 p., 201 KB).

[4]
O. Aichholzer, W. Aigner, F. Aurenhammer, K. Cech Dobiasova, B. Jüttler, and G. Rote. Triangulations with circular arcs. In Proc. 19th Int. Symposium on Graph Drawing, Springer LNCS, volume 7034, pages 296-307, Eindhoven, Netherlands, 2011. (PostScript, 184 KB).

[5]
O. Aichholzer, W. Aigner, F. Aurenhammer, and B. Jüttler. Exact medial axis computation for triangulated solids with respect to piecewise linear metrics. In Proc. Int. Conf. Curves and Surfaces, Springer LNCS, volume 6920, pages 1-27, Avignon, France, 2011. (PostScript, 958 KB).

[6]
M. Demuth, F. Aurenhammer, and A. Pinz. Straight skeletons for binary shapes. In 3rd Workshop on non-rigid shape analysis and deformable image alignment (NORDIA'10), San Francisco, USA, 2010. (PostScript, 104 KB).

[7]
O. Aichholzer, F. Aurenhammer, T. Hackl, C. Huemer, A. Pilz, and B. Vogtenhuber. 3-colorability of pseudo-triangulations. In Proc. 26th European Workshop on Computational Geometry EuroCG'10, pages 21-24, Dortmund, Germany, 2010. (PostScript, 109 KB).

[8]
O. Aichholzer, W. Aigner, F. Aurenhammer, K. Cech Dobiasova, B. Jüttler, and G. Rote. Arc triangulations. In Proc. 26th European Workshop on Computational Geometry EuroCG '2010, pages 17-20, Dortmund, Germany, 2010. (PostScript, 168 KB).

[9]
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, 43:688-699, 2010. (PostScript, 719 KB).

[10]
B. Aronov, F. Aurenhammer, F. Hurtado, S. Langerman, D. Rappaport, S. Smorodinsky, and C. Seara. Small weak epsilon nets. Computational Geometry: Theory and Applications, 42:455-462, 2009. Special Issue. (PostScript, 218 KB).

[11]
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-141, Brussels, Belgium, 2009.

[12]
O. Aichholzer, F. Aurenhammer, F. Hurtado, P.A. Ramos, and J. Urrutia. Two-convex polygons. In Proc. 25th European Workshop on Computational Geometry EuroCG'09, pages 117-120, Brussels, Belgium, 2009. (PostScript, 126 KB).

[13]
O. Aichholzer, F. Aurenhammer, T. Hackl, and B. Speckmann. On minimum weight pseudo-triangulations. Computational Geometry: Theory and Applications, 42:627-631, 2009. (PostScript, 101 KB).

[14]
O. Aichholzer, F. Aurenhammer, B. Kornberger, S. Plantinga, G. Rote, A. Sturm, and G. Vegter. Recovering structure from r-sampled objects. In Eurographics Symposium on Geometry Processing, Computer Graphics Forum, volume 28, pages 1349-1360, Berlin, Germany, 2009. Special Issue. (PostScript, 613 KB).

[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 Proc. 25th Ann. ACM Symp. Computational Geometry, pages 189-197, Aarhus, Denmark, 2009. (PostScript, 711 KB).

[16]
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. (PostScript, 145 KB).

[17]
O. Aichholzer, W. Aigner, F. Aurenhammer, T. Hackl, B. Juettler, and M. Rabl. Medial axis computation for planar free-form shapes. Computer Aided Design, 41:339-349, 2009. Special Issue. (PostScript, 1221 KB).

[18]
F. Aurenhammer and Y.-F.Xu. Optimal triangulations. In Encyclopedia of Optimization, Second Edition, P.M.Pardalos C.A.Floudas, editor, pages 2757-2764. Springer, 2008. (Gzipped PostScript, 9 p., 152 KB).

[19]
F. Aurenhammer, M. Demuth, and T. Schiffer. Computing convex quadrangulations. In Proc. 5th Ann. Int. Symp. Voronoi Diagrams in Science and Engineering, Voronoi's Impact on Modern Science, volume 4, pages 32-43, Kiev, Ukraine, 2008. (Gzipped PostScript, 10 p., 64 KB).

[20]
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, 11 p., 63 KB).

[21]
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 p., 198 KB).

[22]
F. Aurenhammer, M. Peternell, H. Pottmann, and J. Wallner. Voronoi diagrams for oriented spheres. In Proc. 4th Int. Symp. on Voronoi Diagrams in Science and Engineering, ISVD'07, pages 33-37, Pontypridd, UK, 2007. (Gzipped PostScript, 5 p., 71 KB).

[23]
F. Aurenhammer. Weighted skeletons and fixed-share decomposition. Computational Geometry: Theory and Applications, 40:93-101, 2007. (Gzipped PostScript, 11 p., 77 KB).

[24]
O. Aichholzer, F. Aurenhammer, and T. Hackl. Pre-triangulations and liftable complexes. Discrete & Computational Geometry, 38:701-725, 2007. (Gzipped PostScript, 26 p., 173 KB).

[25]
O. Aichholzer, F. Aurenhammer, T. Hackl, and C. Huemer. Connecting colored point sets. Discrete Applied Mathematics, 155:271-278, 2007. (Gzipped PostScript, 10 p., 148 KB).

[26]
O. Aichholzer, F. Aurenhammer, T. Hackl, B. Juettler, M. Oberneder, and Z. Sir. Computational and structural advantages of circular boundary representation. In Proc. 10th Int. Workshop on Algorithms and Data Structures, WADS'07, Springer LNCS 4619, pages 374-385, Halifax, Canada, 2007. (Gzipped PostScript, 13 p., 169 KB).

[27]
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, EWCG'07, pages 130-133, Graz, Austria, 2007. (Gzipped PostScript, 4 p., 277 KB).

[28]
O. Aichholzer, F. Aurenhammer, T. Hackl, and B. Speckmann. On (pointed) minimum weight pseudo-triangulations. In Proc. 19th Canadian Conference on Computational Geometry CCCG '07, pages 209-212, Ottawa, Canada, 2007. (PostScript, 111 KB).

[29]
O. Aichholzer, F. Aurenhammer, C. Huemer, and B. Vogtenhuber. Gray code enumeration of plane straight-line graphs. Graphs and Combinatorics, 23:467-479, 2007. (Gzipped PostScript, 12 p., 120 KB).

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

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

[32]
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, 10 p., 173 KB).

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

[34]
O. Aichholzer, F. Aurenhammer, C. Huemer, and B. Vogtenhuber. Gray code enumeration of plane straight-line graphs. In Proc. 22nd European Workshop on Computational Geometry EuroCG '06, pages 71-74, Delphi, Greece, 2006. (Gzipped PostScript, 4 p., 141 KB).

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

[36]
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, 4 p., 62 KB).

[37]
F. Aurenhammer. Pre-triangulations: A generalization of Delaunay triangulations and flips. In 2nd Intern. Symp. on Voronoi Diagrams in Science and Engineering, page 235, Hanyang University, Seoul, Korea, 2005. (plenar talk).

[38]
B. Aronov, F. Aurenhammer, F. Hurtado, S. Langerman, D. Rappaport, S. Smorodinsky, and C. Seara. Small weak epsilon nets. In Proc. 17th Canadian Conference on Computational Geometry CCCG '05, pages 51-54, Windsor, Ontario, 2005. (PostScript, 180 KB).

[39]
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, 5 p., 45 KB).

[40]
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, 4 p., 38 KB).

[41]
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).

[42]
O. Aichholzer, F. Aurenhammer, and B. Palop. Quickest paths, straight skeletons, and the city Voronoi diagram. Discrete & Computational Geometry, 31(1):17-35, 2004. (Gzipped PostScript, 20 p., 155 KB).

[43]
F. Aurenhammer. Pseudo-simplices and their derivation. In Voronoi Conference on Analytic Number Theory and Spatial Tesselations, page 11, Inst. Math. National Academy of Sciences, Kiev, Ukraine, 2003.

[44]
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).

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

[46]
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).

[47]
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).

[48]
F. Aurenhammer, N. Katoh, H. Kojima, M. Ohsaki, and Y.-F. Xu. Approximating uniform triangular meshes in polygons. Theoretical Computer Science, 289:879-895, 2002. Special Issue. [SFB Report F003-159, TU Graz, Austria, 1999]. (Gzipped PostScript, 14 p., 210 KB).

[49]
O. Aichholzer, F. Aurenhammer, and F. Hurtado. Sequences of spanning trees and a fixed tree theorem. Computational Geometry: Theory and Applications, 21(1-2):3-20, 2002. Special Issue. [Report MA2-IR-00-00026, Universitat Politecnica de Catalunya, Barcelona, Spain, 2000]. (Gzipped PostScript, 22 p., 117 KB). You can also download the nice program MST-Tool we used to check and visualize some of the presented results!

[50]
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.

[51]
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.

[52]
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.

[53]
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).

[54]
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.

[55]
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).

[56]
O. Aichholzer, F. Aurenhammer, and B. Palop. Quickest paths, straight skeletons, and the city Voronoi diagram. In Proc. 18th Ann. ACM Symp. Computational Geometry, pages 151-159, Barcelona, Spain, 2002. (Gzipped PostScript, 9 p., 87 KB).

[57]
O. Aichholzer, F. Aurenhammer, and T. Werner. Algorithmic fun - Abalone. Special Issue on Foundations of Information Processing of TELEMATIK, 1:4-6, 2002. (Gzipped PostScript, 5 p., 420 KB).

[58]
O. Aichholzer and F. Aurenhammer. Voronoi diagrams - computational geometry's favorite. Special Issue on Foundations of Information Processing of TELEMATIK, 1:7-11, 2002. (Gzipped PostScript, 7 p., 189 KB).

[59]
F. Aurenhammer. Computational geometry -- some easy questions and their recent solutions. J. Universal Computer Science, 7:338-354, 2001. Special Issue. (Gzipped PostScript, 17 p., 98 KB).

[60]
O. Aichholzer, F. Aurenhammer, B. Brandtstaetter, H. Krasser, C. Magele, M. Muehlmann, 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).

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

[62]
O. Aichholzer, F. Aurenhammer, C. Icking, R. Klein, E. Langetepe, and G. Rote. Generalized self-approaching curves. Discrete Applied Mathematics, 109(1-2):3-24, 2001. Special Issue. [SFB-Report F003-134, TU Graz, Austria, 1998]. (Gzipped PostScript, 21 p., 193 KB). (PDF, 385 KB).

[63]
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).

[64]
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.

[65]
F. Aurenhammer and Y.-F.Xu. Optimal triangulations. In Encyclopedia of Optimization, P.M.Pardalos C.A.Floudas, editor, volume 4, pages 160-166. Kluwer Academic Publishing, 2000. [SFB Report F003-099, Tu Graz, Austria, 1998]. (Gzipped PostScript, 8 p., 75 KB).

[66]
F. Aurenhammer and R. Klein. Voronoi diagrams. In Handbook of Computational Geometry, Chapter V, J. Sack and G. Urrutia, editors, pages 201-290. Elsevier Science Publishing, 2000. [SFB Report F003-092, TU Graz, Austria, 1996]. (Gzipped PostScript, 101 p., 473 KB).

[67]
F. Aurenhammer, N. Katoh, H. Kojima, M. Ohsaki, and Y.-F. Xu. Approximating uniform triangular meshes in polygons. In Proc. 6th Ann. Intl. Computing and Combinatorics Conference, Lecture Notes in Computer Science, volume 1558, pages 23-33, Sydney, Australia, 2000. Springer Verlag. (PDF, 252 KB).

[68]
O. Aichholzer, F. Aurenhammer, B. Brandtstaetter, 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).

[69]
O. Aichholzer, F. Aurenhammer, and F. Hurtado. Edge operations on non-crossing spanning trees. In Proc. 16th European Workshop on Computational Geometry CG '2000, pages 121-125, Eilat, Israel, 2000. (Gzipped PostScript, 5 p., 63 KB). You can download our MST-Tool.

[70]
O. Aichholzer, F. Aurenhammer, D.Z. Chen, D.T. Lee, and E. Papadopoulou. Skew Voronoi diagrams. Int'l. Journal of Computational Geometry & Applications, 9:235-247, 1999. (Gzipped PostScript, 13 p., 86 KB). Click here for Figures and Animations of Skew Voronoi Diagrams

[71]
O. Aichholzer, F. Aurenhammer, and R. Hainz. New results on MWT subgraphs. Information Processing Letters, 69:215-219, 1999. [SFB Report F003-140, TU Graz, Austria, 1998]. (Gzipped PostScript, 7 p., 60 KB).

[72]
O. Aichholzer, F. Aurenhammer, G. Rote, and Y.-F. Xu. Constant-level greedy triangulations approximate the MWT well. Journal of Combinatorial Optimization, 2:361-369, 1999. [SFB-Report F003-050, TU Graz, Austria, 1995]. (Gzipped PostScript, 9 p., 90 KB).

[73]
F. Aurenhammer, F. Hoffmann, and B. Aronov. Minkowski-type theorems and least-squares clustering. Algorithmica, 20:61-76, 1998. [SFB Report F003-075, TU Graz, Austria, 1996]. (Gzipped PostScript, 17 p., 93 KB).

[74]
O. Aichholzer, F. Aurenhammer, C. Icking, R. Klein, E. Langetepe, and G. Rote. Generalized self-approaching curves. In Proc. 14th European Workshop on Computational Geometry CG '98, pages 15-18, Barcelona, Spain, 1998. (Gzipped PostScript, 3 p., 91 KB).

[75]
O. Aichholzer, F. Aurenhammer, C. Icking, R. Klein, E. Langetepe, and G. Rote. Generalized self-approaching curves. In Proc. 9th Int. Symp. Algorithms and Computation ISAAC'98, Lecture Notes in Computer Science, volume 1533, pages 317-326, Taejon, Korea, 1998. Springer Verlag. (Gzipped PostScript, 10 p., 169 KB).

[76]
O. Aichholzer and F. Aurenhammer. Straight skeletons for general polygonal figures in the plane. In Voronoi's Impact on Modern Sciences II, A.M. Samoilenko, editor, volume 21, pages 7-21. Proc. Institute of Mathematics of the National Academy of Sciences of Ukraine, Kiev, Ukraine, 1998. (Gzipped PostScript, 14 p., 92 KB).

[77]
R. Hainz, O. Aichholzer, and F. Aurenhammer. New results on minimum-weight triangulations and the LMT skeleton. In Proc. 13th European Workshop on Computational Geometry CG '97, pages 4-6, Wuerzburg, Germany, 1997. (Gzipped PostScript, 3 p., 69 KB).

[78]
O. Aichholzer, F. Aurenhammer, D.Z. Chen, D.T. Lee, A. Mukhopadhyay, and E. Papadopoulou. Voronoi diagrams for direction-sensitive distances (communication). In Proc. 13th Ann. ACM Symp. Computational Geometry, pages 418-420, Nice, France, 1997. [SFB Report F003-098, TU Graz, Austria, 1996]. (Gzipped PostScript, 3 p., 52 KB).

[79]
O. Aichholzer, F. Aurenhammer, S.-W. Cheng, N. Katoh, G. Rote, M. Taschwer, and Y.-F. Xu. Triangulations intersect nicely. Discrete & Computational Geometry, 16:339-359, 1996. Special Issue. [SFB Report F003-030, TU Graz, Austria, 1995]. (Gzipped PostScript, 20 p., 116 KB).

[80]
O. Aichholzer, F. Aurenhammer, G. Rote, and Y.-F. Xu. Constant-level greedy triangulations approximate the MWT well. In Proc. 2nd Int'l. Symp. Operations Research & Applications ISORA'96, Lecture Notes in Operations Research, Cheng Du, Zhang, editor, volume 2, pages 309-318, Guilin, P. R. China, 1996. World Publishing Corporation. (Gzipped PostScript, 10 p., 60 KB).

[81]
O. Aichholzer, F. Aurenhammer, G. Rote, and Y.-F. Xu. New greedy triangulation algorithms. In Proc. 12th European Workshop on Computational Geometry CG '96, pages 11-14, Muenster, Germany, 1996. (Gzipped PostScript, 4 p., 55 KB).

[82]
O. Aichholzer and F. Aurenhammer. Classifying hyperplanes in hypercubes. SIAM Journal on Discrete Mathematics, 9(2):225-232, 1996. [IIG-Report-Series 408, TU Graz, Austria, 1995]. (Gzipped PostScript, 12 p., 73 KB).

[83]
O. Aichholzer and F. Aurenhammer. Straight skeletons for general polygonal figures. In Proc. 2nd Ann. Int'l. Computing and Combinatorics Conf. COCOON'96, Lecture Notes in Computer Science, volume 1090, pages 117-126, Hong Kong, 1996. Springer Verlag. [IIG-Report-Series 423, TU Graz, Austria, 1995]. (Gzipped PostScript, 11 p., 57 KB).

[84]
F. Aurenhammer and J. Hagauer. Recognizing binary Hamming graphs in O(n2 log n) time. Mathematical Systems Theory, 28:387-395, 1995. [IIG-Report-Series 273, TU Graz, Austria, 1989]. (Gzipped PostScript, 11 p., 56 KB).

[85]
F. Aurenhammer. Guest editor's foreword of the special issue on computational geometry. Int'l Journal of Computational Geometry & Applications, 5:1, 1995.

[86]
O. Aichholzer, F. Aurenhammer, and G. Rote. Optimal graph orientation with storage applications. SFB-Report F003-51, SFB 'Optimierung und Kontrolle', TU Graz, Austria, 1995. (Gzipped PostScript, 7 p., 59 KB).

[87]
O. Aichholzer, F. Aurenhammer, G. Rote, and M. Taschwer. Triangulations intersect nicely. In Proc. 11th Ann. ACM Symp. Computational Geometry, pages 220-229, Vancouver, Canada, 1995. (Gzipped PostScript, 10 p., 87 KB).

[88]
O. Aichholzer, D. Alberts, F. Aurenhammer, and B. Gaertner. A novel type of skeleton for polygons. Journal of Universal Computer Science, 1(12):752-761, 1995. [IIG-Report-Series 424, TU Graz, Austria, 1995]. (Gzipped PostScript, 9 p., 63 KB). Click here for the Online Version

[89]
O. Aichholzer, D. Alberts, F. Aurenhammer, and B. Gaertner. Straight skeletons of simple polygons. In Proc. 4th Int. Symp. of LIESMARS, pages 114-124, Wuhan, P. R. China, 1995. (Gzipped PostScript, 11 p., 49 KB).

[90]
F. Aurenhammer, M. Formann, R. Idury, A. Schaeffer, and F. Wagner. Faster isometric embedding in products of complete graphs. Discrete Applied Mathematics, 52:17-28, 1994. [Report B-90-06, FU Berlin, Germany, 1990]. (Gzipped PostScript, 13 p., 76 KB).

[91]
O. Aichholzer and F. Aurenhammer. Classifying hyperplanes in hypercubes. In Proc. 10th European Workshop on Computational Geometry CG '94, pages 53-57, Santander, Spain, 1994. (Gzipped PostScript, 5 p., 43 KB).

[92]
F. Aurenhammer. Geometric clustering and Voronoi-type partitions. In 16th IFIP Conf. System Modelling and Optimization, pages 93-94, Compiegne, France, 1993.

[93]
F. Aurenhammer. Voronoi diagrams -- a survey of a fundamental geometric data structure. bit acm computing surveys '91 (Japanese translation), Kyoritsu Shuppan Co., Ltd., pages 131-185, 1993.

[94]
F. Aurenhammer and G. Stoeckl. Searching for segments with largest relative overlap. In Proc. 15th IFIP Conf. System Modelling and Optimization, Lecture Notes in Control and Information Sciences, volume 180, pages 77-84, Zuerich, Switzerland, 1992. Springer Verlag.

[95]
F. Aurenhammer and G. Stoeckl. Searching for segments with largest relative overlap. Information Processing Letters, 41:103-108, 1992. [Report B 91-10, FU Berlin, Germany, 1991].

[96]
F. Aurenhammer and O. Schwarzkopf. A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams. Int'l Journal of Computational Geometry & Applications, 2:363-381, 1992. Special Issue. [Report B 91-02, FU Berlin, Germany, 1991]. (Gzipped PostScript, 18 p., 92 KB).

[97]
F. Aurenhammer, F. Hoffmann, and B. Aronov. Least-squares partitioning. In Proc. 8th European Workshop on Computational Geometry CG '92, pages 55-57, Utrecht, the Netherlands, 1992.

[98]
F. Aurenhammer, F. Hoffmann, and B. Aronov. Minkowski-type theorems and least-squares partitioning. In Proc. 8th Ann. ACM Symp. Computational Geometry, pages 350-357, Berlin, Germany, 1992. [Report B-92-09, FU Berlin, Germany, 1992].

[99]
F. Aurenhammer, J. Hagauer, and W. Imrich. Cartesian graph factorization at logarithmic cost per edge. Computational Complexity, 2:331-349, 1992.

[100]
F. Aurenhammer and J. Hagauer. Computing equivalence classes among the edges of a graph with applications. Discrete Mathematics, 109:3-12, 1992. Special Issue. [IIG-Report-Series 271, TU Graz, Austria, 1989].

[101]
F. Aurenhammer, G. Stoeckl, and E. Welzl. The post-office problem for fuzzy point sets. In Proc. 7th Workshop on Computational Geometry CG '91, Lecture Notes in Computer Science, volume 553, pages 1-11, Bern, Switzerland, 1991. Springer Verlag. [Report B 91-07, FU Berlin, Germany, 1991].

[102]
F. Aurenhammer and G. Stoeckl. On the peeper's Voronoi diagram. SIGACT News, 22(4):50-59, 1991. [IIG-Report-Series 264, TU Graz, Austria, 1988]. (Gzipped PostScript, 10 p., 64 KB).

[103]
F. Aurenhammer and O. Schwarzkopf. A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams. In Proc. 7th Ann. ACM Symp. Computational Geometry, pages 142-151, North Conway, U.S.A., 1991.

[104]
F. Aurenhammer and J. Hagauer. Recognizing binary Hamming graphs in O(n2 log n) time. In Proc. 16th Int'l Workshop on Graph-Theoretical Concepts in Computer Science, Lecture Notes in Computer Science, volume 484, pages 90-98, Berlin, Germany, 1991. Springer Verlag.

[105]
F. Aurenhammer. Using Gale transforms in computational geometry. Mathematical Programming, B 52:179-190, 1991. Special Issue. [IIG-Report-Series 248, TU Graz, Austria, 1988].

[106]
F. Aurenhammer. Voronoi diagrams -- a survey of a fundamental geometric data structure. ACM Computing Surveys, 23(3):345-405, 1991. Habilitationsschrift. [Report B 90-09, FU Berlin, Germany, 1990].

[107]
F. Aurenhammer and G. Stoeckl. Fenster - Voronoi Diagramme (Abstract). In Tagungsband DMV Jubilaeumstagung, page 52, Bremen, Germany, 1990.

[108]
F. Aurenhammer, J. Hagauer, and W. Imrich. Factoring Cartesian-product graphs at logarithmic cost per edge. In Proc. MPS Conf. Integer Programming and Combinatorial Optimization IPCO'90, pages 29-44, Waterloo, Canada, 1990. [IIG-Report-Series 287, TU Graz, Austria, 1990].

[109]
F. Aurenhammer. A new duality result concerning Voronoi diagrams. Discrete & Computational Geometry, 5(3):243-254, 1990. [IIG-Report-Series 216, TU Graz, Austria, 1985].

[110]
F. Aurenhammer. A relationship between Gale transforms and Voronoi diagrams. Discrete Applied Mathematics, 28:83-91, 1990. [IIG-Report-Series 247, TU Graz, Austria, 1988].

[111]
F. Aurenhammer and J. Hagauer. Computing equivalence classes among the edges of a graph with applications. In Proc. Int'l Conf. Algebraic Graph Theory, page 11, Leibnitz, Austria, 1989.

[112]
F. Aurenhammer and H. Imai. Geometric relations among Voronoi diagrams. Geometriae Dedicata, 27:65-75, 1988. [IIG-Report-Series 228, TU Graz, Austria, 1986].

[113]
F. Aurenhammer. Algorithmic aspects of Gale transforms (abstract). In Proc. 13th 3-Ann. Int'l Symp. Mathematical Programming, page 176, Tokyo, Japan, 1988.

[114]
F. Aurenhammer. Improved algorithms for discs and balls using power diagrams. Journal of Algorithms, 9(2):151-161, 1988. [IIG-Report-Series 209, TU Graz, Austria, 1985].

[115]
F. Aurenhammer. Linear combinations from power domains. Geometriae Dedicata, 28:45-52, 1988. [IIG-Report-Series 243, TU Graz, Austria, 1987].

[116]
F. Aurenhammer. On-line sorting of twisted sequences in linear time. BIT, 28:194-204, 1988. [IIG-Report-Series 232, TU Graz, Austria, 1987].

[117]
F. Aurenhammer. On-line sorting of twisted sequences in linear time. In 2nd Workshop on Computational Geometry and Discrete Algorithms, Osaka, Japan, 1988.

[118]
F. Aurenhammer. Using Gale transforms in computational geometry. In Proc. 4th Workshop on Computational Geometry CG '88, Lecture Notes in Computer Science, volume 333, pages 202-216, Wuerzburg, Germany, 1988. Springer Verlag.

[119]
F. Aurenhammer and H. Imai. Geometric relations among Voronoi diagrams. In Proc. 4th Ann. STACS, Lecture Notes in Computer Science, volume 247, pages 53-65, Passau, Germany, 1987. Springer Verlag.

[120]
F. Aurenhammer. A criterion for the affine equivalence of cell complexes in Rd and convex polyhedra in Rd+1. Discrete & Computational Geometry, 2(1):49-64, 1987. [IIG-Report-Series 205, TU Graz, Austria, 1985].

[121]
F. Aurenhammer. Jordan sorting via convex hulls of certain non-simple polygons. In Proc. 3rd Ann. ACM Symp. Computational Geometry, pages 21-29, Waterloo, Canada, 1987.

[122]
F. Aurenhammer. Power diagrams: properties, algorithms, and applications. SIAM Journal on Computing, 16(1):78-96, 1987. [IIG-Report-Series F120, TU Graz, Austria, 1983].

[123]
F. Aurenhammer. Recognizing polytopical cell complexes and constructing projection polyhedra. Journal of Symbolic Computation, 3(3):249-255, 1987. [IIG-Report-Series 203, TU Graz, Austria, 1985].

[124]
F. Aurenhammer. A new duality result concerning Voronoi diagrams. In Proc. 13th Ann. ICALP, Lecture Notes in Computer Science, volume 226, pages 21-32, Rennes, France, 1986. Springer Verlag.

[125]
F. Aurenhammer. The one-dimensional weighted Voronoi diagram. Information Processing Letters, 22(3):119-123, 1986. [IIG-Report-Series F110, TU Graz, Austria, 1983].

[126]
F. Aurenhammer. Gewichtete Voronoidiagramme. In Workshop on Computational Geometry CG '85, Karlsruhe, Germany, 1985.

[127]
F. Aurenhammer and H. Edelsbrunner. An optimal algorithm for constructing the weighted Voronoi diagram in the plane. Pattern Recognition, 17(2):251-257, 1984. [IIG-Report-Series F109, TU Graz, Austria, 1983].

[128]
F. Aurenhammer. Gewichtete Voronoi Diagramme: Geometrische Deutung und Konstruktions-Algorithmen. PhD thesis, IIG-TU Graz, Austria, 1984. Report B53.

[129]
F. Aurenhammer. On the generality of power diagrams. IIG Report F126, TU Graz, Austria, 1983.

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.