The mobility workshop is intended to discuss research questions that are of interest at present or likely to be important in near future. Mobility analsyis is a current topic in computational geometry as well as in machine learning and data mining communities. The workshop features a collection of invited and contributed talks across these disciplines,
All times are in Eastern Daylight Time (UTC -4)
|Wednesday June 9|
|1:40 – 2:25 pm||Invited talk: Data structures for proximity searching under the Fréchet distance
Anne Driemel, University of Bonn. Abstract
|2:25 – 3:10 pm||Brief announcements session: applications, datasets, libraries, open problems etc.
Chair: Abhirup Ghosh See call for submissions
|Thursday June 10|
|1:20 – 2:50 pm||Contributed Talks
1:20: Orientation-Preserving Vectorized Distance Between Curves. paper
Jeff Phillips and Hasan Pourmahmood-Aghababa
1:35: Route Reconstruction from Traffic Flow via Representative Trajectories.
Bram Custers, Wouter Meulemans, Bettina Speckmann and Kevin Verbeek
1:50: A Game Theoretic Approach to Transport Planning
Alastair Maxwell and Rik Sarkar
2:05: Exact Vertex-Aligned Sub-Trajectory Proximity Searches under the Continuous Fréchet Distance
Joachim Gudmundsson, Martin P. Seybold and John Pfeifer
2:20: Toward Persistent Homology for Moving Points
Ondrej Draganov, Farid Karimipour and Herbert Edelsbrunner
|2:50 – 3:00 pm||Break|
|3:00 – 3:45 pm||Invited Talk: Cyber-Physical Systems for Large-Scale On-demand Delivery
Desheng Zhang, Rutgers University. Abstract
|3:45 – 4:30 pm||Panel Discussion: Future research in geometry of mobility
Panel: Anne Driemel, Desheng Zhang, Jie Gao. Host: Rik Sarkar
See instructions on the website for CGWeek 2021.
If there is something you would like others to know about, or something you want to ask others, please submit! It may be a dataset, library, ongoing work, or something else. We will allocate a few minutes for you to talk about it.
The item does not have to be your research, anything of interest to researchers in mobility can be submitted. We will compile a list of resources useful for all of us.
We think the following types of items can be interesting (related to mobility, trajectories, geospatial data, location data, etc):
Please send submission as follows:
Send an email to geomobility21 [AT] easychair.org, with subject “Brief announcement”
Include in your email:
Speaker: Anne Driemel
Abstract: We review different techniques for building a data structure that preprocesses a set of polygonal curves and answers proximity queries under the Fréchet distance. In particular, we consider the near-neighbor problem, where the query should return one curve that lies within a Frechet distance r to the query curve. In the approximate setting, the query radius r can be relaxed by the query. We are interested in the preprocessing time, space and query time complexity that can be achieved when the data structure takes n polygonal curves, each with m vertices as input, and allows to query with polygonal curves of k vertices. We first discuss exact data structures based on multi-level partition trees which can be used in the exact setting, but are very expensive with polylog-factors exponential in k. For the discrete Fréchet distance it is possible—by enumerating a discrete subset of the query space— to build a (1+\eps)-approximate data structure that uses space linear in n and exponential in k and query time only depending on k. We discuss some challenges that arise when translating this technique to the setting of the continuous Frechet distance and discuss some recent advances in this direction.
Speaker: Desheng Zhang
Abstract: In this talk, I will introduce our group’s work on the foundations and applications of Cyber-Physical Systems with a concrete use case of on-demand delivery as part of the Gig Economy. The key challenge for on-demand delivery is to obtain real-time gig worker mobility status in a cost-efficient approach to enable timely delivery and efficient order scheduling. However, the existing mobility sensing approaches in both industry and academy has limited scalability due to cost issues. Based on our collaboration with Alibaba On-demand Delivery Platform, I will introduce a nationwide sensing system called aBeacon exploring a hybrid solution of hardware, software, and human participation. aBeacon detects and infers the status of more than 3 million workers in 364 cities in China via a sophisticated tradeoff between performance, cost, and privacy. I will provide some lessons learned and insights when aBeacon evolves from the conception to design, deployment, validation, and operation. Finally, I will discuss a few new challenges and open problems in Cyber-Physical Systems for mobility sensing and applications.
Mobility analysis is approached with different tools and techniques in different research areas. The aim of this workshop is to bring togther researchers in multiple areas incluidng computational geometry, machine learning and data mining to discuss future research in mobility. The workshop will include invited talks, contributed talks and a discussion and open problem session.
We invite short abstracts for contibuted talks of 10 to 20 minutes duration. The scope of the workshop includes both theoretical an applied research – algorithms, theory, experimental results, experiences related to processing trajectories, GPS, and other forms of locaiton and mobility data.
The talks can be based on recent results, demonstrations or open problems. There will be no formal proceedings. We invite works at all stages of development – recently published, under review or in progress.
The workshop will be held online over half a day during the CG Week 2021 and SoCG (June 7 – 11).
Extended abstract, at most 2 pages, in PDF format.
Submission via Easychair: https://easychair.org/conferences/?conf=geomobility21