Given a simple polygon P, we say that two points p, q∈ P see each other if the line segment
pq is contained in P. A set of points G⊆ P is said to guard the polygon P if every point p∈ P …

We consider the algorithmic problem of finding the optimal weights and biases for a two-
layer fully connected neural network to fit a given set of data points, also known as empirical …

The positioning of laser scanners for indoor surveying is still a time and cost expensive
process. This article proposes an optimization approach for computing an admissible sensor …

Given a simple polygon $\mathcal {P} $ on $ n $ vertices, two points $ x, y $ in $\mathcal {P}
$ are said to be visible to each other if the line segment between $ x $ and $ y $ is contained …

In this paper we study the art gallery problem, which is one of the fundamental problems in
computational geometry. The objective is to place a minimum number of guards inside a …

The scanning of heritage sites is usually performed using Terrestrial Laser Scanners. A
correct planning for architectural surveys is important to obtain a complete registration of the …

In the NP-hard continuous 1.5 D Terrain Guarding Problem (TGP) we are given an $ x $-
monotone chain of line segments in $\mathbb {R}^ 2$(the terrain $ T $) and ask for the …

Given a simple polygon P on n vertices, two points x, y in P are said to be visible to each
other if the line segment between x and y is contained in P. The Point Guard Art Gallery …

A chord is a straight line within a polygon connecting two non-adjacent vertices. Given such
a chord c of a polygon, we denote by n (c) the number of vertices visible from c. The chord …

Given a simple polygon $\mathcal {P} $ on $ n $ vertices, two points $ x, y $ in $\mathcal {P}
$ are said to be visible to each other if the line segment between $ x $ and $ y $ is contained …