Cited By
View all- Oliver DXu BPao Y(2019)ACM SIGSPATIAL cup 2018 - identifying upstream features in large spatial networksSIGSPATIAL Special10.1145/3355491.335549811:1(32-35)Online publication date: 5-Aug-2019
Using biconnected components for efficient identification of upstream features in large spatial networks (GIS cup)
Authors: 
Zach Goldthorpe, Jason Cannon, Jesse Farebrother, Zachary Friggstad, and Mario A. NascimentoAuthors Info & Claims
Zach Goldthorpe, Jason Cannon, Jesse Farebrother, Zachary Friggstad, and Mario A. NascimentoAuthors Info & ClaimsNovember 2018
Pages 630 - 633
Abstract
This paper presents a solution to the problem posed in the ACM SIGSPATIAL GIS Cup 2018, namely to identify all upstream features---nodes and edges existing on simple paths between starting points and controllers---in a given spatial network. Our approach is based primarily on a two-sweep depth-first search which decomposes a graph into its biconnected components prior to collecting the upstream features. Our algorithm runs in linear time in the size of the graph and, in practice, is able to solve large instances with millions of features within seconds on an ordinary personal laptop, identifying features if and only if they are upstream.
References
[1]
Adrian Bondy and M. Ram Murty. 2008. Graph Theory. Graduate Texts in Mathematics, Vol. 244. Springer-Verlag London.
[2]
John Hopcroft and Robert Tarjan. 1973. Algorithm 447: Efficient Algorithms for Graph Manipulation. Commun. ACM 16, 6 (June 1973), 372--378.
[3]
Bill Meehan. 2013. Modeling Electric Distribution with GIS. Esri Press.
[4]
Karl Menger. 1927. Zur allgemeinen Kurventheorie. Fundamenta Mathematicae 10, 1 (1927), 96--115.
[5]
George M. Slota and Kamesh Madduri. 2014. Simple parallel biconnectivity algorithms for multicore platforms. In 21st International Conference on High Performance Computing, HiPC 2014, Goa, India, December 17-20, 2014. IEEE Computer Society, 1--10.
Index Terms
- Using biconnected components for efficient identification of upstream features in large spatial networks (GIS cup)
Recommendations
Fast analysis of upstream features on spatial networks (GIS cup)
SIGSPATIAL '18: Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information SystemsWe present a fast linear time algorithm that uses a block-cut tree for identifying upstream features from a set of starting points in a network. Our implementation has been parallelized and it can process a dataset with 32 million features in less than ...
Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs
We present space-efficient algorithms for computing cut vertices in a given graph with n vertices and m edges in linear time using $$O(n+\min \{m,n\log \log n\})$$O(n+min{m,nloglogn}) bits. With the same time and using $$O(n+m)$$O(n+m) bits, we can ...
On the minimum local-vertex-connectivity augmentation in graphs
Given a graph G and target values r(u,v) prescribed for each pair of vertices u and v, we consider the problem of augmenting G by a smallest set F of new edges such that the resulting graph G+F has at least r(u,v) internally disjoint paths between each ...
Comments
Information & Contributors
Information
Published In
November 2018
655 pages
ISBN:9781450358897
DOI:10.1145/3274895
- General Chairs:
- Farnoush Banaei-Kashani,
- Erik Hoel,
- Program Chairs:
- Ralf Hartmut Güting,
- Roberto Tamassia,
- Li Xiong
Copyright © 2018 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 06 November 2018
Check for updates
Author Tags
Qualifiers
- Short-paper
Conference
SIGSPATIAL '18
Sponsor:
SIGSPATIAL '18: 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
November 6 - 9, 2018
Washington, Seattle
Acceptance Rates
SIGSPATIAL '18 Paper Acceptance Rate 30 of 150 submissions, 20%;
Overall Acceptance Rate 220 of 1,116 submissions, 20%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 97Total Downloads
- Downloads (Last 12 months)7
- Downloads (Last 6 weeks)1
Other Metrics
Citations
Cited By
View all- Oliver DXu BPao Y(2019)ACM SIGSPATIAL cup 2018 - identifying upstream features in large spatial networksSIGSPATIAL Special10.1145/3355491.335549811:1(32-35)Online publication date: 5-Aug-2019
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in