منابع مشابه
Fast algorithms for approximate Fréchet matching queries in geometric trees
Let T be a tree in Rd and let ∆ > 0 be a real number. The aim is to preprocess T into a data structure, such that for any polygonal query path Q, we can decide if T contains a path P whose Fréchet distance δF (Q,P ) to Q is at most ∆. For any real number ε > 0, we present an efficient data structure that solves an approximate version of this problem for the case when T is c-packed and each of t...
متن کاملFréchet Queries in Geometric Trees
Let T be a tree that is embedded in the plane and let ∆ > 0 be a real number. The aim is to preprocess T into a data structure, such that, for any query polygonal path Q, we can decide if T contains a path P whose Fréchet distance δF (P,Q) to Q is less than ∆. For any real number ε > 0, we present an efficient data structure that solves an approximate version of this problem, for the case when ...
متن کاملFast Fréchet Distance Between Curves With Long Edges
Computing Fréchet distance between two curves takes roughly quadratic time. In this paper, we show that for curves with long edges the Fréchet distance computations become easier. Let P and Q be two polygonal curves in R with n and m vertices, respectively. We prove four main results for the case when all edges of both curves are long compared to the Fréchet distance between them: (1) a linear-...
متن کاملHybrid SPARQL Queries: Fresh vs. Fast Results
For Linked Data query engines, there are inherent trade-offs between centralised approaches that can efficiently answer queries over data cached from parts of the Web, and live decentralised approaches that can provide fresher results over the entire Web at the cost of slower response times. Herein, we propose a hybrid query execution approach that returns fresher results from a broader range o...
متن کاملParetoPrep: Fast computation of Path Skylines Queries
Computing cost optimal paths in network data is a very important task in many application areas like transportation networks, computer networks or social graphs. In many cases, the cost of an edge can be described by various cost criteria. For example, in a road network possible cost criteria are distance, time, ascent, energy consumption or toll fees. In such a multicriteria network, a route o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2013
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2012.11.006