Relevant bibliographies by topics / Art Gallery Problems

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Art Gallery Problems'

Author: Grafiati
Published: 6 September 2023
Last updated: 18 June 2025

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Journal articles on the topic "Art Gallery Problems"

1

Fekete, Sándor P., Stephan Friedrichs, Alexander Kröller, and Christiane Schmidt. "Facets for Art Gallery Problems." Algorithmica 73, no. 2 (2014): 411–40. http://dx.doi.org/10.1007/s00453-014-9961-x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Lee, D., and A. Lin. "Computational complexity of art gallery problems." IEEE Transactions on Information Theory 32, no. 2 (1986): 276–82. http://dx.doi.org/10.1109/tit.1986.1057165.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Bonnet, Édouard, and Tillmann Miltzow. "Parameterized Hardness of Art Gallery Problems." ACM Transactions on Algorithms 16, no. 4 (2020): 1–23. http://dx.doi.org/10.1145/3398684.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bhadury, J., V. Chandru, A. Maheshwari, and R. Chandrasekaran. "Art Gallery Problems for Convex Nested Polygons." INFORMS Journal on Computing 9, no. 1 (1997): 100–110. http://dx.doi.org/10.1287/ijoc.9.1.100.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ghosh, Subir Kumar. "Approximation algorithms for art gallery problems in polygons." Discrete Applied Mathematics 158, no. 6 (2010): 718–22. http://dx.doi.org/10.1016/j.dam.2009.12.004.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

O’Rourke, Joseph. "COMPUTATIONAL GEOMETRY COLUMN 15." International Journal of Computational Geometry & Applications 02, no. 02 (1992): 215–17. http://dx.doi.org/10.1142/s0218195992000135.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

O'ROURKE, JOSEPH. "COMPUTATIONAL GEOMETRY COLUMN 48." International Journal of Computational Geometry & Applications 17, no. 04 (2007): 397–99. http://dx.doi.org/10.1142/s0218195907002409.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

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 (2020): 16–30. http://dx.doi.org/10.37303/embeji.v6i1.96.

Full text
Abstract:
The role of human resources in the organization is very important, because it is natural if the management give more attention through the policies that has been taken. Currently many problems that arise related to employment, especially employee performance, therefore the problems relating to performance need to be resolved. Motivation is a condition or energy that moves employees directed to achieve the goals of the company organization. besides motivation, another thing that can affect performance is ability, by having the appropriate ability in the field of work that he does, then he can work better. While employee performance in general is influenced by two main factors, namely the ability and driving force or what is called motivation. The purpose of this study were: 1) describing the motivation, work ability, commitment and performance employers at the Meuble Basuki Lacasa Art Gallery Singosari-Malang. 2) analayzing the influences of motivation, work ability, and commitment employer performance at the Meuble Basuki Lacasa Art Gallery Singosari-Malang Company. And 3) analyzing the dominant influences of Motivation, Ability and Work Commitment on Employee Performance at Singosari-Malang Meuble Basuki Lacasa Art Gallery. The analysis method used in this research was descriptive analysis. The results of his research were: 1) Motivation, work ability and commitment of employer simultaneously have a significant effect on the performance of employer at Meuble Basuki Lacasa Art Gallery Singosari Malang, and 2) Based on the results of the t test shown that motivation, work ability and employee commitment simultaneously have a significant effect on employee performance at Meuble Basuki Lacasa Art Gallery Singosari Malang, while the variable that has a dominant influence on employee performance were motivation.
 Key Word : Motivation, Work Ability, Komitmen dan Commitment of Employer
APA, Harvard, Vancouver, ISO, and other styles
10

Abrahamsen, Mikkel, Anna Adamaszek та Tillmann Miltzow. "The Art Gallery Problem is ∃ℝ-complete". Journal of the ACM 69, № 1 (2022): 1–70. http://dx.doi.org/10.1145/3486220.

