{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T07:36:09Z","timestamp":1648712169265},"reference-count":8,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comput. Geom. Appl."],"published-print":{"date-parts":[[2008,8]]},"abstract":"<jats:p> In this paper we consider a new time metric called the Heavy Luggage Metric. This metric models the behavior of a traveller in a city wishing to walk as little as possible, maybe carrying some very heavy luggage. A transportation network allows the traveller to move between any pair of stations at cost zero, while walking has a cost proportional to the length of the walked path. We propose efficient algorithms for computing the closest and farthest Voronoi Diagrams for a set of points with respect to this metric. <\/jats:p>","DOI":"10.1142\/s0218195908002635","type":"journal-article","created":{"date-parts":[[2008,8,13]],"date-time":"2008-08-13T07:09:14Z","timestamp":1218611354000},"page":"295-306","source":"Crossref","is-referenced-by-count":3,"title":["THE HEAVY LUGGAGE METRIC"],"prefix":"10.1142","volume":"18","author":[{"given":"MANUEL","family":"ABELLANAS","sequence":"first","affiliation":[{"name":"Departamento de Matem\u00e1tica Aplicada, Facultad de Inform\u00e1tica, Universidad Polit\u00e9cnica de Madrid, 28660 Boadilla del Monte, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"FERRAN","family":"HURTADO","sequence":"additional","affiliation":[{"name":"Departament de Matem\u00e0tica Aplicada II, Universitat Polit\u00e8cnica de Catalunya, Edifici Omega, Jordi Girona 1-3, 08034 Barcelona, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"BEL\u00c9N","family":"PALOP","sequence":"additional","affiliation":[{"name":"Departamento de Inform\u00e1tica, Universidad de Valladolid, Francisco Mendiz\u00e1bal 1, 47014 Valladolid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(02)00505-7"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2005.05.005"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-52055-4"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195901000663"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1016\/B978-044482537-7\/50006-1"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8396(01)00050-4"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8396(01)00051-6"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8396(03)00027-X"}],"container-title":["International Journal of Computational Geometry &amp; Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218195908002635","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:23:03Z","timestamp":1565122983000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218195908002635"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8]]},"references-count":8,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2008,8]]}},"alternative-id":["10.1142\/S0218195908002635"],"URL":"https:\/\/doi.org\/10.1142\/s0218195908002635","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"value":"0218-1959","type":"print"},{"value":"1793-6357","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,8]]}}}