Range updates and range sum queries on multidimensional points with monoid weights

Let P be a set of n points in Rd where each point p∈P carries a weight drawn from a commutative monoid (M,+,0). Given a d-rectangle rupd (i.e., an orthogonal rectangle in Rd) and a value Δ∈M, a range update adds Δ to the weight of every point p∈P∩rupd; given a d-rectangle rqry, a range sum query ret...

Full description

Saved in:
Bibliographic Details
Published inComputational geometry : theory and applications Vol. 115; p. 102030
Main Authors Lu, Shangqi, Tao, Yufei
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.12.2023
Subjects
Online AccessGet full text
ISSN0925-7721
DOI10.1016/j.comgeo.2023.102030

Cover

Abstract Let P be a set of n points in Rd where each point p∈P carries a weight drawn from a commutative monoid (M,+,0). Given a d-rectangle rupd (i.e., an orthogonal rectangle in Rd) and a value Δ∈M, a range update adds Δ to the weight of every point p∈P∩rupd; given a d-rectangle rqry, a range sum query returns the total weight of the points in P∩rqry. The goal is to store P in a structure to support updates and queries with attractive performance guarantees. We describe a structure of O˜(n) space that handles an update in O˜(Tupd) time and a query in O˜(Tqry) time for arbitrary functions Tupd(n) and Tqry(n) satisfying Tupd⋅Tqry=n. The result holds for any fixed dimensionality d≥2. Our query-update tradeoff is tight up to a polylog factor subject to the OMv-conjecture.
AbstractList Let P be a set of n points in Rd where each point p∈P carries a weight drawn from a commutative monoid (M,+,0). Given a d-rectangle rupd (i.e., an orthogonal rectangle in Rd) and a value Δ∈M, a range update adds Δ to the weight of every point p∈P∩rupd; given a d-rectangle rqry, a range sum query returns the total weight of the points in P∩rqry. The goal is to store P in a structure to support updates and queries with attractive performance guarantees. We describe a structure of O˜(n) space that handles an update in O˜(Tupd) time and a query in O˜(Tqry) time for arbitrary functions Tupd(n) and Tqry(n) satisfying Tupd⋅Tqry=n. The result holds for any fixed dimensionality d≥2. Our query-update tradeoff is tight up to a polylog factor subject to the OMv-conjecture.
ArticleNumber 102030
Author Lu, Shangqi
Tao, Yufei
Author_xml – sequence: 1
  givenname: Shangqi
  surname: Lu
  fullname: Lu, Shangqi
  email: sqlu@cse.cuhk.edu.hk
– sequence: 2
  givenname: Yufei
  orcidid: 0000-0003-3883-5452
  surname: Tao
  fullname: Tao, Yufei
  email: taoyf@cse.cuhk.edu.hk
