default search action
Joan Antoni Sellarès
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j32]Marta Fort, Joan Antoni Sellarès, Nacho Valladares:
Nearest and farthest spatial skyline queries under multiplicative weighted Euclidean distances. Knowl. Based Syst. 192: 105299 (2020)
2010 – 2019
- 2019
- [j31]Narcís Coll
, Marta Fort
On the overlap area of a disk and a piecewise circular domain. Comput. Oper. Res. 104: 59-73 (2019) - [j30]Yago Diez
Group evolution patterns in running races. Inf. Sci. 479: 20-39 (2019) - 2018
- [i4]Yago Diez, Marta Fort, Matias Korman, Joan Antoni Sellarès:
Group evolution patterns in running races. CoRR abs/1812.10530 (2018) - 2017
- [j29]Marta Fort
Intersecting two families of sets on the GPU. J. Parallel Distributed Comput. 104: 167-178 (2017) - 2016
- [j28]José Miguel Díaz-Báñez
Convex blocking and partial orders on the plane. Comput. Geom. 51: 55-66 (2016) - [j27]Marta Fort
Efficient multiple bichromatic mutual nearest neighbor query processing. Inf. Syst. 62: 136-154 (2016) - [j26]Marta Fort
Solving multiple kth smallest dissimilarity queries for non-metric dissimilarities with the GPU. Inf. Sci. 361-362: 66-83 (2016) - 2015
- [j25]Marta Fort
Common influence region problems. Inf. Sci. 321: 116-135 (2015) - 2014
- [j24]Marta Fort
A parallel GPU-based approach for reporting flock patterns. Int. J. Geogr. Inf. Sci. 28(9): 1877-1903 (2014) - [j23]Marta Fort
Solving the k-influence region problem with the GPU. Inf. Sci. 269: 255-269 (2014) - [j22]Marta Fort
Finding extremal sets on the GPU. J. Parallel Distributed Comput. 74(1): 1891-1899 (2014) - [j21]Marta Fort
Computing and visualizing popular places. Knowl. Inf. Syst. 40(2): 411-437 (2014) - [c23]Marta Fort
Solving Multiple Bichromatic Mutual Nearest Neighbor Queries with the GPU. DASFAA Workshops 2014: 308-316 - 2013
- [j20]Marta Fort
Finding influential location regions based on reverse k-neighbor queries. Knowl. Based Syst. 47: 35-52 (2013) - [c22]Marta Fort
Common Influence Region Queries. ISVD 2013: 53-62 - 2012
- [j19]Marta Fort
Approximating generalized distance functions on weighted triangulated surfaces with applications. J. Comput. Appl. Math. 236(14): 3461-3477 (2012) - [c21]Marta Fort
GPU-Based Influence Regions Optimization. ICCSA (1) 2012: 253-266 - 2011
- [j18]Yago Diez
Noisy colored point set matching. Discret. Appl. Math. 159(6): 433-449 (2011) - [j17]Narcís Coll
Adaptive simplification of huge sets of terrain grid data for geosciences applications. J. Comput. Appl. Math. 236(6): 1410-1422 (2011) - [c20]Canek Peláez, José Miguel Díaz-Báñez, Marco A. Heredia, Joan Antoni Sellarès, Jorge Urrutia, Inmaculada Ventura:
Convex blocking and partial orders on the plane. CCCG 2011 - 2010
- [j16]Narcís Coll
Good-visibility maps visualization. Vis. Comput. 26(2): 109-120 (2010) - [c19]Marta Fort
Computing Popular Places Using Graphics Processors. ICDM Workshops 2010: 233-240
2000 – 2009
- 2009
- [j15]Marta Fort
Computing generalized higher-order Voronoi diagrams on triangulated surfaces. Appl. Math. Comput. 215(1): 235-250 (2009) - [j14]Sergio Cabello
Higher-order Voronoi diagrams on triangulated surfaces. Inf. Process. Lett. 109(9): 440-445 (2009) - [c18]Marta Fort
GPU-based computation of distance functions on road networks with applications. SAC 2009: 1320-1324 - 2008
- [j13]Narcís Coll
Combining improvement and refinement techniques: 2D Delaunay mesh adaptation under domain changes. Appl. Math. Comput. 201(1-2): 527-546 (2008) - [j12]Sergio Cabello
Covering point sets with two disjoint disks or squares. Comput. Geom. 40(3): 195-206 (2008) - [j11]Imma Boada
Approximations of 2D and 3D generalized Voronoi diagrams. Int. J. Comput. Math. 85(7): 1003-1022 (2008) - [j10]José Miguel Díaz-Báñez
Computing shortest heterochromatic monotone routes. Oper. Res. Lett. 36(6): 684-687 (2008) - [c17]Yago Diez, Mario Alberto López, Joan Antoni Sellarès:
Noisy Road Network Matching. GIScience 2008: 38-54 - [c16]Marta Fort
Computing Distance Functions from Generalized Sources on Weighted Polyhedral Surfaces. ICCSA Workshops 2008: 394-404 - [c15]Narcís Coll, Marité Guerrieri, Maria-Cecilia Rivara, Joan Antoni Sellarès
Accurate Interpolation of Terrain Surfaces from Over-Sampled Grid Data. IMR 2008: 351-368 - 2007
- [j9]Narcís Coll
Multi-visibility maps of triangulated terrains. Int. J. Geogr. Inf. Sci. 21(10): 1115-1134 (2007) - [j8]Prosenjit Bose
A General Approximation Algorithm for Planar Maps with Applications. Int. J. Comput. Geom. Appl. 17(6): 529-554 (2007) - [c14]Yago Diez, Joan Antoni Sellarès:
Efficient Colored Point Set Matching Under Noise. ICCSA (1) 2007: 26-40 - [c13]Marta Fort
Generalized Higher-Order Voronoi Diagrams on Polyhedral Surfaces. ISVD 2007: 74-83 - 2006
- [j7]José Miguel Díaz-Báñez
Locating an obnoxious plane. Eur. J. Oper. Res. 173(2): 556-564 (2006) - [j6]José Miguel Díaz-Báñez
On finding a widest empty 1-corner corridor. Inf. Process. Lett. 98(5): 199-205 (2006) - [c12]Pankaj K. Agarwal, Sergio Cabello, Joan Antoni Sellarès, Micha Sharir:
Computing a Center-Transversal Line. FSTTCS 2006: 93-104 - [c11]Narcís Coll
Computing Terrain Multi-visibility Maps for a Set of View Segments Using Graphics Hardware. ICCSA (1) 2006: 81-90 - [c10]Narcís Coll
Mesh Modification Under Local Domain Changes. IMR 2006: 39-56 - 2005
- [j5]José Miguel Díaz-Báñez
Optimal projections onto grids and finite resolution images. J. Vis. Commun. Image Represent. 16(3): 233-249 (2005) - [i3]Narcís Coll, Marta Fort, Joan Antoni Sellarès:
Approximate multi-visibility map computation. EuroCG 2005: 97-100 - [i2]Imma Boada, Narcís Coll, Narcis Madern, Joan Antoni Sellarès:
Approximations of 3D generalized Voronoi diagrams. EuroCG 2005: 163-166 - [i1]José Miguel Díaz-Báñez, Carlos Seara, Joan Antoni Sellarès, Jorge Urrutia, Inmaculada Ventura:
Covering point sets with two convex objects. EuroCG 2005: 179-182 - 2004
- [c9]Imma Boada, Narcís Coll, Joan Antoni Sellarès:
Multiresolution Approximations of Generalized Voronoi Diagrams. International Conference on Computational Science 2004: 98-106 - [c8]José Miguel Díaz-Báñez, Mario Alberto López, Joan Antoni Sellarès:
Computing Largest Empty Slabs. ICCSA (3) 2004: 99-108 - 2003
- [j4]José Miguel Díaz-Báñez
The Largest Empty Annulus Problem. Int. J. Comput. Geom. Appl. 13(4): 317-325 (2003) - [j3]Kim Miller, Suneeta Ramaswami, Peter J. Rousseeuw, Joan Antoni Sellarès
Efficient computation of location depth contours by methods of computational geometry. Stat. Comput. 13(2): 153-162 (2003) - [c7]Imma Boada, Narcís Coll, Joan Antoni Sellarès:
Dynamically Maintaining a Hierarchical Planar Voronoi Diagram Approximation. ICCSA (3) 2003: 836-846 - [c6]José Miguel Díaz-Báñez, Ferran Hurtado, Mario Alberto López, Joan Antoni Sellarès:
Optimal Point Set Projections onto Regular Grids. ISAAC 2003: 270-279 - 2002
- [c5]Imma Boada, Narcís Coll, Joan Antoni Sellarès:
Hierarchical planar voronoi diagram approximations. CCCG 2002: 40-44 - [c4]Narcís Coll, Imma Boada, Joan Antoni Sellarès:
The Voronoi-Quadtree: construction and visualization. Eurographics (Short Presentations) 2002 - [c3]José Miguel Díaz-Báñez, Ferran Hurtado, Henk Meijer, David Rappaport, Joan Antoni Sellarès:
The Largest Empty Annulus Problem. International Conference on Computational Science (3) 2002: 46-54 - 2001
- [j2]Francisco Gómez, Ferran Hurtado, Joan Antoni Sellarès
Nice Perspective Projections. J. Vis. Commun. Image Represent. 12(4): 387-400 (2001) - [c2]Kim Miller, Suneeta Ramaswami, Peter J. Rousseeuw, Joan Antoni Sellarès, Diane L. Souvaine, Ileana Streinu, Anja Struyf:
Fast implementation of depth contours using topological sweep. SODA 2001: 690-699
1990 – 1999
- 1998
- [c1]Francisco Gómez, Ferran Hurtado, Joan Antoni Sellarès, Godfried T. Toussaint:
Perspective projections and removal of degeneracies. CCCG 1998 - 1996
- [j1]Xavier Pueyo
An object-oriented approach for teaching visibility computation algorithms. Comput. Graph. 20(4): 605-610 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-03 20:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: