Zobrazeno 1 - 4
of 4
pro vyhledávání: '"María Gisela Dorzán"'
Autor:
María Gisela Dorzán, Edilma Olinda Gagliardi, Mario Guillermo Leguizamón, Gregorio Hernández Peñalver
Publikováno v:
Journal of Computer Science and Technology, Vol 10, Iss 02, Pp 47-53 (2010)
Globally optimal triangulations are difficult to be found by deterministic methods as, for most type of criteria, no polynomial algorithm is known. In this work, we consider the Minimum Weight Triangulation (MWT) problem of a given set of n points in
Externí odkaz:
https://doaj.org/article/8fc2cec048ed4b519d0e5d680fb2a316
Autor:
Edilma Olinda Gagliardi, Mario Guillermo Leguizamón, Gregorio Hernández Peñalver, María Gisela Dorzán
Publikováno v:
Fundamenta Informaticae. 119:1-27
Globally optimal triangulations and pseudo-triangulations are difficult to be found by deterministic methods as, for most type of criteria, no polynomial algorithm is known. In this work, we consider the Minimum Weight Triangulation (MWT) and Minimum
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b8b7e6537bdaf0c5220724996cb2419b
https://doi.org/10.3233/fi-2012-725
https://doi.org/10.3233/fi-2012-725
Autor:
Gregorio Hernández-Peñalver, María Gisela Dorzán, Mario Guillermo Leguizamón, Efrén Mezura-Montes
The complexity status of the Minimum Dilation Triangulation (MDT) problem for a general point set is unknown. Therefore, we focus on the development of approximated algorithms to find high quality triangulations of minimum dilation. For an initial ap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::44f9e62c79a35424bd8b02fc9d0674ff
http://link.springer.com/article/10.1007/s10732-014-9237-2
http://link.springer.com/article/10.1007/s10732-014-9237-2
Autor:
Gregorio Hernández Peñalver, Mario Guillermo Leguizamón, María Gisela Dorzán, Edilma Olinda Gagliardi
Publikováno v:
Proceedings of the 2011 IEEE International Conference on Services Computing | 2011 IEEE International Conference on Services Computing | july, 4-9, 2011 | Washington, DC, USA
SCCC
Archivo Digital UPM
instname
SCCC
Archivo Digital UPM
instname
Globally optimal triangulations are difficult to be found by deterministic methods as, for most type of criteria, no polynomial algorithm is known. In this work, we consider the Minimum Weight Triangulation (MWT) problem of a given set of n points in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1804d8a9ec3464c43af68d737d2d849e
http://oa.upm.es/19304/
http://oa.upm.es/19304/