Mark Keil

Papers

Total Citations

H-Index

About

Mark Keil is a prominent researcher in computational geometry, with a particular focus on polygon covering and decomposition problems. His most cited work, "On covering orthogonal polygons with star-shaped polygons" (1992, 18 citations), introduced foundational algorithms for partitioning rectilinear shapes into minimal sets of star-shaped components—a problem with applications in VLSI design, robotics, and geographic information systems. Keil’s contributions lie in developing efficient geometric algorithms that balance theoretical rigor with practical utility, advancing the understanding of visibility and coverage in planar environments. While his citation count reflects the specialized nature of his field, his work has been instrumental in shaping subsequent research on polygon partitioning and optimization. Keil’s achievements include co-authoring seminal papers on minimum-link paths and guarding problems, and his research continues to influence both algorithmic theory and applied geometry. For students and researchers, his work exemplifies how elegant geometric insights can solve complex real-world challenges, making him a respected figure in the computational geometry community.