Добірка наукової літератури з теми "Art Gallery Problems"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Art Gallery Problems".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Art Gallery Problems"
Fekete, Sándor P., Stephan Friedrichs, Alexander Kröller, and Christiane Schmidt. "Facets for Art Gallery Problems." Algorithmica 73, no. 2 (December 14, 2014): 411–40. http://dx.doi.org/10.1007/s00453-014-9961-x.
Повний текст джерелаLee, D., and A. Lin. "Computational complexity of art gallery problems." IEEE Transactions on Information Theory 32, no. 2 (March 1986): 276–82. http://dx.doi.org/10.1109/tit.1986.1057165.
Повний текст джерелаBonnet, Édouard, and Tillmann Miltzow. "Parameterized Hardness of Art Gallery Problems." ACM Transactions on Algorithms 16, no. 4 (September 25, 2020): 1–23. http://dx.doi.org/10.1145/3398684.
Повний текст джерелаBhadury, J., V. Chandru, A. Maheshwari, and R. Chandrasekaran. "Art Gallery Problems for Convex Nested Polygons." INFORMS Journal on Computing 9, no. 1 (February 1997): 100–110. http://dx.doi.org/10.1287/ijoc.9.1.100.
Повний текст джерелаGhosh, Subir Kumar. "Approximation algorithms for art gallery problems in polygons." Discrete Applied Mathematics 158, no. 6 (March 2010): 718–22. http://dx.doi.org/10.1016/j.dam.2009.12.004.
Повний текст джерелаSchuchardt, Dietmar, and Hans-Dietrich Hecker. "Two NP-Hard Art-Gallery Problems for Ortho-Polygons." Mathematical Logic Quarterly 41, no. 2 (1995): 261–67. http://dx.doi.org/10.1002/malq.19950410212.
Повний текст джерелаO’Rourke, Joseph. "COMPUTATIONAL GEOMETRY COLUMN 15." International Journal of Computational Geometry & Applications 02, no. 02 (June 1992): 215–17. http://dx.doi.org/10.1142/s0218195992000135.
Повний текст джерелаO'ROURKE, JOSEPH. "COMPUTATIONAL GEOMETRY COLUMN 48." International Journal of Computational Geometry & Applications 17, no. 04 (August 2007): 397–99. http://dx.doi.org/10.1142/s0218195907002409.
Повний текст джерелаYuliana, Rachma, and Novita Rifatul Khirom. "PENGARUH MOTIVASI, KEMAMPUAN DAN KOMITMEN KERJA TERHADAP KINERJA KARYAWAN PADA PERUSAHAAN MEUBLE BASUKI LACASA ART GALLERY SINGOSARI-MALANG." Manajemen & Bisnis Jurnal 6, no. 1 (April 12, 2020): 16–30. http://dx.doi.org/10.37303/embeji.v6i1.96.
Повний текст джерелаAbrahamsen, Mikkel, Anna Adamaszek та Tillmann Miltzow. "The Art Gallery Problem is ∃ℝ-complete". Journal of the ACM 69, № 1 (28 лютого 2022): 1–70. http://dx.doi.org/10.1145/3486220.
Повний текст джерелаДисертації з теми "Art Gallery Problems"
姚兆明 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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерелаIncludes bibliographical references (p. 55-56).
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-polynomial in the sense that it is polynomial in the number of walls of the art gallery but is possibly exponential in the number of bits required to represent the positions of the vertices of the art gallery. Our approach involves reducing the point-guard problem to a new problem of choosing a minimum number of guard-locations from a finite set obtained by a special subdivision procedure. The new problem has the optimal solution at most three times the optional solution of the point-guard problem. We further reduce the new problem to the set cover problem and obtain an approximate solution to the set cover problem.
by Ajay A. Deshpande.
S.M.
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.
Повний текст джерела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/.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерелаDissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Computação
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
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 suficiente para garantir a cobertura visual de uma galeria de arte representada por um polígono. Na versão do problema tratada neste trabalho, usualmente chamada de Problema da Galeria de Arte com Guardas-Ponto, os guardas podem ser posicionados em qualquer lugar do polígono e o objetivo é cobrir toda a região, que pode ou não conter buracos. Nós estudamos como aplicar conceitos e algoritmos de Geometria Computacional, bem como Técnicas de Programação Inteira, com a finalidade de resolver o AGP de forma exata. Este trabalho culminou na criação de um novo algoritmo para o AGP, cuja ideia é gerar, de forma iterativa, limitantes superiores e inferiores para o problema através da resolução de versões discretizadas do AGP, que são reduzidas a instâncias do Problema de Cobertura de Conjuntos. O algoritmo foi implementado e testado em mais de 2800 instâncias, de diferentes tamanhos e classes. A técnica foi capaz de resolver, em minutos, mais de 90% de todas as instâncias consideradas, incluindo polígonos com milhares de vértices, e ampliou em muito o conjunto de casos para os quais são conhecidas soluções exatas. Até onde sabemos, apesar do extensivo estudo do AGP nas últimas quatro décadas, nenhum outro algoritmo demonstrou a capacidade de resolver o AGP de forma tão eficaz como a técnica aqui descrita
Abstract: In this dissertation, we present our research on the Art Gallery Problem (AGP), one of the most investigated problems in Computational Geometry. The AGP, which is a known NP-hard problem, consists in finding the minimum number of guards sufficient to ensure the visibility coverage of an art gallery represented as a polygon. In the version of the problem treated in this work, usually called Art Gallery Problem with Point Guards, the guards can be placed anywhere in the polygon and the objective is to cover the whole region, which may or not have holes. We studied how to apply Computational Geometry concepts and algorithms as well as Integer Programming techniques in order to solve the AGP to optimality. This work culminated in the creation of a new algorithm for the AGP, whose idea is to iteratively generate upper and lower bounds for the problem through the resolution of discretized versions of the AGP, which are reduced to instances of the Set Cover Problem. The algorithm was implemented and tested on more than 2800 instances of different sizes and classes of polygons. The technique was able to solve in minutes more than 90% of all instances considered, including polygons with thousands of vertices, greatly increasing the set of instances for which exact solutions are known. To the best of our knowledge, in spite of the extensive study of the AGP in the last four decades, no other algorithm has shown the ability to solve the AGP as effectively as the one described here
Mestrado
Ciência da Computação
Mestre em Ciência da Computação
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.
Повний текст джерела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.
Повний текст джерелаMehrabidavoodabadi, Saeed. "Geometric optimization problems on orthogonal polygons: hardness results and approximation algorithms." 2015. http://hdl.handle.net/1993/30984.
Повний текст джерелаFebruary 2016
Книги з теми "Art Gallery Problems"
Street gallery. Los Angeles, CA: RJD Enterprises, 1993.
Знайти повний текст джерелаCoe, Mandy. Sue Coe: Police state : Anderson Gallery/School of the Arts, Virginia Commonwealth University, Richmond, Virginia, January 20-February 28, 1987 ... Richmond, Va: Anderson Gallery, Virginia Commonwealth University, 1987.
Знайти повний текст джерелаItaly), Aperto '93 (Venice. Aperto '93: Emergency/emergenza : Flash art international. Milan: Giancarlo Politi Editore, 1993.
Знайти повний текст джерелаMutu, Wangechi, and Art Gallery of Ontario, eds. Wangechi Mutu: This you call civilization? Toronto: Art Gallery of Ontario, 2010.
Знайти повний текст джерелаPriester, Mary. Inner visions: German prints from the age of expressionism. Portland, Or: Portland Art Museum, 1991.
Знайти повний текст джерелаTreuherz, Julian. Hard times: Social realism in Victorian art. London: Lund Humphries in association with Manchester City Art Galleries, and Moyer Bell, Mt. Kisco, New York, 1987.
Знайти повний текст джерелаNational Museum and Art Gallery (Port of Spain, Trinidad and Tobago), ed. Eye Hayti ... cries ... everywhere. Port of Spain, Trinidad and Tobago: Legacy House, 2015.
Знайти повний текст джерелаGalleria nazionale di Palazzo Spinola., Comitato nazionale per le celebrazioni del V centenario della nascita di Raffaello., Italy. Ministero per i beni culturali e ambientali., and Industria italiana petroli, eds. Raffaello e la cultura raffaellesca in Liguria: Interventi di restauro, problemi di conservazione e fruizione : Genova, Galleria nazionale di Palazzo Spinola, Piazza di pellicceria, 7 dicembre-11 marzo. [Genova]: Stringa, 1985.
Знайти повний текст джерелаKontova, Helena, and Achille Bonito Oliva. Aperto'93 Emergency/Emergenza (Flash Art International). Giancarlo Politi Dist Srl, 1994.
Знайти повний текст джерелаTreuherz, Julian. Hard Times: Social Realism in Victorian Art. Lund Humphries Publishers, 1993.
Знайти повний текст джерелаЧастини книг з теми "Art Gallery Problems"
Fekete, Sándor P., Stephan Friedrichs, Alexander Kröller, and Christiane Schmidt. "Facets for Art Gallery Problems." In Lecture Notes in Computer Science, 208–20. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38768-5_20.
Повний текст джерелаLee, D. T., and Arthur K. Lin. "Computational Complexity of Art Gallery Problems." In Autonomous Robot Vehicles, 303–9. New York, NY: Springer New York, 1990. http://dx.doi.org/10.1007/978-1-4613-8997-2_23.
Повний текст джерелаBandyapadhyay, Sayan, and Aniket Basu Roy. "Effectiveness of Local Search for Art Gallery Problems." In Lecture Notes in Computer Science, 49–60. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-62127-2_5.
Повний текст джерелаBaumgartner, Tobias, Sándor P. Fekete, Alexander Kröller, and Christiane Schmidt. "Exact Solutions and Bounds for General Art Gallery Problems." In 2010 Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments (ALENEX), 11–22. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2010. http://dx.doi.org/10.1137/1.9781611972900.2.
Повний текст джерелаKrishnaswamy, R. P., and C. E. Kim. "Problems of posting sentries: Variations on the art gallery theorem." In SWAT 88, 74–85. Berlin, Heidelberg: Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/3-540-19487-8_8.
Повний текст джерелаGhosh, Subir Kumar. "Approximation Algorithms for Art Gallery Problems in Polygons and Terrains." In WALCOM: Algorithms and Computation, 21–34. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11440-3_3.
Повний текст джерелаCzyzowicz, J., E. Rivera-Campo, N. Santoro, J. Urrutia, and J. Zaks. "Tight bounds for the rectangular art gallery problem." In Graph-Theoretic Concepts in Computer Science, 105–12. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/3-540-55121-2_10.
Повний текст джерелаHoffmann, Frank, and Michael Kaufmann. "On the rectilinear art gallery problem algorithmic aspects." In Graph-Theoretic Concepts in Computer Science, 239–50. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/3-540-53832-1_46.
Повний текст джерелаKröller, Alexander, Mahdi Moeini, and Christiane Schmidt. "A Novel Efficient Approach for Solving the Art Gallery Problem." In WALCOM: Algorithms and Computation, 5–16. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-36065-7_3.
Повний текст джерелаZambon, Maurício J. O., Pedro J. de Rezende, and Cid C. de Souza. "An Exact Algorithm for the Discrete Chromatic Art Gallery Problem." In Experimental Algorithms, 59–73. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-07959-2_6.
Повний текст джерелаТези доповідей конференцій з теми "Art Gallery Problems"
Ploşniţă, Elena. "Folk art gallery — an eff ective means of promoting traditional culture." In Simpozion internațional de etnologie: Tradiții și procese etnice, Ediția III. Institute of Cultural Heritage, Republic of Moldova, 2023. http://dx.doi.org/10.52603/9789975841733.12.
Повний текст джерелаJohnson, Bruce, Vatana An, and Jason Isaacs. "Parallel photon mapping computations to enable fast approximate solutions to the art gallery and watchman route problems." In 2015 IEEE Applied Imagery Pattern Recognition Workshop (AIPR). IEEE, 2015. http://dx.doi.org/10.1109/aipr.2015.7444524.
Повний текст джерелаAbrahamsen, Mikkel, Anna Adamaszek та Tillmann Miltzow. "The art gallery problem is ∃ ℝ-complete". У STOC '18: Symposium on Theory of Computing. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3188745.3188868.
Повний текст джерелаCouto, Marcelo C., Pedro J. de Rezende, and Cid C. de Souza. "An IP solution to the art gallery problem." In the 25th annual symposium. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1542362.1542378.
Повний текст джерелаRana, Sanjay. "Two approximate solutions to the Art Gallery Problem." In ACM SIGGRAPH 2004 Posters. New York, New York, USA: ACM Press, 2004. http://dx.doi.org/10.1145/1186415.1186491.
Повний текст джерелаBärtschi, Andreas, Subir Kumar Ghosh, Matúš Mihalák, Thomas Tschager, and Peter Widmayer. "Improved bounds for the conflict-free chromatic art gallery problem." In Annual Symposium. New York, New York, USA: ACM Press, 2014. http://dx.doi.org/10.1145/2582112.2582117.
Повний текст джерелаCouto, Marcelo C., Cid C. de Souza, and Pedro J. de Rezende. "An Exact and Efficient Algorithm for the Orthogonal Art Gallery Problem." In XX Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI 2007). IEEE, 2007. http://dx.doi.org/10.1109/sibgra.2007.4368172.
Повний текст джерелаCouto, Marcelo C., Cid C. de Souza, and Pedro J. deR ezende. "An Exact and Efficient Algorithm for the Orthogonal Art Gallery Problem." In 2007 20th Brazilian Symposium on Computer Graphics and Image Processing - SIBGRAPI '07. IEEE, 2007. http://dx.doi.org/10.1109/sibgrapi.2007.15.
Повний текст джерелаAlihodzic, Adis, Sead Delalić, and Damir Hasic. "An Exact Two-Phase Method For Optimal Camera Placement In Art Gallery Problem." In 2020 Federated Conference on Computer Science and Information Systems. IEEE, 2020. http://dx.doi.org/10.15439/2020f79.
Повний текст джерелаTerhar, Fynn, and Christian Icking. "The Sectional Art Gallery and an Evolutionary Algorithm for Approaching Its Minimum Point Guard Problem." In 2021 IEEE Congress on Evolutionary Computation (CEC). IEEE, 2021. http://dx.doi.org/10.1109/cec45853.2021.9504843.
Повний текст джерела