Planning algorithms are impacting technical disciplines and industries around the world,
including robotics, computer-aided design, manufacturing, computer graphics, aerospace …

We would like to give robots the ability to position and orient parts in the plane by pushing,
particularly when the parts are too large or heavy to be grasped and lifted. Unfortunately, the …

A human observer can effortlessly identify visible portions of geometric objects present in the
environment. However, computations of visible portions of objects from a viewpoint involving …

In this paper, we present approximation algorithms for minimum vertex and edge guard
problems for polygons with or without holes with a total of n vertices. For simple polygons …

We consider the following problem: given a simple polygon \calP and a star-shaped polygon
\calV, find a point (or the set of points) in \calP from which the portion of \calP that is visible is …

The deployment of geothermal energy systems can significantly contribute to climate change
mitigation and play a part in the transition to a low carbon society. This study proposes a …

We consider the problem of localizing a robot in a known environment modeled by a simple
polygon P. We assume that the robot has a map of P but is placed at an unknown location …

Determining visibility in planar polygons and arrangements is an important subroutine for
many algorithms in computational geometry. In this paper, we report on new …

In this paper we explore some novel aspects of visibility for stationary and moving points
inside a simple polygon P. We provide a mechanism for expressing the visibility polygon …

We consider the problem [art gallery problem (AGP)] of minimizing the number of vertex
guards required to monitor an art gallery whose boundary is an n‐vertex simple polygon. In …