BookMark eNp9kM1KAzEUhbOoYFt9Axd5gak3mb92I0jxp1AQiq5DJrlpM3SSmmQsvr1Tx7WrCx_3HA7fjEycd0jIHYMFA1bdtwvluz36BQeeD4hDDhMyhRUvs7rm7JrMYmwBgPNyNSW7nXR7pP1Jy4SRSqdp-CWx7-hnj8EO1Dva9cdkte3QReudPNKTty5FerbpQDvvvNX0jHZ_SPGGXBl5jHj7d-fk4_npff2abd9eNuvHbaZ4WaZMKZ3nBWLNeM5RlWZZKSVNYQpdoyxK1uDKLMHUy8YAb5oKL79SSlOxgkGVz0kx9qrgYwxoxCnYToZvwUBcXIhWjC7ExYUYXQyxhzGGw7Yvi0FEZdEp1DagSkJ7-3_BDwbNb_U
Cites_doi 10.1016/j.tcs.2020.11.034
10.1016/j.jcss.2021.09.004
10.1016/0020-0190(79)90117-0
10.1145/3396375
ContentType Journal Article
Copyright 2023 Elsevier B.V.
Copyright_xml – notice: 2023 Elsevier B.V.
DBID AAYXX
CITATION
DOI 10.1016/j.comgeo.2023.102030
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
ExternalDocumentID 10_1016_j_comgeo_2023_102030
S0925772123000500
GroupedDBID --K
--M
-DZ
.DC
.~1
0R~
1B1
1RT
1~.
1~5
29F
4.4
457
4G.
5GY
5VS
6I.
7-5
71M
8P~
9JN
AACTN
AAEDT
AAEDW
AAFTH
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
ABAOU
ABBOA
ABFNM
ABMAC
ABVKL
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFS
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADMUD
AEBSH
AEKER
AEXQZ
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AIALX
AIEXJ
AIGVJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BLXMC
CS3
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
GBLVA
GBOLZ
HVGLF
HZ~
IHE
IXB
J1W
KOM
LG9
M26
M41
MHUIS
MO0
N9A
NCXOZ
O-L
O9-
OAUVE
OK1
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RIG
RNS
ROL
RPZ
SDF
SDG
SDP
SES
SEW
SPC
SPCBC
SSV
SSW
SSZ
T5K
UHS
WUQ
XPP
ZMT
~G-
AATTM
AAXKI
AAYWO
AAYXX
ABJNI
ABWVN
ACLOT
ACRPL
ADNMO
ADVLN
AEIPS
AFJKZ
AGQPQ
AIIUN
ANKPU
APXCP
CITATION
EFKBS
~HD
ID FETCH-LOGICAL-c255t-ccd334ee71232ec5f86ccaf4f4d7ea451be9f80f78bf02bb6eee71aaaf6141063
IEDL.DBID .~1
ISSN 0925-7721
IngestDate Thu Oct 16 04:46:26 EDT 2025
Fri Feb 23 02:37:11 EST 2024
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Keywords Lower bounds
Data structures
Range updates
Range sum queries
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c255t-ccd334ee71232ec5f86ccaf4f4d7ea451be9f80f78bf02bb6eee71aaaf6141063
ORCID 0000-0003-3883-5452
ParticipantIDs crossref_primary_10_1016_j_comgeo_2023_102030
elsevier_sciencedirect_doi_10_1016_j_comgeo_2023_102030
PublicationCentury 2000
PublicationDate December 2023
2023-12-00
PublicationDateYYYYMMDD 2023-12-01
PublicationDate_xml – month: 12
  year: 2023
  text: December 2023
PublicationDecade 2020
PublicationTitle Computational geometry : theory and applications
PublicationYear 2023
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References Henzinger, Lincoln, Saha (br0150) 2021
Kara, Nikolic, Olteanu, Zhang (br0180) 2020
Casel, Schmid (br0070) 2021
Lau, Ritossa (br0190) 2021
Clifford, Grønlund, Green Larsen, Starikovskaya (br0080) 2018
Kara, Ngo, Nikolic, Olteanu, Zhang (br0170) 2020; 45
Ibtehaz, Kaykobad, Sohel Rahman (br0160) 2021; 854
Probst Gutenberg, Vassilevska Williams, Wein (br0110) 2020
de Berg, Cheong, van Kreveld, Overmars (br0100) 2008
Henzinger, Lincoln, Neumann, Vassilevska Williams (br0140) 2017
Le, Milenkovic, Solomon, Vassilevska Williams (br0200) 2022
Bergamaschi, Henzinger, Probst Gutenberg, Vassilevska Williams, Wein (br0030) 2021
Berkholz, Keppeler, Schweikardt (br0050) 2018
Berkholz, Keppeler, Schweikardt (br0040) 2017
Yang, Wan (br0240) 2020
Abboud, Dahlgaard (br0010) 2016
Soren (br0090) 2016
Mishra (br0220) 2013
Tao, Yi (br0230) 2022; 124
Bentley (br0020) 1979; 8
Berkholz, Merz (br0060) 2021
Henzinger, Krinninger, Nanongkai, Saranurak (br0120) 2015
Henzinger, Krinninger, Nanongkai, Saranurak (br0130) 2015
Lu, Tao (br0210) 2021
Henzinger (10.1016/j.comgeo.2023.102030_br0130)
Yang (10.1016/j.comgeo.2023.102030_br0240)
Soren (10.1016/j.comgeo.2023.102030_br0090) 2016
de Berg (10.1016/j.comgeo.2023.102030_br0100) 2008
Berkholz (10.1016/j.comgeo.2023.102030_br0060) 2021
Lu (10.1016/j.comgeo.2023.102030_br0210) 2021
Bentley (10.1016/j.comgeo.2023.102030_br0020) 1979; 8
Probst Gutenberg (10.1016/j.comgeo.2023.102030_br0110) 2020
Kara (10.1016/j.comgeo.2023.102030_br0180) 2020
Bergamaschi (10.1016/j.comgeo.2023.102030_br0030) 2021
Ibtehaz (10.1016/j.comgeo.2023.102030_br0160) 2021; 854
Clifford (10.1016/j.comgeo.2023.102030_br0080) 2018
Mishra (10.1016/j.comgeo.2023.102030_br0220)
Tao (10.1016/j.comgeo.2023.102030_br0230) 2022; 124
Abboud (10.1016/j.comgeo.2023.102030_br0010) 2016
Berkholz (10.1016/j.comgeo.2023.102030_br0040) 2017
Henzinger (10.1016/j.comgeo.2023.102030_br0150) 2021
Lau (10.1016/j.comgeo.2023.102030_br0190) 2021
Berkholz (10.1016/j.comgeo.2023.102030_br0050) 2018
Henzinger (10.1016/j.comgeo.2023.102030_br0140) 2017
Kara (10.1016/j.comgeo.2023.102030_br0170) 2020; 45
Casel (10.1016/j.comgeo.2023.102030_br0070) 2021
Henzinger (10.1016/j.comgeo.2023.102030_br0120) 2015
Le (10.1016/j.comgeo.2023.102030_br0200) 2022
References_xml – volume: 8
  start-page: 244
  year: 1979
  end-page: 251
  ident: br0020
  article-title: Decomposable searching problems
  publication-title: Inf. Process. Lett.
