Abstract: We will discuss three topics in Computational Geometry that have received significant attention from the perspective of Parameterized Complexity in the past few years. First, we will consider visibility

problems, focusing on Art Gallery and Terrain Guarding. Second, we will consider the design of subexponential parameterized algorithms for problems on geometric intersection graphs, particularly (unit) disk graphs. Lastly, we will discuss parameterized graph drawing problems, with emphasis on crossing minimization. For each topic, we will briefly discuss some basics, related works, and technical details of a selected result in that area.