Halperin, Dan; Har-Peled, Sariel; Mehlhorn, Kurt; Oh, Eunjin; Sharir, Micha The maximum-level vertex in an arrangement of lines. (English) Zbl 1485.52019 Discrete Comput. Geom. 67, No. 2, 439-461 (2022). MSC: 52C30 52C45 68R05 68W05 68W40 PDFBibTeX XMLCite \textit{D. Halperin} et al., Discrete Comput. Geom. 67, No. 2, 439--461 (2022; Zbl 1485.52019) Full Text: DOI arXiv
Mehlhorn, Kurt; Sack, Jörg; Zaks, Joseph Note on the paper “K-vertex guarding simple polygons”. (English) Zbl 1168.52005 Comput. Geom. 42, No. 6-7, 722 (2009). MSC: 52A30 68U05 PDFBibTeX XMLCite \textit{K. Mehlhorn} et al., Comput. Geom. 42, No. 6--7, 722 (2009; Zbl 1168.52005) Full Text: DOI
Berberich, Eric; Eigenwillig, Arno; Hemmer, Michael; Hert, Susan; Kettner, Lutz; Mehlhorn, Kurt; Reichel, Joachim; Schmitt, Susanne; Schömer, Elmar; Wolpert, Nicola EXACUS: Efficient and exact algorithms for curves and surfaces. (English) Zbl 1162.68733 Brodal, Gerth Stølting (ed.) et al., Algorithms – ESA 2005. 13th annual European symposium, Palma de Mallorca, Spain, October 3–6, 2005. Proceedings. Berlin: Springer (ISBN 3-540-29118-0/pbk). Lecture Notes in Computer Science 3669, 155-166 (2005). MSC: 68U05 52B55 65D18 PDFBibTeX XMLCite \textit{E. Berberich} et al., Lect. Notes Comput. Sci. 3669, 155--166 (2005; Zbl 1162.68733) Full Text: DOI
Granados, Miguel; Hachenberger, Peter; Hert, Susan; Kettner, Lutz; Mehlhorn, Kurt; Seel, Michael Boolean operations on 3D selective Nef complexes: data structure, algorithms, and implementation. (English) Zbl 1266.68201 Di Battista, Giuseppe (ed.) et al., Algorithms – ESA 2003. 11th annual European symposium, Budapest, Hungary, September 16–19, 2003. Proceedings. Berlin: Springer (ISBN 3-540-20064-9/pbk). Lect. Notes Comput. Sci. 2832, 654-666 (2003). MSC: 68W05 52B55 68P05 PDFBibTeX XMLCite \textit{M. Granados} et al., Lect. Notes Comput. Sci. 2832, 654--666 (2003; Zbl 1266.68201) Full Text: DOI
Mehlhorn, Kurt; Seel, Michael Infimaximal frames: A technique for making lines look like segments. (English) Zbl 1093.68131 Int. J. Comput. Geom. Appl. 13, No. 3, 241-255 (2003). MSC: 68U05 52B55 PDFBibTeX XMLCite \textit{K. Mehlhorn} and \textit{M. Seel}, Int. J. Comput. Geom. Appl. 13, No. 3, 241--255 (2003; Zbl 1093.68131) Full Text: DOI
Mehlhorn, Kurt (ed.) Special issue: 10th ACM Symposium on Computational Geometry. Selected papers from the Symposium held in Stony Brook, New York, USA, June 6–8, 1994. (English) Zbl 1133.52300 Discrete Comput. Geom. 14, No. 4, 363-479 (1995). MSC: 52-06 68-06 00B25 52B55 68U05 PDFBibTeX XMLCite \textit{K. Mehlhorn} (ed.), Discrete Comput. Geom. 14, No. 4, 363--479 (1995; Zbl 1133.52300) Full Text: DOI
Dobrindt, Katrin; Mehlhorn, Kurt; Yvinec, Mariette A complete and efficient algorithm for the intersection of a general and a convex polyhedron. (English) Zbl 1504.68252 Dehne, Frank (ed.) et al., Algorithms and data structures. 3rd workshop, WADS ’93. Montréal, Canada 11–13, 1993. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 709, 314-324 (1993). MSC: 68U05 52B55 68P05 68W40 PDFBibTeX XMLCite \textit{K. Dobrindt} et al., Lect. Notes Comput. Sci. 709, 314--324 (1993; Zbl 1504.68252) Full Text: DOI
Mehlhorn, K.; Näher, S.; Uhrig, C. Hidden line elimination for isooriented rectangles. (English) Zbl 0697.68045 Inf. Process. Lett. 35, No. 3, 137-143 (1990). MSC: 68Q25 68U99 52A15 PDFBibTeX XMLCite \textit{K. Mehlhorn} et al., Inf. Process. Lett. 35, No. 3, 137--143 (1990; Zbl 0697.68045) Full Text: DOI DOI
Alt, Helmut; Mehlhorn, Kurt; Wagener, Hubert; Welzl, Emo Congruence, similarity, and symmetries of geometric objects. (English) Zbl 0679.68070 Discrete Comput. Geom. 3, No. 3, 237-256 (1988). MSC: 68Q25 52A20 20H15 68W99 51F99 PDFBibTeX XMLCite \textit{H. Alt} et al., Discrete Comput. Geom. 3, No. 3, 237--256 (1988; Zbl 0679.68070) Full Text: DOI EuDML
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