– year: 2016
  ident: br0090
  article-title: On the hardness of partially dynamic graph problems and connections to diameter
  publication-title: Proceedings of International Colloquium on Automata, Languages and Programming (ICALP)
– start-page: 1836
  year: 2021
  end-page: 1855
  ident: br0030
  article-title: New techniques and fine-grained hardness for dynamic near-additive spanners
  publication-title: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
– year: 2018
  ident: br0080
  article-title: Upper and lower bounds for dynamic data structures on strings
  publication-title: Proceedings of Symposium on Theoretical Aspects of Computer Science (STACS)
– year: 2015
  ident: br0130
  article-title: Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture
– start-page: 303
  year: 2017
  end-page: 318
  ident: br0040
  article-title: Answering conjunctive queries under updates
  publication-title: Proceedings of ACM Symposium on Principles of Database Systems (PODS)
– volume: 124
  start-page: 41
  year: 2022
  end-page: 64
  ident: br0230
  article-title: Intersection joins under updates
  publication-title: J. Comput. Syst. Sci.
– start-page: 157
  year: 2021
  ident: br0150
  article-title: The complexity of average-case dynamic subgraph counting
  publication-title: Electron. Colloq. Comput. Complex.
– year: 2008
  ident: br0100
  article-title: Computational Geometry: Algorithms and Applications
– start-page: 21
  year: 2015
  end-page: 30
  ident: br0120
  article-title: Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture
  publication-title: Proceedings of ACM Symposium on Theory of Computing (STOC)
– year: 2022
  ident: br0200
  article-title: Dynamic matching algorithms under vertex updates
  publication-title: Innovations in Theoretical Computer Science (ITCS)
– start-page: 375
  year: 2020
  end-page: 392
  ident: br0180
  article-title: Trade-offs in static and dynamic evaluation of hierarchical queries
  publication-title: Proceedings of ACM Symposium on Principles of Database Systems (PODS)
– year: 2021
  ident: br0210
  article-title: Towards optimal dynamic indexes for approximate (and exact) triangle counting
  publication-title: Proceedings of International Conference on Database Theory (ICDT)
– year: 2017
  ident: br0140
  article-title: Conditional hardness for sensitivity problems
  publication-title: Innovations in Theoretical Computer Science (ITCS)
– volume: 45
  year: 2020
  ident: br0170
  article-title: Maintaining triangle queries under updates
  publication-title: ACM Trans. Database Syst.
– year: 2018
  ident: br0050
  article-title: Answering ucqs under updates and in the presence of integrity constraints
  publication-title: Proceedings of International Conference on Database Theory (ICDT)
– start-page: 153
  year: 2020
  end-page: 166
  ident: br0110
  article-title: New algorithms and hardness for incremental single-source shortest paths in directed graphs
  publication-title: Proceedings of ACM Symposium on Theory of Computing (STOC)
– year: 2020
  ident: br0240
  article-title: On updating and querying submatrices
– start-page: 402
  year: 2021
  end-page: 415
  ident: br0060
  article-title: Probabilistic databases under updates: Boolean query evaluation and ranked enumeration
  publication-title: Proceedings of ACM Symposium on Principles of Database Systems (PODS)
– year: 2021
  ident: br0190
  article-title: Algorithms and hardness for multidimensional range updates and queries
  publication-title: Innovations in Theoretical Computer Science (ITCS)
– start-page: 477
  year: 2016
  end-page: 486
  ident: br0010
  article-title: Popular conjectures as a barrier for dynamic planar graph algorithms
  publication-title: Proceedings of Annual IEEE Symposium on Foundations of Computer Science (FOCS)
