Results 11 to 20 of about 2,722 (202)
An Exact and Efficient Algorithm for the Orthogonal Art Gallery Problem [PDF]
Computer Graphics and Image Processing (SIBGRAPI), Proceedings of the Brazilian Symposium on, 2007 Cid De Souza
exaly +4 more sources
A Practical Algorithm for the Viewpoint Planning of Terrestrial Laser Scanners
Geomatics, 2022 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 significant effects on the project cost and the quality of the product. In
Fengman Jia, Derek D. Lichti
doaj +1 more source
Topological Universality of the Art Gallery Problem
CoRR, 2022 We prove that any compact semi-algebraic set is homeomorphic to the solution space of some art gallery problem. Previous works have established similar universality theorems, but holding only up to homotopy equivalence, rather than homeomorphism, and prior to this work, the existence of art galleries even for simple spaces such as the Möbius strip or ...
Stade, Jack, Tucker-Foltz, Jamie
openaire +4 more sources
Invotek: Jurnal Inovasi Vokasional dan Teknologi, 2020 Tari Topeng Patih is a part of the traditional dance performance art “Wayang Topeng Malangan” with a religious background which grew up around people in Malang City, East Java. Presently, art gallery of Tari Topeng Malangan has been difficult to be found.
Bayu Ramadhani Fajri +2 more
doaj +1 more source
Art Gallery Problems for Convex Nested Polygons [PDF]
INFORMS Journal on Computing, 1997 In this article, we study a class of Art Gallery problems that are defined on a pair of convex nested polygons. Polynomial time algorithms are presented for all these problems, by reducing them to the Circle Covering problem, or by relating them to the Minimal Nested Polygon problem.
Joy Bhadury +3 more
openaire +2 more sources
Building with Time, History, and Resilience at Yale
Architectural Histories, 2019 This article examines Louis Kahn’s design for the New Yale Art Gallery as an exemplar of ‘building-in-time.’ The novel design breaks formally with then modernist-free architecture of the Yale campus, and yet complements and completes the existing ...
Marvin Trachtenberg
doaj +1 more source
Lower Bound for Sculpture Garden Problem: Localization of IoT Devices
Applied Sciences, 2023 The purpose of the current study is to investigate a special case of art gallery problem, namely a sculpture garden problem. In this problem, for a given polygon P, the ultimate goal is to place the minimum number of guards (landmarks) to define the ...
Marzieh Eskandari +2 more
doaj +1 more source
الاكاديمي, 2020 The research addresses the most important elements of the ancient Iraqi heritage represented by architecture and plastic arts being the direct means that preserved the heritage due to the ease of preserving them and the speed of circulating them and ...
Mahmmoud Hussein Abdul Rahman Hussein
doaj +1 more source
An Approximation Algorithm for the Art Gallery Problem
CoRR, 2016 25 pages, 4 pages proof ideas, many ...
Bonnet, Edouard, Miltzow, Tillmann
openaire +6 more sources
The art gallery problem is ∃ ℝ-complete
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018 The Art Gallery Problem (AGP) is a classic problem in computational geometry, introduced in 1973 by Victor Klee. Given a simple polygon 풫 and an integer k , the goal is to decide if there exists a set G of k guards within 풫 such that
Mikkel Abrahamsen +2 more
openaire +8 more sources