This survey provides an overview of popular pathfinding algorithms and techniques based
on graph generation problems. We focus on recent developments and improvements in …

Path planning constitutes one of the most crucial abilities an autonomous robot should
possess, apart from Simultaneous Localization and Mapping algorithms (SLAM) and …

Abstract Information visualization as a field is growing rapidly in popularity since the first
information visualization conference in 1995. However, as a consequence of its growth, it is …

A point visibility graph is a graph induced by a set of points in the plane, where every vertex
corresponds to a point, and two vertices are adjacent whenever the two corresponding …

Apart from perception, one of the most fundamental aspects of an autonomous mobile robot
is the ability to adequately and safely traverse the environment it operates in. This ability is …

In this column, we consider natural problems in computational geometry that are
polynomialtime equivalent to finding a real solution to a system of polynomial inequalities …

Understanding design decisions in relation to the future occupants of a building is a crucial
part of good design. However, limitations in tools and expertise hinder meaningful human …

The ArtGallery problem is a fundamental visibility problem in Computational Geometry. The
input consists of a simple polygon P,(possibly infinite) sets G and C of points within P, and …

A terrain is an $ x $-monotone polygonal line in the $ xy $-plane. Two vertices of a terrain
are mutually visible if and only if there is no terrain vertex on or above the open line segment …

Obstacle representations of graphs have been investigated quite intensely over the last few
years. We focus on graphs that can be represented by a single obstacle. Given a …