– volume: 854
  start-page: 30
  year: 2021
  end-page: 43
  ident: br0160
  article-title: Multidimensional segment trees can do range updates in poly-logarithmic time
  publication-title: Theor. Comput. Sci.
– year: 2021
  ident: br0070
  article-title: Fine-grained complexity of regular path queries
  publication-title: Proceedings of International Conference on Database Theory (ICDT)
– year: 2013
  ident: br0220
  article-title: On updating and querying sub-arrays of multidimensional arrays
– year: 2008
  ident: 10.1016/j.comgeo.2023.102030_br0100
– year: 2018
  ident: 10.1016/j.comgeo.2023.102030_br0080
  article-title: Upper and lower bounds for dynamic data structures on strings
– start-page: 21
  year: 2015
  ident: 10.1016/j.comgeo.2023.102030_br0120
  article-title: Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture
– start-page: 157
  year: 2021
  ident: 10.1016/j.comgeo.2023.102030_br0150
  article-title: The complexity of average-case dynamic subgraph counting
  publication-title: Electron. Colloq. Comput. Complex.
– volume: 854
  start-page: 30
  year: 2021
  ident: 10.1016/j.comgeo.2023.102030_br0160
  article-title: Multidimensional segment trees can do range updates in poly-logarithmic time
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2020.11.034
– ident: 10.1016/j.comgeo.2023.102030_br0240
– year: 2021
  ident: 10.1016/j.comgeo.2023.102030_br0190
  article-title: Algorithms and hardness for multidimensional range updates and queries
– ident: 10.1016/j.comgeo.2023.102030_br0220
– volume: 124
  start-page: 41
  year: 2022
  ident: 10.1016/j.comgeo.2023.102030_br0230
  article-title: Intersection joins under updates
  publication-title: J. Comput. Syst. Sci.
  doi: 10.1016/j.jcss.2021.09.004
– start-page: 303
  year: 2017
  ident: 10.1016/j.comgeo.2023.102030_br0040
  article-title: Answering conjunctive queries under updates
– volume: 8
  start-page: 244
  issue: 5
  year: 1979
  ident: 10.1016/j.comgeo.2023.102030_br0020
  article-title: Decomposable searching problems
  publication-title: Inf. Process. Lett.
  doi: 10.1016/0020-0190(79)90117-0
– volume: 45
  issue: 3
  year: 2020
  ident: 10.1016/j.comgeo.2023.102030_br0170
  article-title: Maintaining triangle queries under updates
  publication-title: ACM Trans. Database Syst.
  doi: 10.1145/3396375
– start-page: 402
  year: 2021
  ident: 10.1016/j.comgeo.2023.102030_br0060
  article-title: Probabilistic databases under updates: Boolean query evaluation and ranked enumeration
– year: 2022
  ident: 10.1016/j.comgeo.2023.102030_br0200
  article-title: Dynamic matching algorithms under vertex updates
– ident: 10.1016/j.comgeo.2023.102030_br0130
– start-page: 375
  year: 2020
  ident: 10.1016/j.comgeo.2023.102030_br0180
  article-title: Trade-offs in static and dynamic evaluation of hierarchical queries
– start-page: 477
  year: 2016
  ident: 10.1016/j.comgeo.2023.102030_br0010
  article-title: Popular conjectures as a barrier for dynamic planar graph algorithms
– year: 2021
  ident: 10.1016/j.comgeo.2023.102030_br0210
  article-title: Towards optimal dynamic indexes for approximate (and exact) triangle counting
– start-page: 153
  year: 2020
  ident: 10.1016/j.comgeo.2023.102030_br0110
  article-title: New algorithms and hardness for incremental single-source shortest paths in directed graphs
– year: 2017
  ident: 10.1016/j.comgeo.2023.102030_br0140
  article-title: Conditional hardness for sensitivity problems
– start-page: 1836
  year: 2021
  ident: 10.1016/j.comgeo.2023.102030_br0030
  article-title: New techniques and fine-grained hardness for dynamic near-additive spanners
– year: 2021
  ident: 10.1016/j.comgeo.2023.102030_br0070
  article-title: Fine-grained complexity of regular path queries
– year: 2016
  ident: 10.1016/j.comgeo.2023.102030_br0090
  article-title: On the hardness of partially dynamic graph problems and connections to diameter
– year: 2018
  ident: 10.1016/j.comgeo.2023.102030_br0050
  article-title: Answering ucqs under updates and in the presence of integrity constraints
