Zobrazeno 1 - 10
of 77
pro vyhledávání: '"Metro maps"'
Publikováno v:
ISPRS International Journal of Geo-Information, Vol 13, Iss 8, p 294 (2024)
On schematic metro maps, high-quality label placement is helpful to passengers performing route planning and orientation tasks. It has been reported that the artificial neural network (ANN) has the potential to place labels with learned labeling know
Externí odkaz:
https://doaj.org/article/193e39533d484d17aa0ae65ed02ebbc5
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
I. Fister
Publikováno v:
IEEE Transactions on Emerging Topics in Computational Intelligence. 6:660-676
Association Rule Mining is a machine learning method for discovering the interesting relations between the attributes in a huge transaction database. Typically, algorithms for Association Rule Mining generate a huge number of association rules, from
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a5e3c38c677b12fd7fd6011442eeff02
https://doi.org/10.1109/tetci.2021.3074919
https://doi.org/10.1109/tetci.2021.3074919
Publikováno v:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. :1150-1155
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7c9308db8e33ad3b38809fa462f99e0e
https://doi.org/10.1587/transfun.2020dmp0019
https://doi.org/10.1587/transfun.2020dmp0019
Publikováno v:
Journal of Visualization, 25(2). Springer
We present family metro maps as a new approach to visualize the relations between multiple related families. A family is represented by a metro line, where the parents are the end nodes and the children the intermediate nodes. We introduce family tre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::05cb36d9fbbbe3e9e5b0e357c52fcdb1
http://www.scopus.com/inward/record.url?scp=85116491867&partnerID=8YFLogxK
http://www.scopus.com/inward/record.url?scp=85116491867&partnerID=8YFLogxK
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Computer Graphics Forum. 39:357-367
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d77c14457cc73f7b623754895ccdb48c
https://doi.org/10.1111/cgf.13986
https://doi.org/10.1111/cgf.13986
Publikováno v:
Transportation Research Procedia. 48:2608-2620
There were 31 megacities in the world in 2016 and 10 more are expected to join the group by 2030. Most of the old megacities developed their Mass Rapid Transit systems many decades ago, while some of the aspiring megacities are in the process of buil
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1e7dabbfd09b566cca89e4e0a663c929
https://doi.org/10.1016/j.trpro.2020.08.250
https://doi.org/10.1016/j.trpro.2020.08.250
Autor:
Michael Burch, Uwe Kloos, Peter Grupp, Janis Uttenweiler, Steffen Hähnle, Yves Staudt, Josia Scheytt, Sina M. Frommer
Publikováno v:
VINCI
Public transport maps are typically designed in a way to support route finding tasks for passengers while they also provide an overview about stations, metro lines, and city-specific attractions. Most of those maps are designed as a static representa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::944577ba54dc2932ed1e22848e42f3a9
https://doi.org/10.1145/3430036.3430061
https://doi.org/10.1145/3430036.3430061
Publikováno v:
Algorithmica. 80:1493-1533
Drawing network maps automatically comprises two challenging steps, namely laying out the map and placing non-overlapping labels. In this paper we tackle the problem of labeling an already existing network map considering the application of metro map
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c0bf0dc5ef315f34f911b280d643cc51
https://doi.org/10.1007/s00453-017-0350-0
https://doi.org/10.1007/s00453-017-0350-0