Full text
Abstract:
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 every point p ∈ 풫 is seen by at least one guard g ∈ G . Each guard corresponds to a point in the polygon 풫, and we say that a guard g sees a point p if the line segment pg is contained in 풫. We prove that the AGP is ∃ ℝ-complete, implying that (1) any system of polynomial equations over the real numbers can be encoded as an instance of the AGP, and (2) the AGP is not in the complexity class NP unless NP = ∃ ℝ. As a corollary of our construction, we prove that for any real algebraic number α, there is an instance of the AGP where one of the coordinates of the guards equals α in any guard set of minimum cardinality. That rules out many natural geometric approaches to the problem, as it shows that any approach based on constructing a finite set of candidate points for placing guards has to include points with coordinates being roots of polynomials with arbitrary degree. As an illustration of our techniques, we show that for every compact semi-algebraic set S ⊆ [0, 1] 2 , there exists a polygon with corners at rational coordinates such that for every p ∈ [0, 1] 2 , there is a set of guards of minimum cardinality containing p if and only if p ∈ S . In the ∃ ℝ-hardness proof for the AGP, we introduce a new ∃ ℝ-complete problem ETR-INV. We believe that this problem is of independent interest, as it has already been used to obtain ∃ ℝ-hardness proofs for other problems.
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Art Gallery Problems"

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-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.<br>by Ajay A. Deshpande.<br>S.M.
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 shape. Thus far, the existing solutions to the 3D-AGP employ mobile guards, in which each mobile guard is allowed to roam over an entire interior face or edge of a simple orthogonal polyhedron. In many realword applications including the monitoring an art gallery, mobile guards are not always adequate. For instance, surveillance cameras are usually installed at fixed locations. The guard placement method proposed in this thesis addresses such limitations. It uses fixedpoint guards inside an orthogonal pseudo-polyhedron. This formulation of the art gallery problem is closer to that of the classical art gallery problem. The use of fixed-point guards also makes our method applicable to wider application areas. Furthermore, unlike the existing solutions which are only applicable to simple orthogonal polyhedra, our solution applies to orthogonal pseudo-polyhedra, which is a super-class of simple orthogonal polyhedron. In this thesis, a general solution to the guard placement problem for 3D-AGP on any orthogonal pseudo-polyhedron has been presented. This method is the first solution known so far to fixed-point guard placement for orthogonal pseudo-polyhedron. Furthermore, it has been shown that the upper bound for the number of fixed-point guards required for covering any orthogonal polyhedron having n vertices is (n3/2), which is the lowest upper bound known so far for the number of fixed-point guards for any orthogonal polyhedron. This thesis also provides a new way to characterise the type of a vertex in any orthogonal pseudo-polyhedron and has conjectured a quantitative relationship between the numbers of vertices with different vertex configurations in any orthogonal pseudo-polyhedron. This conjecture, if proved to be true, will be useful for gaining insight into the structure of any orthogonal pseudo-polyhedron involved in many 3-dimensional computational geometrical problems. Finally the thesis has also described a new method for splitting orthogonal polygon iv using a polyline and a new method for splitting an orthogonal polyhedron using a polyplane. These algorithms are useful in applications such as metal fabrication.
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 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<br>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<br>Mestrado<br>Ciência da Computação<br>Mestre em Ciência da Computação
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 minimum number of sliding cameras, and the Minimum-Length Sliding Cameras (MLSC) problem in which the goal is to compute a set S of sliding cameras for guarding P so as to minimize the total length of trajectories along which the cameras in S travel. We answer questions posed by Katz and Morgenstern (2011) by presenting the following results: (i) the MLSC problem is polynomially tractable even for orthogonal polygons with holes, (ii) the MCSC problem is NP-complete when P is allowed to have holes, and (iii) an O(n)-time exact algorithm for the MCSC problem on monotone polygons. We then study a conforming variant of the problem of computing a partition of an orthogonal polygon P into rectangles whose stabbing number is minimum over all such partitions of P. The stabbing number of such a partition is the maximum number of rectangles intersected by any orthogonal line segment inside the polygon. In this thesis, we first give an O(n log n)-time algorithm that solves this problem exactly on histograms. We then show that the problem is NP-hard for orthogonal polygons with holes, providing the first hardness result for this problem. To complement the NP-hardness result, we give a 2-approximation algorithm for the problem on both polygons with and without holes. Finally, we study a variant of the terrain guarding problem on orthogonal terrains in which the objective is to guard the vertices of an orthogonal terrain with the minimum number of vertex guards. We give a linear-time algorithm for this problem under a directed visibility constraint.<br>February 2016
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Art Gallery Problems"

1

