Carola Wenk's web pages.
|
Geometric and Topological Algorithms for Analyzing Road
Network Data
|
This page describes the scope and results funded by the following grant:
7/1/16 - 6/30/18 |
"AF: Small: Collaborative Research: Geometric and Topological Algorithms for Analyzing Road
Network Data", National Science Foundation. Multi-PI proposal with PIs Carola Wenk (Tulane University), Brittany Fasy
(Montana State University), Yusu Wang (Ohio State University). Tulane grant amount: $158,052.
Total grant amount: $499,975.
|
Any opinions, findings, and conclusions or
recommendations expressed in this material are those of the author(s)
and do not necessarily reflect the views of the National Science
Foundation.
Abstract
The project aims to develop theoretically grounded, effective methods for analyzing data associated with road networks -- using graphs that represent road networks as a framework for analyzing network data. Thanks to the spread of GPS-enabled devices, trajectory data has become ubiquitous. Many other sources, including census data and crime statistics, have addresses or geographic locations that link to an underlying road network.
Algorithms with mathematical guarantees will be developed to align trajectories to the network under natural and realistic properties of true trajectories, to reconstruct road networks from trajectory and density data. It will also provide two frameworks for comparing data-endowed networks at different levels. While the problems of trajectory alignment, map reconstruction, and map comparison have attracted a lot of attention in the GIS community, most approaches are ad-hoc, provide no quality guarantees, and are limited to post-hoc analysis. This project will provide novel theoretical foundations combining approaches from computational topology and geometry, and will further advance the state-of-the-art of the field of topological / geometric data analysis.
The PIs will continue to combine educational and research activities through this project. Students will be tightly integrated into the research and practical implementation of this project, and will be trained in integrating geometric thinking, algorithms development, and (trajectory) data analysis. The combination of such skills is increasingly important in data science. Topics involved in this project will enrich the course material and curriculum development at each of the three institutions.
Project Leadership:
Students:
Current:
- Sushovan Majhi, Tulane University (PhD student, Mathematics)
- Samuel Micka, Montana State University (PhD student, Computer Science)
- Tianqi Li, Ohio State University (PhD student, Computer Science)
- Jiayuan Wang, Ohio State University (PhD student, Computer Science)
Past:
- Jason Georgis, Tulane University (undergraduate, Mathematics)
- Parker Evans, Tulane University (undergraduate, Mathematics)
- Selçuk Karakoç, Tulane University (PhD student, Mathematics)
Publications and Activities:
- "Distance Measures for Embedded Graphs", (H.A. Akitaya, M. Buchin, B. Kilgus, S. Sijben, C. Wenk),
accepted to 30th International Symposium on Algorithms and Computation (ISAAC),
2019. (arXiv:1812.09095)
- Sushovan Majhi's demo website f
or topological shape reconstruction, 2019
- "Threshold-Based Graph Reconstruction Using Discrete Morse Theory"
(B.T. Fasy, S. Majhi, C. Wenk), 28th Annual Fall Workshop on Computational Geometry,
4 pages, Queens College, Queens, NY, 2018.
- "A Middle Curve Based on Discrete Fréchet Distanc"e,
(H.-K. Ahn, H. Alt, M. Buchin, E. Oh, L. Scharf, C. Wenk), journal version,
in preparation.
- "On Minimum-Area Homotopies in the Plane", (B.T. Fasy, Selçuk Karakoç, C. Wenk),
in preparation.
- "Topological and Geometric Reconstruction of Geodesic Subspaces of of RN"
(B.T. Fasy, R. Komendarczyk, S. Majhi, C. Wenk), in preparation.
- "Combinatorial Properties of Self-Overlapping Curves Through Minimum Homotopy Area",
(P. Evans and C. Wenk), journal version, in submission.
- "Combinatorial Properties of Self-Overlapping Curves and Interior Boundaries",
(P. Evans, B.T. Fasy, C. Wenk), conference version, in preparation.
- "On Self-Overlapping Curves,
Interior Boundaries, and Minimum Area Homotopies", (Parker Evans),
Honors thesis, Tulane University, 2018.
- "Map-Matching Using Shortest Paths", (B.T. Fasy, E.W. Chambers, Y. Wang, C. Wenk),
accepted to Transactions on Spatial Algorithms and Systems, 2019.
- "Graph reconstruction by discrete Morse theory",
(T. Dey, J. Wang and Y. Wang), to appear in International Symposium
on Computational Geometry (SoCG), 2018.
- "Map-Matching Using Shortest Paths",
(B.T. Fasy, E.W. Chambers, Y. Wang, C. Wenk), 3rd International
Workshop on Interactive and Spatial Computing, Richardson, TX, 2018.
- "On Minimum Area Homotopies of Normal Curves in the Plane",
(B.T. Fasy, Selcuk Karakoc, C. Wenk),
arXiv:1707.02251, 2017.
- "Improved road network reconstructon using Discrete Morse theory",
(T. Dey, J. Wang, and Y. Wang), ACM SIGSPATIAL GIS, 2017.
- "Comparing Directed and Weighted Road Maps", (A. Bittner, B.T. Fasy, M. Grudzien,
S. Ghosh Hajra, J. Huang, K. Pelatt, C. Thatcher, A. Tumurbaatar, C. Wenk), AWM-IMA Springer series: Research in Computational Topology,
B.T. Fasy, E. Chambers, L. Ziegelmeier (eds.), Springer, 2017.
- "The minimum road trips problem",
(Samuel Micka and Brendan Mumey), 27th Annual Fall Workshop on
Computational Geometry, 2017
-
"Distance Measures for Embedded Graphs", (M. Buchin, S. Sijben, C. Wenk),
European Workshop on Computational Geometry:37-40, 2017.
- "On Minimum-Area Homotopies of Curves in the Plane", (C. Wenk), Invited talk,
Special Session on Applications of Topology and Geometry, Association for Women in
Mathematics (AWM) Research Symposium, University of California Los Angeles, 2017
- Dagstuhl seminar
"From Observations to Prediction of Movement",
(Organizers: M. Birkin, S. Dodge, B.T. Fasy, R.P. Mann), July 9-14, 2017.
- Dagstuhl seminar
"Applications of Topology to the Analysis of 1-Dimensional Objects",
(Organizers: B. Burton E.W. Chambers, M. Löffler, C. Wenk),
February 12-17, 2017.
- "Efficient Monitor Placement for Multipath Traffic Flows", (S. Micka), presentation,
International Highway Engineering Exchange Program (IHEEP) Helena, MT, 09/2016.
- "Homotopy visualizer",
(P. Evans, A. Burns, C. Wenk), Java code to visualize minimum-area homotopies contracting closed curves to a point, 2016.
Related Projects:
Last modified by Carola Wenk,
cwenk -at- tulane -dot- edu ,
08/26/2015 12:58:10