Mostra el registre d'ítem simple
Median trajectories
dc.contributor.author | Buchin, Kevin |
dc.contributor.author | Buchin, Maike |
dc.contributor.author | Kreveld, Marc van |
dc.contributor.author | Löffler, Maarten |
dc.contributor.author | Silveira, Rodrigo Ignacio |
dc.contributor.author | Wenk, Carola |
dc.contributor.author | Wiratma, Lionov |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada II |
dc.date.accessioned | 2013-02-14T14:40:06Z |
dc.date.available | 2013-02-14T14:40:06Z |
dc.date.created | 2012-05 |
dc.date.issued | 2012-05 |
dc.identifier.citation | Buchin, K. [et al.]. Median trajectories. "Algorithmica", Maig 2012, p. 1-20. |
dc.identifier.issn | 0178-4617 |
dc.identifier.uri | http://hdl.handle.net/2117/17768 |
dc.description.abstract | We investigate the concept of a median among a set of trajectories. We establish criteria that a “median trajectory” should meet, and present two different methods to construct a median for a set of input trajectories. The first method is very simple, while the second method is more complicated and uses homotopy with respect to sufficiently large faces in the arrangement formed by the trajectories. We give algorithms for both methods, analyze the worst-case running time, and show that under certain assumptions both methods can be implemented efficiently. We empirically compare the output of both methods on randomly generated trajectories, and evaluate whether the two methods yield medians that are according to our intuition. Our results suggest that the second method, using homotopy, performs considerably better. |
dc.format.extent | 20 p. |
dc.language.iso | eng |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Geometria::Geometria computacional |
dc.subject.lcsh | Trajectories |
dc.subject.lcsh | Geometric algorithms |
dc.subject.lcsh | Homotopy |
dc.title | Median trajectories |
dc.type | Article |
dc.subject.lemac | Geometria computacional |
dc.contributor.group | Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta |
dc.identifier.doi | 10.1007/s10707-011-0143-6 |
dc.description.peerreviewed | Peer Reviewed |
dc.relation.publisherversion | http://cataleg.upc.edu/record=b1018082~S1*cat |
dc.rights.access | Open Access |
local.identifier.drac | 11026777 |
dc.description.version | Postprint (author’s final draft) |
local.citation.author | Buchin, K.; Buchin, M.; Kreveld, M. van; Löffler, M.; Silveira, R.I.; Wenk, C.; Wiratma, L. |
local.citation.publicationName | Algorithmica |
local.citation.startingPage | 1 |
local.citation.endingPage | 20 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [85]
-
Articles de revista [3.234]