Street gallery. RJD Enterprises, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Coe, Mandy. Sue Coe: Police state : Anderson Gallery/School of the Arts, Virginia Commonwealth University, Richmond, Virginia, January 20-February 28, 1987 ... Anderson Gallery, Virginia Commonwealth University, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Italy), Aperto '93 (Venice. Aperto '93: Emergency/emergenza : Flash art international. Giancarlo Politi Editore, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Mutu, Wangechi, and Art Gallery of Ontario, eds. Wangechi Mutu: This you call civilization? Art Gallery of Ontario, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Priester, Mary. Inner visions: German prints from the age of expressionism. Portland Art Museum, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Treuherz, Julian. Hard times: Social realism in Victorian art. Lund Humphries in association with Manchester City Art Galleries, and Moyer Bell, Mt. Kisco, New York, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

National Museum and Art Gallery (Port of Spain, Trinidad and Tobago), ed. Eye Hayti ... cries ... everywhere. Legacy House, 2015.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

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. Stringa, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kontova, Helena, and Achille Bonito Oliva. Aperto'93 Emergency/Emergenza (Flash Art International). Giancarlo Politi Dist Srl, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Treuherz, Julian. Hard Times: Social Realism in Victorian Art. Lund Humphries Publishers, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Art Gallery Problems"

1

Fekete, Sándor P., Stephan Friedrichs, Alexander Kröller, and Christiane Schmidt. "Facets for Art Gallery Problems." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38768-5_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Lee, D. T., and Arthur K. Lin. "Computational Complexity of Art Gallery Problems." In Autonomous Robot Vehicles. Springer New York, 1990. http://dx.doi.org/10.1007/978-1-4613-8997-2_23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Bandyapadhyay, Sayan, and Aniket Basu Roy. "Effectiveness of Local Search for Art Gallery Problems." In Lecture Notes in Computer Science. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-62127-2_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

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). Society for Industrial and Applied Mathematics, 2010. http://dx.doi.org/10.1137/1.9781611972900.2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Krishnaswamy, R. P., and C. E. Kim. "Problems of posting sentries: Variations on the art gallery theorem." In SWAT 88. Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/3-540-19487-8_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ghosh, Subir Kumar. "Approximation Algorithms for Art Gallery Problems in Polygons and Terrains." In WALCOM: Algorithms and Computation. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11440-3_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

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. Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/3-540-55121-2_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Hoffmann, Frank, and Michael Kaufmann. "On the rectilinear art gallery problem algorithmic aspects." In Graph-Theoretic Concepts in Computer Science. Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/3-540-53832-1_46.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kröller, Alexander, Mahdi Moeini, and Christiane Schmidt. "A Novel Efficient Approach for Solving the Art Gallery Problem." In WALCOM: Algorithms and Computation. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-36065-7_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

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. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-07959-2_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Art Gallery Problems"

1

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.

Full text
Abstract:
Traditional culture is an important element of the Romanian identity. Th ere are dozens of concepts and defi nitions for traditional culture; even any culture can be considered traditional. No matter how we defi ne it, one thing is certain: in the era of globalization, it must be protected, because traditional culture, with its inherent changes, continues to exist, and society is called upon to promote it. In this article, the author touches upon the issue of promoting traditional art by organizing folk art galleries in the form of sales exhibitions. Art galleries are a modern solution for promoting the values of folk art, and their creation would solve several problems: — make a signifi cant contribution to the development of traditional culture through an exhibition approach; — promote authentic traditional culture in the country and abroad; — solve a number of problems related to the sale of traditional art works of folk craft smen; — facilitate the process of studying and learning about traditional culture through organizing some workshops and seminars within them.
APA, Harvard, Vancouver, ISO, and other styles
2

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Abrahamsen, Mikkel, Anna Adamaszek та Tillmann Miltzow. "The art gallery problem is ∃ ℝ-complete". У STOC '18: Symposium on Theory of Computing. ACM, 2018. http://dx.doi.org/10.1145/3188745.3188868.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

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. ACM Press, 2009. http://dx.doi.org/10.1145/1542362.1542378.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Rana, Sanjay. "Two approximate solutions to the Art Gallery Problem." In ACM SIGGRAPH 2004 Posters. ACM Press, 2004. http://dx.doi.org/10.1145/1186415.1186491.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

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. ACM Press, 2014. http://dx.doi.org/10.1145/2582112.2582117.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

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.

Full text
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!

To the bibliography