Optimal scan planning with enforced network connectivity for the acquisition of three-dimensional indoor models
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 …
process. This article proposes an optimization approach for computing an admissible sensor …
A practical algorithm for the viewpoint planning of terrestrial laser scanners
F Jia, DD Lichti - Geomatics, 2022 - mdpi.com
Applications using terrestrial laser scanners (TLS) have been skyrocketing in the past two
decades. In a scanning project, the configuration of scans is a critical issue as it has …
decades. In a scanning project, the configuration of scans is a critical issue as it has …
An exact algorithm for minimizing vertex guards on art galleries
MC Couto, PJ de Rezende… - … in Operational Research, 2011 - Wiley Online Library
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 …
guards required to monitor an art gallery whose boundary is an n‐vertex simple polygon. In …
Engineering art galleries
PJ de Rezende, CC de Souza, S Friedrichs… - … : Selected Results and …, 2016 - Springer
Abstract The Art Gallery Problem (AGP) is one of the most well-known problems in
Computational Geometry (CG), with a rich history in the study of algorithms, complexity, and …
Computational Geometry (CG), with a rich history in the study of algorithms, complexity, and …
Approximation algorithms for art gallery problems in polygons and terrains
SK Ghosh - International Workshop on Algorithms and …, 2010 - Springer
Approximation Algorithms for Art Gallery Problems in Polygons and Terrains Page 1
Approximation Algorithms for Art Gallery Problems in Polygons and Terrains Subir Kumar Ghosh …
Approximation Algorithms for Art Gallery Problems in Polygons and Terrains Subir Kumar Ghosh …
Exact solutions and bounds for general art gallery problems
The classical Art Gallery Problem asks for the minimum number of guards that achieve
visibility coverage of a given polygon. This problem is known to be NP-hard, even for very …
visibility coverage of a given polygon. This problem is known to be NP-hard, even for very …
A nearly optimal algorithm for covering the interior of an art gallery
A Bottino, A Laurentini - Pattern recognition, 2011 - Elsevier
The problem of locating visual sensors can be often modelled as 2D Art Gallery problems. In
particular, tasks such as surveillance require observing the interior of a polygonal …
particular, tasks such as surveillance require observing the interior of a polygonal …
Point guards and point clouds: Solving general art gallery problems
In this video, we illustrate how one of the classical areas of computational geometry has
gained in practical relevance, which in turn gives rise to new, fascinating geometric …
gained in practical relevance, which in turn gives rise to new, fascinating geometric …
The quest for optimal solutions for the art gallery problem: A practical iterative algorithm
Abstract The general Art Gallery Problem (AGP) consists in finding the minimum number of
guards sufficient to ensure the visibility coverage of an art gallery represented by a polygon …
guards sufficient to ensure the visibility coverage of an art gallery represented by a polygon …
Visiting convex regions in a polygonal map
This paper is concerned with a variant of the multi-goal path planning in which goals are
represented as convex polygons. The problem is to find a closed shortest path in a …
represented as convex polygons. The problem is to find a closed shortest path in a …