Mehlhorn, Kurt; Näher, Stefan; Seel, Michael; Seidel, Raimund; Schilz, Thomas; Schirra, Stefan; Uhrig, Christian Checking geometric programs or verification of geometric structures. (English) Zbl 0922.68123 Comput. Geom. 12, No. 1-2, 85-103 (1999). MSC: 68U05 PDFBibTeX XMLCite \textit{K. Mehlhorn} et al., Comput. Geom. 12, No. 1--2, 85--103 (1999; Zbl 0922.68123) Full Text: DOI
Mehlhorn, K.; Müller, M.; Näher, S.; Schirra, S.; Seel, M.; Uhrig, C.; Ziegler, J. A computational basis for higher-dimensional computational geometry and applications. (English) Zbl 0905.68162 Comput. Geom. 10, No. 4, 289-303 (1998). MSC: 68U05 PDFBibTeX XMLCite \textit{K. Mehlhorn} et al., Comput. Geom. 10, No. 4, 289--303 (1998; Zbl 0905.68162) Full Text: DOI
Mehlhorn, K.; Sundar, R.; Uhrig, C. Maintaining dynamic sequences under equality tests in polylogarithmic time. (English) Zbl 0865.68034 Algorithmica 17, No. 2, 183-198 (1997). MSC: 68P05 PDFBibTeX XMLCite \textit{K. Mehlhorn} et al., Algorithmica 17, No. 2, 183--198 (1997; Zbl 0865.68034) Full Text: DOI
Dietz, P.; Mehlhorn, K.; Raman, R.; Uhrig, C. Lower bounds for set intersection queries. (English) Zbl 0833.68037 Algorithmica 14, No. 2, 154-168 (1995). MSC: 68P05 68W10 PDFBibTeX XMLCite \textit{P. Dietz} et al., Algorithmica 14, No. 2, 154--168 (1995; Zbl 0833.68037) Full Text: DOI
Mehlhorn, K.; Sundar, R.; Uhrig, C. Maintaining dynamic sequences under equality-tests in polylogarithmic time. (English) Zbl 0873.68038 Proceedings of the 5th annual ACM-SIAM symposium on discrete algorithms, Arlington, VA, USA, January 23-25, 1994. New York, NY: ACM, 213-222 (1994). MSC: 68P05 PDFBibTeX XMLCite \textit{K. Mehlhorn} et al., in: Proceedings of the 5th annual ACM-SIAM symposium on discrete algorithms, SODA '94, Arlington, VA, USA, January 23--25, 1994. New York, NY: ACM; Philadelphia, PA: SIAM. 213--222 (1994; Zbl 0873.68038)
Dietz, Paul; Mehlhorn, Kurt; Raman, Rajeev; Uhrig, Christian Lower bounds for set intersection queries. (English) Zbl 0801.68042 Ramachandran, Vijaya (ed.), Discrete algorithms. Proceedings of the 4th annual ACM-SIAM symposium, held at Austin, TX, USA, January 25-27, 1993. Philadelphia, PA: SIAM. 194-201 (1993). MSC: 68P20 68Q25 PDFBibTeX XMLCite \textit{P. Dietz} et al., in: Discrete algorithms. Proceedings of the 4th annual ACM-SIAM symposium, held at Austin, TX, USA, January 25-27, 1993. Philadelphia, PA: SIAM. 194--201 (1993; Zbl 0801.68042)
Alt, Helmut; Fleischer, Rudolf; Kaufmann, Michael; Mehlhorn, Kurt; Näher, Stefan; Schirra, Stefan; Uhrig, Christian Approximate motion planning and the complexity of the boundary of the union of simple geometric figures. (English) Zbl 0760.68082 Algorithmica 8, No. 5-6, 391-406 (1992). Reviewer: N.Korneenko (Bialystok) MSC: 68U05 68Q25 PDFBibTeX XMLCite \textit{H. Alt} et al., Algorithmica 8, No. 5--6, 391--406 (1992; Zbl 0760.68082) Full Text: DOI
Mehlhorn, K.; Paul, W. J.; Uhrig, C. \(k\) versus \(k+1\) index registers and modifiable versus non-modifiable programs. (English) Zbl 0755.68046 Inf. Comput. 101, No. 1, 123-129 (1992). MSC: 68Q05 68Q25 PDFBibTeX XMLCite \textit{K. Mehlhorn} et al., Inf. Comput. 101, No. 1, 123--129 (1992; Zbl 0755.68046) 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