Showing cs.CGShow all
2 papers · 1 filter
cs.CG2026
Tight Approximation Thresholds for Geometric Stabbing
Khaled Elbassioni, Rishikesh Gajjala, Saurabh Ray
We study geometric covering problems: stabbing axis-parallel squares and cubes by coordinate hyperplanes, stabbing horizontal segments by horizontal and vertical lines, and transve…
cs.CG2025
A Deterministic Bicriteria Approximation Algorithm for the Art Gallery Problem
Khaled Elbassioni
Given a polygon in the plane, the art gallery problem calls for fining the smallest set of points in from which every other point in is seen. We give a deterministic al…