Log in

Relevant bibliographies by topics / Art Gallery Problems / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Art Gallery Problems.

Dissertations / Theses on the topic 'Art Gallery Problems'

Author: Grafiati

Published: 6 September 2023

Last updated: 26 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 15 dissertations / theses for your research on the topic 'Art Gallery Problems.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

姚兆明 and Siu-ming Yiu. "Tight bound edge guard results on art gallery problems." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1996. http://hub.hku.hk/bib/B31236418.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Yiu, Siu-ming. "Tight bound edge guard results on art gallery problems /." Hong Kong : University of Hong Kong, 1996. http://sunzi.lib.hku.hk/hkuto/record.jsp?B18037276.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Deshpande, Ajay A. "A pseudo-polynomial time O(log² n)-approximation algorithm for art gallery problems." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/36243.

Full text

Abstract:

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering; and, (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006.<br>Includes bibliographical references (p. 55-56).<br>In this thesis, we give a pseudo-polynomial time O(log² n)-approximation algorithm for a variant of the art gallery problem the point-guard problem. The point-guard problem involves finding the minimum number of points and their positions so that guards located at these points cover the interior of the art gallery. Our algorithm is pseudo-polyno

APA, Harvard, Vancouver, ISO, and other styles

4

Anderson, Simon. "Re-flux action : concerning the Fluxshoe exhibition tour of 1972-73, and the subsequent attempt to catalogue the residual collection, held in the Tate Gallery Archive : including general problems of performance art history which this raised." Thesis, Royal College of Art, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.600806.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Marzal, Jefri. "The three-dimensional art gallery problem and its solutions." Thesis, Marzal, Jefri (2012) The three-dimensional art gallery problem and its solutions. Professional Doctorate thesis, Murdoch University, 2012. https://researchrepository.murdoch.edu.au/id/eprint/13508/.

Full text

Abstract:

This thesis addressed the three-dimensional Art Gallery Problem (3D-AGP), a version of the art gallery problem, which aims to determine the number of guards required to cover the interior of a pseudo-polyhedron as well as the placement of these guards. This study exclusively focused on the version of the 3D-AGP in which the art gallery is modelled by an orthogonal pseudo-polyhedron, instead of a pseudo-polyhedron. An orthogonal pseudopolyhedron provides a simple yet effective model for an art gallery because of the fact that most real-life buildings and art galleries are largely orthogonal in

APA, Harvard, Vancouver, ISO, and other styles

6

Freestone, Mellor Paula. "Sir George Scharf and the problem of authenticity at the National Portrait Gallery." Thesis, University of Oxford, 2016. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.728997.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Tozoni, Davi Colli 1988. "Solving the art gallery problem = a practical and robust method for optimal point guard positioning = Resolução do problema da galeria de arte: um método prático e robusto para o posicionamento ótimo de guardas-ponto." [s.n.], 2014. http://repositorio.unicamp.br/jspui/handle/REPOSIP/275523.

Full text

Abstract:

Orientadores: Cid Carvalho de Souza, Pedro Jussieu de Rezende<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Computação<br>Made available in DSpace on 2018-08-25T16:57:43Z (GMT). No. of bitstreams: 1 Tozoni_DaviColli_M.pdf: 4212278 bytes, checksum: afb91e202a72e28729ff14334901884f (MD5) Previous issue date: 2014<br>Resumo: Nesta dissertação, apresentamos nossa pesquisa sobre o Problema da Galeria de Arte (AGP), um dos problemas mais estudados em Geometria Computacional. O AGP, que é um problema NP-difícil, consiste em encontrar o número mínimo de guardas suficien

APA, Harvard, Vancouver, ISO, and other styles

8

Ferreira, Catarina Lobo do Souto. "Algorithms for Chromatic Art Gallery Problems with Vertex α-Guards". Master's thesis, 2016. https://repositorio-aberto.up.pt/handle/10216/91025.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Ferreira, Catarina Lobo do Souto. "Algorithms for Chromatic Art Gallery Problems with Vertex α-Guards". Dissertação, 2016. https://repositorio-aberto.up.pt/handle/10216/91025.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Mehrabidavoodabadi, Saeed. "Geometric optimization problems on orthogonal polygons: hardness results and approximation algorithms." 2015. http://hdl.handle.net/1993/30984.

Full text

Abstract:

In this thesis, we design and develop new approximation algorithms and complexity results for three guarding and partitioning problems on orthogonal polygons; namely, guarding orthogonal polygons using sliding cameras, partitioning orthogonal polygons so as to minimize the stabbing number and guarding orthogonal terrains using vertex guards. We first study a variant of the well-known art gallery problem in which sliding cameras are used to guard the polygon. We consider two versions of this problem: the Minimum- Cardinality Sliding Cameras (MCSC) problem in which we want to guard P with the m

APA, Harvard, Vancouver, ISO, and other styles

11

Roy, Aniket Basu. "Approximation Algorithms for Geometric Packing and Covering Problems." Thesis, 2017. http://etd.iisc.ac.in/handle/2005/4274.

Full text

Abstract:

We study a host of geometric optimization problems that are NP-hard and design polynomial time approximation algorithms for them. More precisely, we are given a family of geometric objects and a point set, mostly in the plane, and study different variants and generalizations of Packing and Covering problems. Our objects of study are mostly family of non-piercing regions in the plane. We call a set of simple and connected regions to be non-piercing if for any pair of intersecting regions, A and B both A\B and B\A are connected regions. A set of disks, squares, half-planes are examples of non-pi

APA, Harvard, Vancouver, ISO, and other styles

12

Chou, Jyuhn-Hung, and 周俊宏. "A Rectilinear Art Gallery Problem." Thesis, 1996. http://ndltd.ncl.edu.tw/handle/94102301335277865433.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

CHEN, BO-FU, and 陳柏甫. "The rectilinear art gallery problem with fixed viewing angle." Thesis, 1989. http://ndltd.ncl.edu.tw/handle/06799222982306547317.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

LIAO, BEN-CHEN, and 廖本丞. "The minimum art gallery guarding problem for rectilinear convex polygons." Thesis, 1988. http://ndltd.ncl.edu.tw/handle/14529136752827316284.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Tian, Huamei. "Optimal placement of light fixtures for energy saving." Thesis, 2016. http://hdl.handle.net/1828/7097.

Full text

Abstract:

Energy consumption of large commercial buildings has become higher than before, and a major part of the energy is on their lighting systems. This thesis aims at reducing the energy consumption of a building's lighting system. Our solution is to minimize the total number of necessary light fixtures in a commercial building, and thus we formulate the Constrained Light Deployment Problem (CLDP). The CLDP problem is tightly related to the Art Gallery Problem (AGP), a classical problem in computational geometry that finds the minimum number of guards to monitor a polygon area. Unlike the traditiona

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!