Results 21 to 30 of about 2,722 (202)

Automatic Placement of Visual Sensors in a Smart Space to Ensure Required PPM Level in Specified Regions of Interest

open access: yesSensors, 2022
This work is devoted to a cost-effective method for the automatic placement of visual sensors within a smart room to ensure the requirements for its design.
Iaroslav Khutornoi   +2 more
doaj   +1 more source

Fuzzy Model for Selecting a Form of Use Alternative for a Historic Building to be Subjected to Adaptive Reuse

open access: yesEnergies, 2020
Adapting historic buildings to new, modern forms generates not only financial benefits for developers but can also allow them to survive for future generations through proper remodelling. The variety of decision criteria related to the selection of a new
Małgorzata Fedorczak-Cisak   +6 more
doaj   +1 more source

Teachers’ Views on the Use of Photography in Teaching Arts in Croatian Primary Schools

open access: yesCenter for Educational Policy Studies Journal, 2020
Contemporary art education relies on the use of diverse methods, approaches, art techniques, and technologies. Although photography is part of daily visual communication and gallery exhibitions, there is no structured approach to photography as a medium
Nina Licul
doaj   +1 more source

Fixed k-watchman routes under the Min-Max criterion in staircase polygons [PDF]

open access: yesAUT Journal of Mathematics and Computing
In this paper, the problem of multiple watchman routes in staircase polygons is studied. The watchman route problem (WRP) is a variation of the art gallery problem (AGP) in computational geometry, where each point in the given polygon must be visible ...
Rahmat Ghasemi   +3 more
doaj   +1 more source

Smoothed Analysis of the Art Gallery Problem

open access: yesCoRR, 2018
In the Art Gallery Problem we are given a polygon $P\subset [0,L]^2$ on $n$ vertices and a number $k$. We want to find a guard set $G$ of size $k$, such that each point in $P$ is seen by a guard in $G$. Formally, a guard $g$ sees a point $p \in P$ if the line segment $pg$ is fully contained inside the polygon $P$.
Dobbins, Michael Gene   +2 more
openaire   +3 more sources

Tutela del diritto di proprieta' delle immagini digitali: Implementazione di un algoritmo di watermark mediante funzioni wavelet

open access: yesAtti della Accademia Peloritana dei Pericolanti : Classe di Scienze Fisiche, Matematiche e Naturali, 2004
Protection of copyright of the digital images is a critical element for the multimedia Web applications, e-books, virtual picture gallery. This problem is today receiving growing attention due to the pervasive diffusion of Internet technology.
Prestipino, D   +4 more
doaj   +1 more source

A Linear Objective Function-Based Heuristic for Robotic Exploration of Unknown Polygonal Environments

open access: yesFrontiers in Robotics and AI, 2018
This work presents a heuristic for describing the next best view location for an autonomous agent exploring an unknown environment. The approach considers each robot as a point mass with omnidirectional and unrestricted vision of the environment and line-
Russell Graves, Subhadeep Chakraborty
doaj   +1 more source

Facial Achromatic Number of Triangulations with Given Guarding Number

open access: yesTheory and Applications of Graphs, 2022
A (not necessarily proper) $k$-coloring $c : V(G) \rightarrow \{1,2,\dots,k\}$ of a graph $G$ on a surface is a {\em facial $t$-complete $k$-coloring} if every $t$-tuple of colors appears on the boundary of some face of $G$.
Naoki Matsumoto, Yumiko OHNO
doaj   +1 more source

Cooperative Unmanned Aerial System Reconnaissance in a Complex Urban Environment and Uneven Terrain

open access: yesSensors, 2019
Using unmanned robotic systems in military operations such as reconnaissance or surveillance, as well as in many civil applications, is common practice.
Petr Stodola   +4 more
doaj   +1 more source

Exact solutions and bounds for general art gallery problems [PDF]

open access: yesACM Journal of Experimental Algorithmics, 2010
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 restricted and discrete special cases. For the case of vertex guards and simple orthogonal polygons, Cuoto et al.
Alexander Kröller   +3 more
openaire   +1 more source

Home - About - Disclaimer - Privacy