Search Results - "Sellarés, J. Antoni"
-
1
Nearest and farthest spatial skyline queries under multiplicative weighted Euclidean distances
Published in Knowledge-based systems (15-03-2020)“…Consider two point sets in the plane, a set of points of interest and a set of query points that is used to establish distance restrictions with respect to the…”
Get full text
Journal Article -
2
On the overlap area of a disk and a piecewise circular domain
Published in Computers & operations research (01-04-2019)“…•We provide optimal and near-optimal locations for a disk according to its overlap area with a piece-wise circular domain.•We provide a regular and a…”
Get full text
Journal Article -
3
A parallel GPU-based approach for reporting flock patterns
Published in International journal of geographical information science : IJGIS (02-09-2014)“…Data analysis and knowledge discovery in trajectory databases is an emerging field with a growing number of applications such as managing traffic, planning…”
Get full text
Journal Article -
4
Computing and visualizing popular places
Published in Knowledge and information systems (01-08-2014)“…Data analysis and knowledge discovery in trajectory databases is an emerging field with a growing number of applications such as managing traffic, planning…”
Get full text
Journal Article -
5
Finding extremal sets on the GPU
Published in Journal of parallel and distributed computing (01-01-2014)“…The extremal sets of a family F of sets consist of all sets of F that are maximal or minimal with respect to the partial order induced by the subset relation…”
Get full text
Journal Article -
6
Noisy colored point set matching
Published in Discrete Applied Mathematics (28-03-2011)“…We propose a process for determining approximated matches, in terms of the bottleneck distance, under color preserving rigid motions, between two colored point…”
Get full text
Journal Article -
7
Computing generalized higher-order Voronoi diagrams on triangulated surfaces
Published in Applied mathematics and computation (01-09-2009)“…We present an algorithm for computing exact shortest paths, and consequently distance functions, from a generalized source (point, segment, polygonal chain or…”
Get full text
Journal Article -
8
Approximations of 2D and 3D generalized Voronoi diagrams
Published in International journal of computer mathematics (01-07-2008)“…We propose a new approach for computing in an efficient way polygonal approximations of generalized 2D/3D Voronoi diagrams. The method supports distinct site…”
Get full text
Journal Article -
9
Intersecting two families of sets on the GPU
Published in Journal of parallel and distributed computing (01-06-2017)“…The computation of the intersection family of two large families of unsorted sets is an interesting problem from the mathematical point of view which also…”
Get full text
Journal Article -
10
Efficient multiple bichromatic mutual nearest neighbor query processing
Published in Information systems (Oxford) (01-12-2016)“…In this paper we propose, motivate and solve multiple bichromatic mutual nearest neighbor queries in the plane considering multiplicative weighted Euclidean…”
Get full text
Journal Article -
11
Approximating generalized distance functions on weighted triangulated surfaces with applications
Published in Journal of computational and applied mathematics (01-08-2012)“…Given P, a simple connected, possibly non-convex, polyhedral surface composed of positively weighted triangular faces, we consider paths from generalized…”
Get full text
Journal Article -
12
Finding influential location regions based on reverse k-neighbor queries
Published in Knowledge-based systems (01-07-2013)“…In this paper we introduce and solve several problems that arise in the single facility location field. A reverse k-influential location problem finds a region…”
Get full text
Journal Article -
13
Convex blocking and partial orders on the plane
Published in Computational geometry : theory and applications (01-01-2016)“…Let C={c1,…,cn} be a collection of disjoint closed bounded convex sets in the plane. Suppose that one of them, say c1, represents a valuable object we want to…”
Get full text
Journal Article -
14
Adaptive simplification of huge sets of terrain grid data for geosciences applications
Published in Journal of computational and applied mathematics (15-10-2011)“…We propose and discuss a new Lepp-surface method able to produce a small triangular approximation of huge sets of terrain grid data by using a two-goal…”
Get full text
Journal Article -
15
Combining improvement and refinement techniques: 2D Delaunay mesh adaptation under domain changes
Published in Applied mathematics and computation (15-07-2008)“…We propose a framework that combines improvement and Delaunay refinement techniques for incrementally adapting a refined mesh by interactively inserting and…”
Get full text
Journal Article -
16
Common Influence Region Queries
Published in 2013 10th International Symposium on Voronoi Diagrams in Science and Engineering (01-07-2013)“…In this paper, we propose and solve several queries called common influence region queries. They are related to the simultaneous influence, i.e. capacity of…”
Get full text
Conference Proceeding -
17
Good-visibility maps visualization
Published in The Visual computer (01-02-2010)“…Given a set V of viewpoints and a set S of obstacles in an environmental space, the good-visibility depth of a point q in relation to V and S is a measure of…”
Get full text
Journal Article -
18
Covering point sets with two disjoint disks or squares
Published in Computational geometry : theory and applications (01-08-2008)“…We study the following problem: Given a set of red points and a set of blue points on the plane, find two unit disks C R and C B with disjoint interiors such…”
Get full text
Journal Article -
19
Computing Popular Places Using Graphics Processors
Published in 2010 IEEE International Conference on Data Mining Workshops (01-12-2010)“…Mobile devices provide the availability of tracking and collecting trajectories of moving objects such as vehicles, people or animals. There exists a…”
Get full text
Conference Proceeding -
20
Computing Distance Functions from Generalized Sources on Weighted Polyhedral Surfaces
Published in 2008 International Conference on Computational Sciences and Its Applications (01-01-2008)“…We present algorithms for computing approximate distance functions and shortest paths from a generalized source (point, segment, polygonal chain or polygonal…”
Get full text
Conference Proceeding Journal Article