Group evolution patterns in running races

Autor: Matias Korman, Marta Fort, Joan Antoni Sellarès, Yago Diez

Publikováno v: © Information Sciences, 2019, vol. 479, p. 20-39
Articles publicats (D-IMAE)
Díez Donoso, Santiago Fort, Marta Korman, Matias Sellarès i Chiva, Joan Antoni 2019 Group evolution patterns in running races Information Sciences 479 20 39
DUGiDocs – Universitat de Girona
instname

We address the problem of tracking and detecting interactions between the different groups of runners that form during a race. In athletic races control points are set to monitor the progress of athletes over the course. Intuitively, a {\it group} is

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4bc4f387032255e3d6d6d24f31351f82
http://arxiv.org/abs/1812.10530

Multi‐visibility maps of triangulated terrains

Autor: Narcis Madern, Narcís Coll, Marta Fort, Joan Antoni Sellarès

Publikováno v: International Journal of Geographical Information Science. 21:1115-1134

Visibility computation on terrain models is an important research topic with many applications in Geographical Information Systems. A multi-visibility map is the subdivision of the domain of a terrain into regions that, according to different criteri

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::971f17ac8a65e7382690a6186157a551
https://doi.org/10.1080/13658810701300097

Locating an obnoxious plane

Autor: José Miguel Díaz-Báñez, Joan Antoni Sellarès, Mario A. Lopez

Publikováno v: European Journal of Operational Research. 173:556-564

Let S be a set of n points in three-dimensional Euclidean space. We consider the problem of positioning a plane π intersecting the convex hull of S such that min{d(π, p); p ∈ S} is maximized. In a geometric setting, the problem asks for the wides

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::4a871b995226eb0cf97f6dc438d3b94c
https://doi.org/10.1016/j.ejor.2005.02.048

Solving the k-influence region problem with the GPU

Autor: Joan Antoni Sellarès, Marta Fort

Publikováno v: © Information Sciences, 2014, vol. 269, p. 255-269
Articles publicats (D-IMA)
DUGiDocs – Universitat de Girona
instname

In this paper we study a problem that arises in the competitive facility location field. Facilities and customers are represented by points of a planar Euclidean domain. We associate a weighted distance to each facility to reflect that customers sele

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ae24a370cfc33bd68b72824812ccce57
http://hdl.handle.net/10256/11976

Computing Distance Functions from Generalized Sources on Weighted Polyhedral Surfaces

Autor: Joan Antoni Sellarès, Marta Fort

Publikováno v: ICCSA Workshops
Recercat. Dipósit de la Recerca de Catalunya
instname
© International Conference on Computational Sciences and Its Applications : 2008 : ICCSA '08, 2008, p. 394-404
Articles publicats (D-IMA)
DUGiDocs – Universitat de Girona

We present algorithms for computing approximate distance functions and shortest paths from a generalized source (point, segment, polygonal chain or polygonal region) on a weighted non-convex polyhedral surface in which obstacles (represented by polyg

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::76a6e090dc495c69f4ee16859b14e730
https://doi.org/10.1109/iccsa.2008.21