Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Erick Solís-Villarreal"'
Autor:
Jose Luis Álvarez-Rebollar, Jorge Urrutia, Juan C. Catana-Salazar, Erick Solís-Villarreal, N. Marín, Carlos Velarde, Israel Aldana-Galván
Publikováno v:
Graphs and Combinatorics. 36:617-630
We consider two variants of the Art Gallery Problem: illuminating orthotrees with a minimum set of vertex lights, and covering orthotrees with a minimum set of vertex beacons. An orthotree P is a simply connected orthogonal polyhedron that is the uni
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ee71ea98f4cd65b1c7ffe5a0ecb4d3e1
https://doi.org/10.1007/s00373-020-02141-4
https://doi.org/10.1007/s00373-020-02141-4
Autor:
Juan C. Catana-Salazar, Jose Luis Álvarez-Rebollar, Jorge Urrutia, Erick Solís-Villarreal, Mazay Jimenez-Salinas, Israel Aldana-Galván
Publikováno v:
Information Processing Letters. 143:47-50
In this paper we characterize the set of orthogonal polyhedra in R 3 that minimize the sum of their internal solid angles. To prove our result, we first generalize the well known result that any orthogonal polygon in the plane with n vertices has ( n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::70593df2bde744141856ecb23f9f9e4d
https://doi.org/10.1016/j.ipl.2018.11.008
https://doi.org/10.1016/j.ipl.2018.11.008
Autor:
J. Cravioto-Lagos, Jose Luis Álvarez-Rebollar, Erick Solís-Villarreal, Jorge Urrutia, N. Marín
Publikováno v:
Information Processing Letters. 175:106228
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cd348bd5b37066f8cd919ed823bed78d
https://doi.org/10.1016/j.ipl.2021.106228
https://doi.org/10.1016/j.ipl.2021.106228
Autor:
C. Alegría, Israel Aldana-Galván, Jose Luis Álvarez-Rebollar, Jorge Urrutia, Erick Solís-Villarreal, Carlos Velarde, N. Marín
Publikováno v:
Computational Geometry. 90:101656
A witness set W in a polygon P is a subset of P such that any set G ⊂ P that guards W is guaranteed to guard P. We study the problem of finding a minimum witness set for an orthogonal polygon under three models of orthogonal visibility. It is known
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0186711d609e3931156653d625fb563f
https://doi.org/10.1016/j.comgeo.2020.101656
https://doi.org/10.1016/j.comgeo.2020.101656