English
Related papers

Related papers: Looking for Bird Nests: Identifying Stay Points wi…

200 papers

Analyzing flow of objects or data at different granularities of space and time can unveil interesting insights or trends. For example, transportation companies, by aggregating passenger travel data (e.g., counting passengers traveling from…

Databases · Computer Science 2025-12-22 Chrysanthi Kosyfaki , Nikos Mamoulis , Reynold Cheng , Ben Kao

In this paper, we consider the problem of planning a path for a robot to monitor a known set of features of interest in an environment. We represent the environment as a graph with vertex weights and edge lengths. The vertices represent…

Data Structures and Algorithms · Computer Science 2012-10-17 Soroush Alamdari , Elaheh Fata , Stephen L. Smith

In the field of topological data analysis, persistence modules are used to express geometrical features of data sets. The matching distance $d_\mathcal{M}$ measures the difference between $2$-parameter persistence modules by taking the…

Algebraic Topology · Mathematics 2023-12-08 Håvard Bakke Bjerkevik , Michael Kerber

An algorithm is in-place, or runs in-situ, when it does not need any additional memory to execute beyond a small constant amount. There are many algorithms that are efficient because of this feature, therefore it is an important aspect of…

Programming Languages · Computer Science 2016-09-14 Ian Mackie , Shinya Sato

We preprocess the input subdivision with $n$ points on the plane in $O(n\sqrt{\log n})$ time to facilitate point location in constant time. Previously the preprocessing time is $O(n\log n)$ and point location takes $O(\log n)$ time.

Computational Geometry · Computer Science 2024-01-08 Sairam Chaganti , Yijie Han

Perpetual points (PPs) are special critical points for which the magnitude of acceleration describing dynamics drops to zero, while the motion is still possible (stationary points are excluded), e.g. considering the motion of the particle…

Chaotic Dynamics · Physics 2017-05-24 Dawid Dudkowski , Awadhesh Prasad , Tomasz Kapitaniak

A highway H is a line in the plane on which one can travel at a greater speed than in the remaining plane. One can choose to enter and exit H at any point. The highway time distance between a pair of points is the minimum time required to…

Computational Geometry · Computer Science 2009-04-22 Greg Aloupis , Jean Cardinal , Sebastien Collette , Ferran Hurtado , Stefan Langerman , Joseph O'Rourke , Belen Palop

Consider a set $P$ of $n$ points picked uniformly and independently from $[0,1]^d$ for a constant dimension $d$ -- such a point set is extremely well behaved in many aspects. For example, for a fixed $r \in [0,1]$, we prove a new…

Computational Geometry · Computer Science 2023-11-01 Sariel Har-Peled , Elfarouk Harb

Persistence diagrams are important tools in the field of topological data analysis that describe the presence and magnitude of features in a filtered topological space. However, current approaches for comparing a persistence diagram to a…

Computational Geometry · Computer Science 2021-03-24 Brittany Terese Fasy , Xiaozhou He , Zhihui Liu , Samuel Micka , David L. Millman , Binhai Zhu

Accurately detecting home locations from GPS data generated by mobile devices is a foundational step in human mobility research, with significant implications for transportation planning, public health, and emergency response. However,…

Applications · Statistics 2026-05-21 Alessandra Recalde , Mustafa Sameen , Xiaojian Zhang , Xilei Zhao

Consider the model where particles are initially distributed on $\mathbb{Z}^d, \, d\geq 2$, according to a Poisson point process of intensity $\lambda>0$, and are moving in continuous time as independent simple symmetric random walks. We…

Probability · Mathematics 2013-12-31 Vladas Sidoravicius , Alexandre Stauffer

Changepoints are abrupt variations in the generative parameters of a data sequence. Online detection of changepoints is useful in modelling and prediction of time series in application areas such as finance, biometrics, and robotics. While…

Machine Learning · Statistics 2007-10-22 Ryan Prescott Adams , David J. C. MacKay

Geometric data sets arising in modern applications are often very large and change dynamically over time. A popular framework for dealing with such data sets is the evolving data framework, where a discrete structure continuously varies…

Computational Geometry · Computer Science 2025-04-28 Aditya Acharya , David M. Mount

We describe an algorithm that takes as input n points in the plane and a parameter {\epsilon}, and produces as output an embedded planar graph having the given points as a subset of its vertices in which the graph distances are a (1 +…

Computational Geometry · Computer Science 2016-03-22 Glencora Borradaile , David Eppstein

We study the online problem of assigning a moving point to a base-station region that contains it. For instance, the moving object could represent a cellular phone and the base station could represent the coverage zones of cell towers. Our…

Computational Geometry · Computer Science 2011-05-03 David Eppstein , Michael T. Goodrich , Maarten Löffler

We consider string matching with variable length gaps. Given a string $T$ and a pattern $P$ consisting of strings separated by variable length gaps (arbitrary strings of length in a specified range), the problem is to find all ending…

Data Structures and Algorithms · Computer Science 2011-10-14 Philip Bille , Inge Li Goertz , Hjalte Wedel Vildhøj , David Kofoed Wind

Patrolling consists of scheduling perpetual movements of a collection of mobile robots, so that each point of the environment is regularly revisited by any robot in the collection. In previous research, it was assumed that all points of the…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-10-03 Huda Chuangpishit , Jurek Czyzowicz , Leszek Gasieniec , Konstantinos Georgiou , Tomasz Jurdzinski , Evangelos Kranakis

Nowadays, mobile devices enable constant tracking of the user's position and location trajectories can be used to infer personal points of interest (POIs) like homes, workplaces, or stores. A common way to extract POIs is to first identify…

Computer Vision and Pattern Recognition · Computer Science 2023-06-12 Christian Löwens , Daniela Thyssens , Emma Andersson , Christina Jenkins , Lars Schmidt-Thieme

Given $n$ points in a circular region $C$ in the plane, we study the problems of moving the $n$ points to its boundary to form a regular $n$-gon such that the maximum (min-max) or the sum (min-sum) of the Euclidean distances traveled by the…

Computational Geometry · Computer Science 2011-07-07 Danny Z. Chen , Xuehou Tan , Haitao Wang , Gangshan Wu

We study pursuit-evasion in a polygonal environment with polygonal obstacles. In this turn based game, an evader $e$ is chased by pursuers $p_1, p_2, ..., p_{\ell}$. The players have full information about the environment and the location…

Computational Geometry · Computer Science 2014-10-21 Brendan Ames , Andrew Beveridge , Rosalie Carlson , Claire Djang , Volkan Isler , Stephen Ragain , Maxray Savage