Joan Antoni Sellarès

Orcid: 0000-0002-8764-7178

According to our database1, Joan Antoni Sellarès authored at least 56 papers between 1996 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Nearest and farthest spatial skyline queries under multiplicative weighted Euclidean distances.
Knowl. Based Syst., 2020

2019
Group evolution patterns in running races.
Inf. Sci., 2019

On the overlap area of a disk and a piecewise circular domain.
Comput. Oper. Res., 2019

2017
Intersecting two families of sets on the GPU.
J. Parallel Distributed Comput., 2017

2016
Solving multiple kth smallest dissimilarity queries for non-metric dissimilarities with the GPU.
Inf. Sci., 2016

Efficient multiple bichromatic mutual nearest neighbor query processing.
Inf. Syst., 2016

Convex blocking and partial orders on the plane.
Comput. Geom., 2016

2015
Common influence region problems.
Inf. Sci., 2015

2014
Computing and visualizing popular places.
Knowl. Inf. Syst., 2014

Finding extremal sets on the GPU.
J. Parallel Distributed Comput., 2014

Solving the k-influence region problem with the GPU.
Inf. Sci., 2014

A parallel GPU-based approach for reporting flock patterns.
Int. J. Geogr. Inf. Sci., 2014

Solving Multiple Bichromatic Mutual Nearest Neighbor Queries with the GPU.
Proceedings of the Database Systems for Advanced Applications, 2014

2013
Finding influential location regions based on reverse k-neighbor queries.
Knowl. Based Syst., 2013

Common Influence Region Queries.
Proceedings of the 10th International Symposium on Voronoi Diagrams in Science and Engineering, 2013

2012
Approximating generalized distance functions on weighted triangulated surfaces with applications.
J. Comput. Appl. Math., 2012

GPU-Based Influence Regions Optimization.
Proceedings of the Computational Science and Its Applications - ICCSA 2012, 2012

2011
Adaptive simplification of huge sets of terrain grid data for geosciences applications.
J. Comput. Appl. Math., 2011

Noisy colored point set matching.
Discret. Appl. Math., 2011

2010
Good-visibility maps visualization.
Vis. Comput., 2010

Computing Popular Places Using Graphics Processors.
Proceedings of the ICDMW 2010, 2010

2009
Higher-order Voronoi diagrams on triangulated surfaces.
Inf. Process. Lett., 2009

Computing generalized higher-order Voronoi diagrams on triangulated surfaces.
Appl. Math. Comput., 2009

GPU-based computation of distance functions on road networks with applications.
Proceedings of the 2009 ACM Symposium on Applied Computing (SAC), 2009

2008
Computing shortest heterochromatic monotone routes.
Oper. Res. Lett., 2008

Approximations of 2D and 3D generalized Voronoi diagrams.
Int. J. Comput. Math., 2008

Covering point sets with two disjoint disks or squares.
Comput. Geom., 2008

Combining improvement and refinement techniques: 2D Delaunay mesh adaptation under domain changes.
Appl. Math. Comput., 2008

Accurate Interpolation of Terrain Surfaces from Over-Sampled Grid Data.
Proceedings of the 17th International Meshing Roundtable, 2008

Computing Distance Functions from Generalized Sources on Weighted Polyhedral Surfaces.
Proceedings of the Selected Papers of the Sixth International Conference on Computational Sciences and Its Applications, 2008

Noisy Road Network Matching.
Proceedings of the Geographic Information Science, 5th International Conference, 2008

2007
A General Approximation Algorithm for Planar Maps with Applications.
Int. J. Comput. Geom. Appl., 2007

Multi-visibility maps of triangulated terrains.
Int. J. Geogr. Inf. Sci., 2007

Generalized Higher-Order Voronoi Diagrams on Polyhedral Surfaces.
Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering, 2007

Efficient Colored Point Set Matching Under Noise.
Proceedings of the Computational Science and Its Applications, 2007

2006
On finding a widest empty 1-corner corridor.
Inf. Process. Lett., 2006

Locating an obnoxious plane.
Eur. J. Oper. Res., 2006

Mesh Modification Under Local Domain Changes.
Proceedings of the 15th International Meshing Roundtable, 2006

Computing Terrain Multi-visibility Maps for a Set of View Segments Using Graphics Hardware.
Proceedings of the Computational Science and Its Applications, 2006

Computing a Center-Transversal Line.
Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

2005
Optimal projections onto grids and finite resolution images.
J. Vis. Commun. Image Represent., 2005

Covering point sets with two convex objects.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Approximate multi-visibility map computation.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Approximations of 3D generalized Voronoi diagrams.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

2004
Computing Largest Empty Slabs.
Proceedings of the Computational Science and Its Applications, 2004

Multiresolution Approximations of Generalized Voronoi Diagrams.
Proceedings of the Computational Science, 2004

2003
Efficient computation of location depth contours by methods of computational geometry.
Stat. Comput., 2003

The Largest Empty Annulus Problem.
Int. J. Comput. Geom. Appl., 2003

Optimal Point Set Projections onto Regular Grids.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Dynamically Maintaining a Hierarchical Planar Voronoi Diagram Approximation.
Proceedings of the Computational Science and Its Applications, 2003

2002
The Voronoi-Quadtree: construction and visualization.
Proceedings of the 23rd Annual Conference of the European Association for Computer Graphics, 2002

Hierarchical planar voronoi diagram approximations.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001
Nice Perspective Projections.
J. Vis. Commun. Image Represent., 2001

Fast implementation of depth contours using topological sweep.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

1998
Perspective projections and removal of degeneracies.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1996
An object-oriented approach for teaching visibility computation algorithms.
Comput. Graph., 1996


  Loading...