Hertel, Stefan; Mehlhorn, Kurt Fast triangulation of the plane with respect to simple polygons. (English) Zbl 0575.68049 Inf. Control 64, 52-76 (1985). MSC: 68Q25 51M20 PDFBibTeX XMLCite \textit{S. Hertel} and \textit{K. Mehlhorn}, Inf. Control 64, 52--76 (1985; Zbl 0575.68049) Full Text: DOI
Hertel, Stefan; Mäntylä, Martti; Mehlhorn, Kurt; Nievergelt, Jurg Space sweep solves intersection of convex polyhedra. (English) Zbl 0553.68034 Acta Inf. 21, 501-519 (1984). MSC: 68Q25 52A15 52Bxx 52-04 PDFBibTeX XMLCite \textit{S. Hertel} et al., Acta Inf. 21, 501--519 (1984; Zbl 0553.68034) Full Text: DOI
Hertel, Stefan; Mehlhorn, Kurt Fast triangulation of simple polygons. (English) Zbl 0521.68040 Foundations of computation theory, Proc. int. FCT-Conf., Borgholm/Swed. 1983, Lect. Notes Comput. Sci. 158, 207-218 (1983). MSC: 68Q25 51M20 PDFBibTeX XML
Becker, M.; Degenhardt, W.; Doenhardt, J.; Hertel, S.; Kaninke, G.; Keber, W.; Mehlhorn, K.; Naeher, S.; Rohnert, H.; Winter, T. A probabilistic algorithm for vertex connectivity of graphs. (English) Zbl 0491.68066 Inf. Process. Lett. 15, 135-136 (1982). MSC: 68R10 05C40 68Q25 90B10 PDFBibTeX XMLCite \textit{M. Becker} et al., Inf. Process. Lett. 15, 135--136 (1982; Zbl 0491.68066) Full Text: DOI