Approximate Discontinuous Trajectory Hotspots
نویسندگان
چکیده
منابع مشابه
Approximate Hotspots of Orthogonal Trajectories
In this paper we study the problem of finding hotspots, i.e. regions in which a moving entity has spent a significant amount of time, for polygonal trajectories. The fastest optimal algorithm, due to Gudmundsson, van Kreveld, and Staals (2013) finds an axis-parallel square hotspot of fixed side length in O(n). Limiting ourselves to the case in which the entity moves in a direction parallel eith...
متن کاملTL TL − Guide Preprocessor Expressions Discontinuous Change Processor Discontinuous Change Trajectory Specification Trajectory Specification
We illustrate TeQsim, a qualitative simulator for continuous dynamical systems that combines the expressive power of qualitative diierential equations with temporal logic to constrain and reene the resulting predicted behaviors. Temporal logic is used to specify constraints that restrict the simulation to a region of the state space and to specify trajectories for input variables. A proposition...
متن کاملOn the Power of Discontinuous Approximate Computations
Comparision operations are used in algebraic computations to avoid degeneracies but are also used in numerical computations to avoid huge roundo errors On the other hand the classes of algorithms using only arithmetic operations are the most studied in complexity theory and are used e g to obtain fast parallel algorithms for numerical problems In this paper we study by using a simulation argume...
متن کاملDetecting Hotspots from Taxi Trajectory Data Using Spatial Cluster Analysis
A method of trajectory clustering based on decision graph and data field is proposed in this paper. The method utilizes data field to describe spatial distribution of trajectory points, and uses decision graph to discover cluster centres. It can automatically determine cluster parameters and is suitable to trajectory clustering. The method is applied to trajectory clustering on taxi trajectory ...
متن کاملApproximate switching algorithms for trajectory surface hopping
Three approximate switching algorithms for trajectory surface hopping calculations are presented using simple models to describe the dependence of the hopping probability on the nonadiabatic coupling strength. The switching algorithms are applied to the calculation of the electronic deexcitation in ethylene, methaniminium ion and trans-azobenzene. Compared with the results from the standard few...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open Computer Science
سال: 2020
ISSN: 2299-1093
DOI: 10.1515/comp-2020-0176