SSID ssj0002259
Score 2.3366332
Snippet Let P be a set of n points in Rd where each point p∈P carries a weight drawn from a commutative monoid (M,+,0). Given a d-rectangle rupd (i.e., an orthogonal...
SourceID crossref
elsevier
SourceType Index Database
Publisher
StartPage 102030
SubjectTerms Data structures
Lower bounds
Range sum queries
Range updates
Title Range updates and range sum queries on multidimensional points with monoid weights
URI https://dx.doi.org/10.1016/j.comgeo.2023.102030
Volume 115
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Baden-Württemberg Complete Freedom Collection (Elsevier)
  issn: 0925-7721
  databaseCode: GBLVA
  dateStart: 20110101
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://www.sciencedirect.com
  omitProxy: true
  ssIdentifier: ssj0002259
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: Elsevier SD Complete Freedom Collection [SCCMFC]
  issn: 0925-7721
  databaseCode: ACRLP
  dateStart: 20211201
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://www.sciencedirect.com
  omitProxy: true
  ssIdentifier: ssj0002259
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: Science Direct
  issn: 0925-7721
  databaseCode: .~1
  dateStart: 19950101
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://www.sciencedirect.com
  omitProxy: true
  ssIdentifier: ssj0002259
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: Science Direct
  issn: 0925-7721
  databaseCode: AIKHN
  dateStart: 20211201
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://www.sciencedirect.com
  omitProxy: true
  ssIdentifier: ssj0002259
  providerName: Elsevier
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwELYqWGBAPEV5VB5YQ9PYiZOxqqgKqB0KlbpZTmyjMCRRk4qN347PTnhIiIElUiw7ij6fznf2d58RuvHlyNdSpB7UcXo0CBJPEGoeSSDhVC0kAgqc54totqIP63DdQ5OuFgZola3vdz7deuu2ZdiiOazyfPjkJ8bcGLheq2ICeTulDG4xuH3_onkYe3V6e3Btq-ndlc9Zjpf59ostAQwIaBhYLvRvy9O3JWd6iA7aWBGP3e8coZ4qjtH-_FNotT5ByyUUB-BtBYl7jUUh8ca2GAPDxuVDIozLAlveoAQlf6fCgasyL5oawzYsNpZY5hK_2V3S-hStpnfPk5nXXpPgZSYfaLwsk4RQpRhERyoLdRyZadFUU8mUoOEoVYmOfc3iVPtBmkYK-gohdAQkz4icoZ2iLNQ5wjIz0YQISRDHJk0MooSkYZxIxTSjWiakj7wOHV45NQze0cReuUOTA5rcodlHrIOQ_5hVbhz2nyMv_j3yEu3Bm6OcXKGdZrNV1yZwaNKBtYwB2h3fP84WH4Pjw2s
linkProvider Elsevier
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwELaqMgAD4inK0wNraBo7cTKiiqpA26G0UjfLiW0UhiRqUrHx2_E5CQ8JMbBkcOwo-nw639nffUboxpUDV0sRO1DH6VDPixxBqHlEnoRTNZ8IKHCezoLxkj6u_FUHDdtaGKBVNr6_9unWWzct_QbNfpGm_Wc3MubGwPVaFROTt29R32OQgd2-f_E8jMHWgntwb6vp3tbPWZKX-fiLrQH0CIgYWDL0b-vTtzVntI_2mmAR39X_c4A6KjtEu9NPpdXyCM3nUB2ANwVk7iUWmcRr22IsDBufD5kwzjNsiYMSpPxrGQ5c5GlWlRj2YbExxTyV-M1uk5bHaDm6XwzHTnNPgpOYhKBykkQSQpViEB6pxNdhYOZFU00lU4L6g1hFOnQ1C2PtenEcKOgrhNABsDwDcoK6WZ6pU4RlYsIJ4RMvDE2e6AURif0wkoppRrWMSA85LTq8qOUweMsTe-U1mhzQ5DWaPcRaCPmPaeXGY_858uzfI6_R9ngxnfDJw-zpHO3Am5p_coG61XqjLk0UUcVX1ko-AEbixQA
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=Range+updates+and+range+sum+queries+on+multidimensional+points+with+monoid+weights&rft.jtitle=Computational+geometry+%3A+theory+and+applications&rft.au=Lu%2C+Shangqi&rft.au=Tao%2C+Yufei&rft.date=2023-12-01&rft.issn=0925-7721&rft.volume=115&rft.spage=102030&rft_id=info:doi/10.1016%2Fj.comgeo.2023.102030&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_comgeo_2023_102030
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0925-7721&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0925-7721&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0925-7721&client=summon