发布求助
文献互助 智能选刊 最新文献

Spatial Gems, Volume 1最新文献

筛选
英文 中文
Spatial Gems, Volume 1 空间宝石，第一卷
Spatial Gems, Volume 1 Pub Date : 2022-08-05 DOI: 10.1145/3548732
{"title":"Spatial Gems, Volume 1","authors":"","doi":"10.1145/3548732","DOIUrl":"https://doi.org/10.1145/3548732","url":null,"abstract":"","PeriodicalId":330118,"journal":{"name":"Spatial Gems, Volume 1","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129651439","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
TINET: Triangulated Irregular Networks Evolving in Time TINET:随时间演化的不规则三角网
Spatial Gems, Volume 1 Pub Date : 2022-08-05 DOI: 10.1145/3548732.3548747
Goce Trajcevski, Prabin Giri, Xu Teng, H. Hashemi
{"title":"TINET: Triangulated Irregular Networks Evolving in Time","authors":"Goce Trajcevski, Prabin Giri, Xu Teng, H. Hashemi","doi":"10.1145/3548732.3548747","DOIUrl":"https://doi.org/10.1145/3548732.3548747","url":null,"abstract":"","PeriodicalId":330118,"journal":{"name":"Spatial Gems, Volume 1","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123351775","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Flexible Computation of Multidimensional Histograms 多维直方图的灵活计算
Spatial Gems, Volume 1 Pub Date : 2022-08-05 DOI: 10.1145/3548732.3548746
Samriddhi Singla, A. Eldawy
{"title":"Flexible Computation of Multidimensional Histograms","authors":"Samriddhi Singla, A. Eldawy","doi":"10.1145/3548732.3548746","DOIUrl":"https://doi.org/10.1145/3548732.3548746","url":null,"abstract":"","PeriodicalId":330118,"journal":{"name":"Spatial Gems, Volume 1","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123705504","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Minimal Representations of Polygons and Polyhedra 多边形和多面体的最小表示
Spatial Gems, Volume 1 Pub Date : 2022-08-05 DOI: 10.1145/3548732.3548738
W. Randolph Franklin
{"title":"Minimal Representations of Polygons and Polyhedra","authors":"W. Randolph Franklin","doi":"10.1145/3548732.3548738","DOIUrl":"https://doi.org/10.1145/3548732.3548738","url":null,"abstract":"We present several simple representations of polygon and polyhedra that permit the efficient parallel computation of area and volume. They are particularly useful for computing the areas of the nonempty intersections between pairs of faces in two overlapping planar graphs in GIS, or the volumes of nonempty intersections between pairs of tetrahedra in two overlapping triangulations of a polyhedron in CAD. Both applications have been implemented on multicore Intel Xeons and tested on large datasets. The representations store the minimal types of information required for computation, and never need to store edge loops and face shells, or even most adjacency relations. The representations are sets of tuples or small fixed-size sets, and can be processed in parallel with map-reduce operations.","PeriodicalId":330118,"journal":{"name":"Spatial Gems, Volume 1","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126111120","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Employing GPUs to Accelerate Exact Geometric Predicates for 3D Geospatial Processing 利用gpu加速精确几何谓词的三维地理空间处理
Spatial Gems, Volume 1 Pub Date : 2022-08-05 DOI: 10.1145/3548732.3548744
M. Menezes, S. V. G. Magalhães, M. A. D. Oliveira, W. Randolph Franklin, Bruno F. Coelho
{"title":"Employing GPUs to Accelerate Exact Geometric Predicates for 3D Geospatial Processing","authors":"M. Menezes, S. V. G. Magalhães, M. A. D. Oliveira, W. Randolph Franklin, Bruno F. Coelho","doi":"10.1145/3548732.3548744","DOIUrl":"https://doi.org/10.1145/3548732.3548744","url":null,"abstract":"This paper presents a technique to use GPUs to accelerate the computation of 3D geometric predicates. A common predicate is computing the orientation of four 3D points, which is a subproblem in applications such as intersecting two 3D meshes. Since the higher level application may require billions of evaluations, efficiency is important. Accuracy is required since floating roundoff errors can cause topological impossibilities. One solution is to compute with rational numbers, but that is difficult to implement on a GPU because rationals’ sizes vary. Our solution is to compute on the GPU with interval arithmetic, but fall back to using rationals on the CPU if the interval computed on the GPU includes the origin; i.e., its sign is unknown. Our experiment with a dataset of hard rock mining drill holes show that this fallback to the CPU is rarely necessary; so that our technique gave a 17 times speedup compared to a sequential implementation.","PeriodicalId":330118,"journal":{"name":"Spatial Gems, Volume 1","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125517391","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
The Brownian Bridge for Space–Time Interpolation 时空插值的布朗桥
Spatial Gems, Volume 1 Pub Date : 2022-08-05 DOI: 10.1145/3548732.3548742
J. Krumm
{"title":"The Brownian Bridge for Space–Time Interpolation","authors":"J. Krumm","doi":"10.1145/3548732.3548742","DOIUrl":"https://doi.org/10.1145/3548732.3548742","url":null,"abstract":"9.","PeriodicalId":330118,"journal":{"name":"Spatial Gems, Volume 1","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130629080","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
A Scalable In-Memory Solution for Real-Time K Nearest Search on Road Network 道路网络实时K最近搜索的可扩展内存解决方案
Spatial Gems, Volume 1 Pub Date : 2022-08-05 DOI: 10.1145/3548732.3548743
Hao-Hsiang Wu, Ming-Shan Su, Thanh Dat Le, Nuo Xu, Guanfeng Wang, M. Stroe
{"title":"A Scalable In-Memory Solution for Real-Time K Nearest Search on Road Network","authors":"Hao-Hsiang Wu, Ming-Shan Su, Thanh Dat Le, Nuo Xu, Guanfeng Wang, M. Stroe","doi":"10.1145/3548732.3548743","DOIUrl":"https://doi.org/10.1145/3548732.3548743","url":null,"abstract":"","PeriodicalId":330118,"journal":{"name":"Spatial Gems, Volume 1","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132337182","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Heat Map Segmentation 热图分割
Spatial Gems, Volume 1 Pub Date : 2022-08-05 DOI: 10.1145/3548732.3548734
G. Wolff
{"title":"Heat Map Segmentation","authors":"G. Wolff","doi":"10.1145/3548732.3548734","DOIUrl":"https://doi.org/10.1145/3548732.3548734","url":null,"abstract":"Many geospatial datasets can be represented as a heat map, such as rainfall, population density, terrain elevation, and others. These heat maps tend to form clusters of high density areas among a background of low density areas. This gem presents an automatic way to detect such clusters, and segment the heat map into areas. Experiments are conducted for two datasets which correlate to population density and show that the segmentation aligns with metropolitan areas and is stable to the choice of dataset. The segmentation described in this gem can potentially aid geospatial algorithms by supplying a smart divide-and-conquer strategy, such that the algorithm does not need to run for the entire Earth, but rather there can be a fine-grained model for each area.","PeriodicalId":330118,"journal":{"name":"Spatial Gems, Volume 1","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130464682","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Using Segment Fraction for Road-Network Locations 使用分段分数的道路网络位置
Spatial Gems, Volume 1 Pub Date : 2022-08-05 DOI: 10.1145/3548732.3548745
Yuanyuan Pao
{"title":"Using Segment Fraction for Road-Network Locations","authors":"Yuanyuan Pao","doi":"10.1145/3548732.3548745","DOIUrl":"https://doi.org/10.1145/3548732.3548745","url":null,"abstract":"When dealing with locations on the road network, geographic coordinates, com­ monly represented in the form of (latitude, longitude), can often be difficult to use and are hard to interpret. Not only do these coordinates omit any explicit road network information, such as what road segment the location belongs to, but even simple operations such as speed computation cannot be performed with­ out summing road distance over the segment geometry. In certain applications, map projection [Yang et al. 1999] and linear referencing [Scarponcini 2002] have been utilized to make locations easier to analyze or to associate certain attributes without compromising precision. We propose extending the concept of linear ref­ erencing to the entirety of road-based locations and show that we can perform local searches, speed computation, location prediction, and interpolation with simple, linear formulas. Using Segment Fraction for Road-Network Locations","PeriodicalId":330118,"journal":{"name":"Spatial Gems, Volume 1","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130982538","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Speed Distribution from Normally Distributed Location Measurements 正态分布位置测量的速度分布
Spatial Gems, Volume 1 Pub Date : 2022-08-05 DOI: 10.1145/3548732.3548740
J. Krumm
{"title":"Speed Distribution from Normally Distributed Location Measurements","authors":"J. Krumm","doi":"10.1145/3548732.3548740","DOIUrl":"https://doi.org/10.1145/3548732.3548740","url":null,"abstract":"7.","PeriodicalId":330118,"journal":{"name":"Spatial Gems, Volume 1","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124072887","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信