Location-dependent generalization of road networks based on equivalent destinations

Suppose a user located at a certain vertex in a road network wants to plan a route using a wayfinding map. The user's exact destination may be irrelevant for planning most of the route, because many destinations will be equivalent in the sense that they allow the user to choose almost the same...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Computer graphics forum Ročník 35; číslo 3; s. 451 - 460
Hlavní autoři:	van Dijk, Thomas C., Haunert, Jan-Henrik, Oehrlein, Johannes
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Oxford Blackwell Publishing Ltd 01.06.2016
Témata:	Algorithms Analysis Categories and Subject Descriptors (according to ACM CCS) Clustering Clusters Computer graphics Computer networks I.2.1 [ARTIFICIAL INTELLIGENCE]: Applications and Expert Systems-Cartography I.5.3 [PATTERN RECOGNITION]: Clustering-Algorithms map generalization Networks Roads Roads & highways Routing Routing (telecommunications) simplification Studies Visualization Wayfinding
ISSN:	0167-7055, 1467-8659
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	Suppose a user located at a certain vertex in a road network wants to plan a route using a wayfinding map. The user's exact destination may be irrelevant for planning most of the route, because many destinations will be equivalent in the sense that they allow the user to choose almost the same paths. We propose a method to find such groups of destinations automatically and to contract the resulting clusters in a detailed map to achieve a simplified visualization. We model the problem as a clustering problem in rooted, edge‐weighted trees. Two vertices are allowed to be in the same cluster if and only if they share at least a given fraction of their path to the root. We analyze some properties of these clusterings and give a linear‐time algorithm to compute the minimum‐cardinality clustering. This algorithm may have various other applications in network visualization and graph drawing, but in this paper we apply it specifically to focus‐and‐context map generalization. When contracting shortest‐path trees in a geographic network, the computed clustering additionally provides a constant‐factor bound on the detour that results from routing using the generalized network instead of the full network. This is a desirable property for wayfinding maps.
AbstractList	Suppose a user located at a certain vertex in a road network wants to plan a route using a wayfinding map. The user's exact destination may be irrelevant for planning most of the route, because many destinations will be equivalent in the sense that they allow the user to choose almost the same paths. We propose a method to find such groups of destinations automatically and to contract the resulting clusters in a detailed map to achieve a simplified visualization. We model the problem as a clustering problem in rooted, edge‐weighted trees. Two vertices are allowed to be in the same cluster if and only if they share at least a given fraction of their path to the root. We analyze some properties of these clusterings and give a linear‐time algorithm to compute the minimum‐cardinality clustering. This algorithm may have various other applications in network visualization and graph drawing, but in this paper we apply it specifically to focus‐and‐context map generalization. When contracting shortest‐path trees in a geographic network, the computed clustering additionally provides a constant‐factor bound on the detour that results from routing using the generalized network instead of the full network. This is a desirable property for wayfinding maps.
Author	van Dijk, Thomas C. Haunert, Jan-Henrik Oehrlein, Johannes
Author_xml	– sequence: 1 givenname: Thomas C. surname: van Dijk fullname: van Dijk, Thomas C. email: thomas.van.dijk@uni-wuerzburg.de organization: Chair for Computer Science I, University of Würzburg, Germany – sequence: 2 givenname: Jan-Henrik surname: Haunert fullname: Haunert, Jan-Henrik email: janhhaunert@uni-osnabrueck.de organization: Institute for Geoinformatics and Remote Sensing, University of Osnabrück, Germany – sequence: 3 givenname: Johannes surname: Oehrlein fullname: Oehrlein, Johannes email: johannes.oehrlein@uni-osnabrueck.de organization: Institute for Geoinformatics and Remote Sensing, University of Osnabrück, Germany
BookMark	eNp1kE1PwzAMhiMEEmNw4B9U4gKHQtI2SXuECQbSBIgPgbhEbutOGSUZSceAX0_YgAMCX2LJz2M57wZZNdYgIduM7rNQB9W42WdJkbAV0mOZkHEueLFKepSFXlLO18mG9xNKaSYF75Hrka2g09bENU7R1Gi6aIwGHbT6fTGIbBM5C3VksJtb9-ijEjzWUZjg80y_QPvp1Og7bRaC3yRrDbQet77ePrk9Ob4ZnMaji-HZ4HAUV6nIWSySBFidI5NCYgFlmTdNA0CLMpOM0ryQORUAyEvBQWRQyLqAhgoEKOssqdI-2V3unTr7PAsHqCftK2xbMGhnXrE84TzNM8oCuvMLndiZM-G6QFGWyYLyJFAHS6py1nuHjap0t_hT50C3ilH1GbIKIatFyMHY-2VMnX4C9_Yn-7V9rlt8-x9Ug-HJtxEvDe07fP0xwD0qIVPJ1d35UD1cng_vH65O1VH6AUZ7ne0
CitedBy_id	crossref_primary_10_3390_ijgi6070196
Cites_doi	10.1145/1653771.1653788 10.1145/383259.383286 10.1007/3-540-26772-7_26 10.1145/1882261.1866184 10.1080/13658810500161179 10.1080/13658816.2014.887718 10.1109/TVCG.2011.191 10.1145/2133803.2330080 10.1186/1471-2105-8-460 10.1287/trsc.1110.0401 10.7155/jgaa.00314 10.1145/22627.22342 10.1109/TVCG.2007.70540 10.1080/13658810903401008 10.1007/3-540-45868-9_12 10.1559/152304093782637479 10.1145/1456650.1456652 10.1007/s10109-009-0078-8 10.1023/B:GEIN.0000017746.44824.70 10.1007/978-1-4684-2001-2_9 10.1109/TVCG.2006.200 10.1109/TVCG.2013.155 10.1007/0-387-22444-0_3 10.1145/2666310.2666414 10.1179/caj.1966.3.1.10 10.1080/13658810310001596085
ContentType	Journal Article
Copyright	2016 The Author(s) Computer Graphics Forum © 2016 The Eurographics Association and John Wiley & Sons Ltd. Published by John Wiley & Sons Ltd. 2016 The Eurographics Association and John Wiley & Sons Ltd.
Copyright_xml	– notice: 2016 The Author(s) Computer Graphics Forum © 2016 The Eurographics Association and John Wiley & Sons Ltd. Published by John Wiley & Sons Ltd. – notice: 2016 The Eurographics Association and John Wiley & Sons Ltd.
DBID	BSCLL AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D F28 FR3
DOI	10.1111/cgf.12921
DatabaseName	Istex CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ANTE: Abstracts in New Technology & Engineering Engineering Research Database
DatabaseTitle	CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional Engineering Research Database ANTE: Abstracts in New Technology & Engineering
DatabaseTitleList	CrossRef Computer and Information Systems Abstracts Technology Research Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering
EISSN	1467-8659
EndPage	460
ExternalDocumentID	4107220491 10_1111_cgf_12921 CGF12921 ark_67375_WNG_ZPNGXZRH_B
Genre	article Feature
GroupedDBID	.3N .4S .DC .GA .Y3 05W 0R~ 10A 15B 1OB 1OC 29F 31~ 33P 3SF 4.4 50Y 50Z 51W 51X 52M 52N 52O 52P 52S 52T 52U 52W 52X 5GY 5HH 5LA 5VS 66C 6J9 702 7PT 8-0 8-1 8-3 8-4 8-5 8UM 8VB 930 A03 AAESR AAEVG AAHQN AAMMB AAMNL AANHP AANLZ AAONW AASGY AAXRX AAYCA AAZKR ABCQN ABCUV ABDBF ABDPE ABEML ABPVW ACAHQ ACBWZ ACCZN ACFBH ACGFS ACPOU ACRPL ACSCC ACUHS ACXBN ACXQS ACYXJ ADBBV ADEOM ADIZJ ADKYN ADMGS ADMLS ADNMO ADOZA ADXAS ADZMN AEFGJ AEGXH AEIGN AEIMD AEMOZ AENEX AEUYR AEYWJ AFBPY AFEBI AFFNX AFFPM AFGKR AFWVQ AFZJQ AGHNM AGQPQ AGXDD AGYGG AHBTC AHEFC AHQJS AIDQK AIDYY AIQQE AITYG AIURR AJXKR AKVCP ALAGY ALMA_UNASSIGNED_HOLDINGS ALVPJ AMBMR AMYDB ARCSS ASPBG ATUGU AUFTA AVWKF AZBYB AZFZN AZVAB BAFTC BDRZF BFHJK BHBCM BMNLL BMXJE BNHUX BROTX BRXPI BSCLL BY8 CAG COF CS3 CWDTD D-E D-F DCZOG DPXWK DR2 DRFUL DRSTM DU5 EAD EAP EBA EBO EBR EBS EBU EDO EJD EMK EST ESX F00 F01 F04 F5P FEDTE FZ0 G-S G.N GODZA H.T H.X HF~ HGLYW HVGLF HZI HZ~ I-F IHE IX1 J0M K1G K48 LATKE LC2 LC3 LEEKS LH4 LITHE LOXES LP6 LP7 LUTES LW6 LYRES MEWTI MK4 MRFUL MRSTM MSFUL MSSTM MXFUL MXSTM N04 N05 N9A NF~ O66 O9- OIG P2W P2X P4D PALCI PQQKQ Q.N Q11 QB0 QWB R.K RDJ RIWAO RJQFR ROL RX1 SAMSI SUPJJ TH9 TN5 TUS UB1 V8K W8V W99 WBKPD WIH WIK WOHZO WQJ WXSBR WYISQ WZISG XG1 ZL0 ZZTAW ~IA ~IF ~WT ALUQN AAYXX CITATION O8X 7SC 8FD JQ2 L7M L~C L~D F28 FR3
ID	FETCH-LOGICAL-c3681-622a1d8e1767e9abb8fffaa09b47100897806aae5b65a64a97d9af06eaabd42c3
IEDL.DBID	DRFUL
ISICitedReferencesCount	3
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000379912300048&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0167-7055
IngestDate	Fri Sep 05 13:27:22 EDT 2025 Fri Jul 25 23:46:12 EDT 2025 Sat Nov 29 03:41:13 EST 2025 Tue Nov 18 21:12:42 EST 2025 Sun Sep 21 06:19:21 EDT 2025 Tue Nov 11 03:33:03 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	3
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c3681-622a1d8e1767e9abb8fffaa09b47100897806aae5b65a64a97d9af06eaabd42c3
Notes	ark:/67375/WNG-ZPNGXZRH-B istex:0F7841AD4C3B8BED389A4ED0F8760BD51740142B ArticleID:CGF12921 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23
PQID	1801479052
PQPubID	30877
PageCount	10
ParticipantIDs	proquest_miscellaneous_1825538401 proquest_journals_1801479052 crossref_citationtrail_10_1111_cgf_12921 crossref_primary_10_1111_cgf_12921 wiley_primary_10_1111_cgf_12921_CGF12921 istex_primary_ark_67375_WNG_ZPNGXZRH_B
PublicationCentury	2000
PublicationDate	2016-06 June 2016 2016-06-00 20160601
PublicationDateYYYYMMDD	2016-06-01
PublicationDate_xml	– month: 06 year: 2016 text: 2016-06
PublicationDecade	2010
PublicationPlace	Oxford
PublicationPlace_xml	– name: Oxford
PublicationTitle	Computer graphics forum
PublicationTitleAlternate	Computer Graphics Forum
PublicationYear	2016
Publisher	Blackwell Publishing Ltd
Publisher_xml	– name: Blackwell Publishing Ltd
References	Sanders P., Schultes D.: Engineering highway hierarchies. ACM Journal of Experimental Algorithmics 17, 1 (2012). doi:10.1145/2133803.2330080. 3 Borkin M.A., Yeh C.S., Boyd M., Macko P., Gajos K.Z., Seltzer M., Pfister H.: Evaluation of filesystem provenance visualization tools. IEEE Transactions on Visualization and Computer Graphics 19, 12 (2013), 2476-2485. 3 Mackaness W.A., Beard M.K.: Use of graph theory to support map generalization. Cartography and Geographic Information Systems 20 (1993), 210-221. URL:http://www.geos.ed.ac.uk/homes/wam/MackBeard1993.pdf. 3 Zipf A., Richter K.-F.: Using focus maps to ease map reading: Developing smart applications for mobile devices. Künstliche Intelligenz 02, 4 (2002), 35-37. 3 Dyken C., Dæhlen M., Sevaldrud T.: Simultaneous curve simplification. Journal of Geographical Systems 11, 3 (2009), 273-289. doi:10.1007/s10109-009-0078-8. 2, 6, 8 Blanch R., Lecolinet E.: Browsing zoomable treemaps: Structure-aware multi-scale navigation techniques. IEEE Transactions on Visualization and Computer Graphics 13, 6 (2007), 1248-1253. 3 Vliegen R., van Wijk J.J., van der Linden E.-J.: Visualizing business data with generalized treemaps. IEEE Transactions on Visualization and Computer Graphics 12, 5 (Sept 2006), 789-796. doi:10.1109/TVCG.2006.200. 3 Sester M.: Optimization approaches for generalization and data abstraction. International Journal of Geographical Information Science 19, 8-9 (2005), 871-897. doi:10.1080/13658810500161179. 2 Geisberger R., Sanders P., Schultes D., Vetter C.: Exact routing in large road networks using contraction hierarchies. Transportation Science 46, 3 (2012), 388-404. doi:10.1287/trsc.1110.0401. 3 van Dijk T.C., Haunert J.-H.: Interactive focus maps using least-squares optimization. International Journal of Geographical Information Science 28, 10 (2014), 2052-2075. doi:10.1080/13658816.2014.887718. 3 Ware J.M., Jones C.B., Thomas N.: Automated map generalization with multiple operators: a simulated annealing approach. International Journal of Geographical Information Science 17, 8 (2003), 743-769. doi:10.1080/13658810310001596085. 2 Huson D.H., Richter D.C., Rausch C., Dezulian T., Franz M., Rupp R.: Dendroscope: An interactive viewer for large phylogenetic trees. BMC Bioinformatics 8, 1 (2007), 1-6. URL:http://dx.doi.org/10.1186/1471-2105-8-460, doi:10.1186/1471-2105-8-460. 3 Kopf J., Agrawala M., Bargeron D., Salesin D., Cohen M.: Automatic generation of destination maps. ACM Transactions on Graphics 29, 6 (dec 2010), 158:1-158:12. doi:10.1145/1882261.1866184. 3, 6 HAUNERT J.-H., Sering L.: Drawing road networks with focus regions. IEEE Transactions on Visualization and Computer Graphics 17, 12 (2011), 2555-2562. 8 Jiang B., Claramunt C.: A structural approach to the model generalization of an urban street network. Geoinformatica 8, 2 (2004), 157-171. doi:10.1023/B:GEIN.0000017746.44824.70. 3 TÖPFER F., Pillewizer W.: The principles of selection. The Cartographic Journal 3, 1 (1966), 10-16. 2 Brunel E., Gemsa A., Krug M., Rutter I., Wagner D.: Generalizing geometric graphs. Journal of Graph Algorithms and Applications 18, 1 (2014), 35-76. doi:10.7155/jgaa.00314. 3 Cockburn A., Karlson A., Bederson B.B.: A review of overview+detail, zooming, and focus+context interfaces. ACM Computing Surveys 41, 1 (2009), 2: 1-2:31. doi:10.1145/1456650.1456652. 3 Haunert J.-H., Wolff A.: Area aggregation in map generalisation by mixed-integer programming. International Journal of Geographical Information Science 24, 12 (2010), 1871-1897. doi:10.1080/13658810903401008. 2 1966; 3 2009; 41 2006; 12 2004; 8 1993; 20 2009 1995 1972 2003; 17 2005 2012; 17 2003 2014; 28 2011; 17 2007; 13 2013; 19 2009; 11 2005; 19 2010; 24 2001 2010; 29 2002; 02 2007; 8 1986 2015 2014; 18 2014 2013 2002; 2390 2012; 46 van Dijk T.C. (e_1_2_6_26_2) 2013 e_1_2_6_30_2 e_1_2_6_19_2 e_1_2_6_12_2 e_1_2_6_13_2 Lamping J. (e_1_2_6_18_2) 1995 e_1_2_6_10_2 e_1_2_6_11_2 e_1_2_6_16_2 e_1_2_6_17_2 e_1_2_6_14_2 e_1_2_6_15_2 Zipf A. (e_1_2_6_31_2) 2002; 02 e_1_2_6_20_2 e_1_2_6_8_2 e_1_2_6_7_2 e_1_2_6_29_2 e_1_2_6_4_2 e_1_2_6_3_2 e_1_2_6_6_2 e_1_2_6_5_2 e_1_2_6_24_2 e_1_2_6_23_2 e_1_2_6_2_2 e_1_2_6_22_2 e_1_2_6_21_2 e_1_2_6_28_2 e_1_2_6_27_2 Fabri A. (e_1_2_6_9_2) 2015 e_1_2_6_25_2
References_xml	– reference: Brunel E., Gemsa A., Krug M., Rutter I., Wagner D.: Generalizing geometric graphs. Journal of Graph Algorithms and Applications 18, 1 (2014), 35-76. doi:10.7155/jgaa.00314. 3 – reference: Jiang B., Claramunt C.: A structural approach to the model generalization of an urban street network. Geoinformatica 8, 2 (2004), 157-171. doi:10.1023/B:GEIN.0000017746.44824.70. 3 – reference: van Dijk T.C., Haunert J.-H.: Interactive focus maps using least-squares optimization. International Journal of Geographical Information Science 28, 10 (2014), 2052-2075. doi:10.1080/13658816.2014.887718. 3 – reference: Haunert J.-H., Wolff A.: Area aggregation in map generalisation by mixed-integer programming. International Journal of Geographical Information Science 24, 12 (2010), 1871-1897. doi:10.1080/13658810903401008. 2 – reference: Geisberger R., Sanders P., Schultes D., Vetter C.: Exact routing in large road networks using contraction hierarchies. Transportation Science 46, 3 (2012), 388-404. doi:10.1287/trsc.1110.0401. 3 – reference: Kopf J., Agrawala M., Bargeron D., Salesin D., Cohen M.: Automatic generation of destination maps. ACM Transactions on Graphics 29, 6 (dec 2010), 158:1-158:12. doi:10.1145/1882261.1866184. 3, 6 – reference: Borkin M.A., Yeh C.S., Boyd M., Macko P., Gajos K.Z., Seltzer M., Pfister H.: Evaluation of filesystem provenance visualization tools. IEEE Transactions on Visualization and Computer Graphics 19, 12 (2013), 2476-2485. 3 – reference: Dyken C., Dæhlen M., Sevaldrud T.: Simultaneous curve simplification. Journal of Geographical Systems 11, 3 (2009), 273-289. doi:10.1007/s10109-009-0078-8. 2, 6, 8 – reference: Sester M.: Optimization approaches for generalization and data abstraction. International Journal of Geographical Information Science 19, 8-9 (2005), 871-897. doi:10.1080/13658810500161179. 2 – reference: Vliegen R., van Wijk J.J., van der Linden E.-J.: Visualizing business data with generalized treemaps. IEEE Transactions on Visualization and Computer Graphics 12, 5 (Sept 2006), 789-796. doi:10.1109/TVCG.2006.200. 3 – reference: Ware J.M., Jones C.B., Thomas N.: Automated map generalization with multiple operators: a simulated annealing approach. International Journal of Geographical Information Science 17, 8 (2003), 743-769. doi:10.1080/13658810310001596085. 2 – reference: Blanch R., Lecolinet E.: Browsing zoomable treemaps: Structure-aware multi-scale navigation techniques. IEEE Transactions on Visualization and Computer Graphics 13, 6 (2007), 1248-1253. 3 – reference: Cockburn A., Karlson A., Bederson B.B.: A review of overview+detail, zooming, and focus+context interfaces. ACM Computing Surveys 41, 1 (2009), 2: 1-2:31. doi:10.1145/1456650.1456652. 3 – reference: Zipf A., Richter K.-F.: Using focus maps to ease map reading: Developing smart applications for mobile devices. Künstliche Intelligenz 02, 4 (2002), 35-37. 3 – reference: Huson D.H., Richter D.C., Rausch C., Dezulian T., Franz M., Rupp R.: Dendroscope: An interactive viewer for large phylogenetic trees. BMC Bioinformatics 8, 1 (2007), 1-6. URL:http://dx.doi.org/10.1186/1471-2105-8-460, doi:10.1186/1471-2105-8-460. 3 – reference: Mackaness W.A., Beard M.K.: Use of graph theory to support map generalization. Cartography and Geographic Information Systems 20 (1993), 210-221. URL:http://www.geos.ed.ac.uk/homes/wam/MackBeard1993.pdf. 3 – reference: Sanders P., Schultes D.: Engineering highway hierarchies. ACM Journal of Experimental Algorithmics 17, 1 (2012). doi:10.1145/2133803.2330080. 3 – reference: HAUNERT J.-H., Sering L.: Drawing road networks with focus regions. IEEE Transactions on Visualization and Computer Graphics 17, 12 (2011), 2555-2562. 8 – reference: TÖPFER F., Pillewizer W.: The principles of selection. The Cartographic Journal 3, 1 (1966), 10-16. 2 – volume: 28 start-page: 2052 issue: 10 year: 2014 end-page: 2075 article-title: Interactive focus maps using least‐squares optimization publication-title: International Journal of Geographical Information Science – start-page: 85 year: 1972 end-page: 103 – volume: 18 start-page: 35 issue: 1 year: 2014 end-page: 76 article-title: Generalizing geometric graphs publication-title: Journal of Graph Algorithms and Applications – volume: 19 start-page: 2476 issue: 12 year: 2013 end-page: 2485 article-title: Evaluation of filesystem provenance visualization tools publication-title: IEEE Transactions on Visualization and Computer Graphics – volume: 13 start-page: 1248 issue: 6 year: 2007 end-page: 1253 article-title: Browsing zoomable treemaps: Structure‐aware multi‐scale navigation techniques publication-title: IEEE Transactions on Visualization and Computer Graphics – start-page: 16 year: 1986 end-page: 32 – volume: 24 issue: 12 year: 2010 article-title: Area aggregation in map generalisation by mixed‐integer programming publication-title: International Journal of Geographical Information Science – volume: 19 start-page: 871 issue: 8–9 year: 2005 end-page: 897 article-title: Optimization approaches for generalization and data abstraction publication-title: International Journal of Geographical Information Science – start-page: 241 year: 2001 end-page: 249 – volume: 2390 start-page: 148 year: 2002 end-page: 157 – volume: 8 start-page: 157 issue: 2 year: 2004 end-page: 171 article-title: A structural approach to the model generalization of an urban street network publication-title: Geoinformatica – volume: 12 start-page: 789 issue: 5 year: 2006 end-page: 796 article-title: Visualizing business data with generalized treemaps publication-title: IEEE Transactions on Visualization and Computer Graphics – start-page: 101 year: 2009 end-page: 110 – volume: 20 start-page: 210 year: 1993 end-page: 221 article-title: Use of graph theory to support map generalization publication-title: Cartography and Geographic Information Systems – start-page: 243 year: 2014 end-page: 252 – volume: 46 start-page: 388 issue: 3 year: 2012 end-page: 404 article-title: Exact routing in large road networks using contraction hierarchies publication-title: Transportation Science – start-page: 65 year: 2003 end-page: 84 – start-page: 428 year: 2013 end-page: 431 – start-page: 343 year: 2005 end-page: 353 – volume: 8 start-page: 1 issue: 1 year: 2007 end-page: 6 article-title: Dendroscope: An interactive viewer for large phylogenetic trees publication-title: BMC Bioinformatics – volume: 11 start-page: 273 issue: 3 year: 2009 end-page: 289 article-title: Simultaneous curve simplification publication-title: Journal of Geographical Systems – start-page: 401 year: 1995 end-page: 408 – volume: 17 issue: 1 year: 2012 article-title: Engineering highway hierarchies publication-title: ACM Journal of Experimental Algorithmics – volume: 29 start-page: 158:1 issue: 6 year: 2010 end-page: 158:12 article-title: Automatic generation of destination maps publication-title: ACM Transactions on Graphics – volume: 17 start-page: 743 issue: 8 year: 2003 end-page: 769 article-title: Automated map generalization with multiple operators: a simulated annealing approach publication-title: International Journal of Geographical Information Science – volume: 17 start-page: 2555 issue: 12 year: 2011 end-page: 2562 article-title: Drawing road networks with focus regions publication-title: IEEE Transactions on Visualization and Computer Graphics – year: 2015 – volume: 3 start-page: 10 issue: 1 year: 1966 end-page: 16 article-title: The principles of selection publication-title: The Cartographic Journal – volume: 41 start-page: 31 issue: 1 year: 2009 article-title: A review of overview+detail, zooming, and focus+context interfaces publication-title: ACM Computing Surveys – volume: 02 start-page: 35 issue: 4 year: 2002 end-page: 37 article-title: Using focus maps to ease map reading: Developing smart applications for mobile devices publication-title: Künstliche Intelligenz – start-page: 428 volume-title: Proc. 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems year: 2013 ident: e_1_2_6_26_2 – ident: e_1_2_6_29_2 doi: 10.1145/1653771.1653788 – ident: e_1_2_6_2_2 doi: 10.1145/383259.383286 – ident: e_1_2_6_30_2 doi: 10.1007/3-540-26772-7_26 – ident: e_1_2_6_16_2 doi: 10.1145/1882261.1866184 – ident: e_1_2_6_21_2 doi: 10.1080/13658810500161179 – start-page: 401 volume-title: Proc. ACM Conference on Human Factors in Computing Systems (SIGCHI’95) year: 1995 ident: e_1_2_6_18_2 – ident: e_1_2_6_25_2 doi: 10.1080/13658816.2014.887718 – ident: e_1_2_6_13_2 doi: 10.1109/TVCG.2011.191 – ident: e_1_2_6_22_2 doi: 10.1145/2133803.2330080 – ident: e_1_2_6_12_2 doi: 10.1186/1471-2105-8-460 – ident: e_1_2_6_11_2 doi: 10.1287/trsc.1110.0401 – ident: e_1_2_6_3_2 doi: 10.7155/jgaa.00314 – ident: e_1_2_6_10_2 doi: 10.1145/22627.22342 – volume-title: CGAL User and Reference Manual year: 2015 ident: e_1_2_6_9_2 – ident: e_1_2_6_4_2 doi: 10.1109/TVCG.2007.70540 – ident: e_1_2_6_14_2 doi: 10.1080/13658810903401008 – ident: e_1_2_6_23_2 doi: 10.1007/3-540-45868-9_12 – ident: e_1_2_6_20_2 doi: 10.1559/152304093782637479 – ident: e_1_2_6_6_2 doi: 10.1145/1456650.1456652 – ident: e_1_2_6_8_2 doi: 10.1007/s10109-009-0078-8 – ident: e_1_2_6_15_2 doi: 10.1023/B:GEIN.0000017746.44824.70 – ident: e_1_2_6_17_2 doi: 10.1007/978-1-4684-2001-2_9 – ident: e_1_2_6_27_2 doi: 10.1109/TVCG.2006.200 – ident: e_1_2_6_5_2 doi: 10.1109/TVCG.2013.155 – ident: e_1_2_6_19_2 doi: 10.1007/0-387-22444-0_3 – ident: e_1_2_6_7_2 doi: 10.1145/2666310.2666414 – ident: e_1_2_6_24_2 doi: 10.1179/caj.1966.3.1.10 – volume: 02 start-page: 35 issue: 4 year: 2002 ident: e_1_2_6_31_2 article-title: Using focus maps to ease map reading: Developing smart applications for mobile devices publication-title: Künstliche Intelligenz – ident: e_1_2_6_28_2 doi: 10.1080/13658810310001596085
SSID	ssj0004765
Score	2.146765
Snippet	Suppose a user located at a certain vertex in a road network wants to plan a route using a wayfinding map. The user's exact destination may be irrelevant for...
SourceID	proquest crossref wiley istex
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	451
SubjectTerms	Algorithms Analysis Categories and Subject Descriptors (according to ACM CCS) Clustering Clusters Computer graphics Computer networks I.2.1 [ARTIFICIAL INTELLIGENCE]: Applications and Expert Systems-Cartography I.5.3 [PATTERN RECOGNITION]: Clustering-Algorithms map generalization Networks Roads Roads & highways Routing Routing (telecommunications) simplification Studies Visualization Wayfinding
Title	Location-dependent generalization of road networks based on equivalent destinations
URI	https://api.istex.fr/ark:/67375/WNG-ZPNGXZRH-B/fulltext.pdf https://onlinelibrary.wiley.com/doi/abs/10.1111%2Fcgf.12921 https://www.proquest.com/docview/1801479052 https://www.proquest.com/docview/1825538401
Volume	35
WOSCitedRecordID	wos000379912300048&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVWIB databaseName: Wiley Online Library Full Collection 2020 customDbUrl: eissn: 1467-8659 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004765 issn: 0167-7055 databaseCode: DRFUL dateStart: 19970101 isFulltext: true titleUrlDefault: https://onlinelibrary.wiley.com providerName: Wiley-Blackwell
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1fT9swED-hdg_wsI1_WjeGAkKoL0FJmtixeNqAtA9VhSoKVV-ss-MgtCmBpp32uI-wz7hPgp1_FAmkSbxEkXxOrPOd72zf_Q7gSGgfWbiE2Xrh0w9tZG1BmLK9WIWuIxzpFbUOr4d0NAqnU3a5Bqd1LkyJD9EcuBnNKNZro-Ao8hUll7fJiTZWJom87Wm59VvQPh9Hk-FTWiQlQQ3tbUBjKmAhE8jTdH5mjtqGs7-f-ZqrHmthcqIPbxrsR3hfeZrWt1I0NmFNpVuwsYI_uA2TYVae2P3787euhruwbksk6ipB08oSa55hbKVlwHhuGcMXW7pFPSzvtKCaPrEB6ygPFvMdmEQXV2cDu6qzYMseCV2beB66cahcSqhiKESYJAmiw4RfYP8YkCKCqAJBAiQ-MhozTByiEEXse7K3C600S9UnsEKvF_gSlf6I9APJkCpUNGFIYqUdS9qBbs1uLisQclML4yevNyOaU7zgVAcOG9L7EnnjJaLjYs4aCpz_MKFqNOA3oz6fXY7609l4wL93YK-eVF5pac5dA51jEMq8Dhw0zVq_zKUJpipbGhq96erpbbD-V7eY4tdHw8_6UfHy-f9Jv8C69sFIGX22B63FfKm-wjv5a3GXz_crkX4EBO_7Kw
linkProvider	Wiley-Blackwell
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3da9RAEB_KXUH7oK0f9GzVVET6Ernkkt0s-FKrdyfGUEpPj74ss5tNKS2J3kfx0T_Bv9G_pDv56hUUhL6EQGaTZXZmZ3Yy8xuA18r6yMpjwrUbn71YI-sqJozrpyby-qqv_bLX4deYJ0k0nYqjNXjX1MJU-BBtwI00o9yvScEpIL2i5fose2utFVWRdwMrRmEHuh-Oh5P4pi6Ss7DB9ibUmBpZiDJ52sG37FGXWPvzlrO56rKWNmf48G6z3YQHta_pHFTCsQVrJn8EGysIhI9hEhdVzO7Pr99NP9yFc1ZhUdclmk6RObMCUyevUsbnDpm-1LFPzI_luRVVGpMSXEcVWpw_gcnw48nh2K07Lbh6wCLPZb6PXhoZjzNuBCoVZVmG2BcqKNF_CKaIIZpQsRBZgIKnArM-M4gqDXw9eAqdvMjNNjiRPwgDjca-RAehFsgNGp4JZKmxriXvwX7Db6lrGHLqhnEpm-OI5ZQsOdWDVy3p9wp7429Eb8pFaylwdkHJajyU35KRPD1KRtPT47F834PdZlVlradz6RF4DmGU-T3Yax9bDaPfJpibYkk09tg1sAdh-639co3_PRt5OBqWN8_-n_Ql3BuffIll_Cn5vAP3rUfGqly0XegsZkvzHNb11eJ8PntRy_c1BZf_Gw
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3dS9xAEB_EK6U-2NpWPL-allJ8iVxyyW4WfGnVnOIRDum1hy_L7EcOURK9D_Gxf0L_Rv-S7uarJ1go-BICO5ssszs7M7szvwH4LIyNLDzCXLPxmYdRsq4gTLu-0pHXER3pF7UOf_RpkkSjERsswUGdC1PiQzQHblYyiv3aCri-UemClMtxum-0lc0ibwUhI0YsW0fn8bD_Ny-SkrDG9raoMRWykI3kaTo_0kcty9r7R8bmosla6Jz49fNG-wZWK1vT-VoujjVY0tlbWFlAIHwHw35entk9_Ppd18OdOeMSi7pK0XTy1JnkqJysDBmfOlb1Kce06Nv5pVmqto-ycB3l0eL0PQzj4--HJ25VacGVXRJ5LvF99FSkPUqoZihElKYpYoeJoED_sTBFBFGHgoRIAmRUMUw7RCMKFfiyuw7LWZ7pDXAivxsGErX5iAxCyZBq1DRlSJQ2piVtw17Nby4rGHJbDeOa1-6I4RQvONWGTw3pTYm98RTRl2LSGgqcXNlgNRryn0mPXwyS3uji_IR_a8N2Pau8ktMp9yx4jsUo89vwsWk2EmavTTDT-dzSGLeraxxh86-9Yo7_PRp-2IuLl83_J_0ALwdHMe-fJmdb8MoYZKQMRduG5dlkrnfghbybXU4nu9Xy_gOS-v6W
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Location%E2%80%90dependent+generalization+of+road+networks+based+on+equivalent+destinations&rft.jtitle=Computer+graphics+forum&rft.au=van+Dijk%2C+Thomas+C.&rft.au=Haunert%2C+Jan%E2%80%90Henrik&rft.au=Oehrlein%2C+Johannes&rft.date=2016-06-01&rft.issn=0167-7055&rft.eissn=1467-8659&rft.volume=35&rft.issue=3&rft.spage=451&rft.epage=460&rft_id=info:doi/10.1111%2Fcgf.12921&rft.externalDBID=n%2Fa&rft.externalDocID=10_1111_cgf_12921
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0167-7055&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0167-7055&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0167-7055&client=summon