|
Search the dblp DataBase
Joan Antoni Sellarès:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Imma Boada, Narcís Coll, Joan Antoni Sellarès
Hierarchical planar voronoi diagram approximations. [Citation Graph (0, 0)][DBLP] CCCG, 2002, pp:40-44 [Conf]
- Francisco Gómez, Ferran Hurtado, Joan Antoni Sellarès, Godfried T. Toussaint
Perspective projections and removal of degeneracies. [Citation Graph (0, 0)][DBLP] CCCG, 1998, pp:- [Conf]
- Pankaj K. Agarwal, Sergio Cabello, Joan Antoni Sellarès, Micha Sharir
Computing a Center-Transversal Line. [Citation Graph (0, 0)][DBLP] FSTTCS, 2006, pp:93-104 [Conf]
- Imma Boada, Narcís Coll, Joan Antoni Sellarès
Multiresolution Approximations of Generalized Voronoi Diagrams. [Citation Graph (0, 0)][DBLP] International Conference on Computational Science, 2004, pp:98-106 [Conf]
- José Miguel Díaz-Báñez, Ferran Hurtado, Henk Meijer, David Rappaport, Joan Antoni Sellarès
The Largest Empty Annulus Problem. [Citation Graph (0, 0)][DBLP] International Conference on Computational Science (3), 2002, pp:46-54 [Conf]
- Imma Boada, Narcís Coll, Joan Antoni Sellarès
Dynamically Maintaining a Hierarchical Planar Voronoi Diagram Approximation. [Citation Graph (0, 0)][DBLP] ICCSA (3), 2003, pp:836-846 [Conf]
- Narcís Coll, Marta Fort, Narcis Madern, Joan Antoni Sellarès
Computing Terrain Multi-visibility Maps for a Set of View Segments Using Graphics Hardware. [Citation Graph (0, 0)][DBLP] ICCSA (1), 2006, pp:81-90 [Conf]
- José Miguel Díaz-Báñez, Mario Alberto López, Joan Antoni Sellarès
Computing Largest Empty Slabs. [Citation Graph (0, 0)][DBLP] ICCSA (3), 2004, pp:99-108 [Conf]
- José Miguel Díaz-Báñez, Ferran Hurtado, Mario Alberto López, Joan Antoni Sellarès
Optimal Point Set Projections onto Regular Grids. [Citation Graph (0, 0)][DBLP] ISAAC, 2003, pp:270-279 [Conf]
- Kim Miller, Suneeta Ramaswami, Peter Rousseeuw, Joan Antoni Sellarès, Diane L. Souvaine, Ileana Streinu, Anja Struyf
Fast implementation of depth contours using topological sweep. [Citation Graph (0, 0)][DBLP] SODA, 2001, pp:690-699 [Conf]
- Xavier Pueyo, Frederic Pérez, Joan Antoni Sellarès, Josep Suy
An object-oriented approach for teaching visibility computation algorithms. [Citation Graph (0, 0)][DBLP] Computers & Graphics, 1996, v:20, n:4, pp:605-610 [Journal]
- José Miguel Díaz-Báñez, Ferran Hurtado, Henk Meijer, David Rappaport, Joan Antoni Sellarès
The Largest Empty Annulus Problem. [Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 2003, v:13, n:4, pp:317-325 [Journal]
- José Miguel Díaz-Báñez, Mario Alberto López, Joan Antoni Sellarès
On finding a widest empty 1-corner corridor. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2006, v:98, n:5, pp:199-205 [Journal]
- José Miguel Díaz-Báñez, Ferran Hurtado, Mario Alberto López, Joan Antoni Sellarès
Optimal projections onto grids and finite resolution images. [Citation Graph (0, 0)][DBLP] J. Visual Communication and Image Representation, 2005, v:16, n:3, pp:233-249 [Journal]
- José Miguel Díaz-Báñez, Mario Alberto López, Joan Antoni Sellarès
Locating an obnoxious plane. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2006, v:173, n:2, pp:556-564 [Journal]
- Yago Diez, Joan Antoni Sellarès
Efficient Colored Point Set Matching Under Noise. [Citation Graph (0, 0)][DBLP] ICCSA (1), 2007, pp:26-40 [Conf]
- Marta Fort, Joan Antoni Sellarès
Generalized Higher-Order Voronoi Diagrams on Polyhedral Surfaces. [Citation Graph (0, 0)][DBLP] ISVD, 2007, pp:74-83 [Conf]
Approximations of 3D generalized Voronoi diagrams. [Citation Graph (, )][DBLP]
Approximate multi-visibility map computation. [Citation Graph (, )][DBLP]
Covering point sets with two convex objects. [Citation Graph (, )][DBLP]
Noisy Road Network Matching. [Citation Graph (, )][DBLP]
Mesh Modification Under Local Domain Changes. [Citation Graph (, )][DBLP]
GPU-based computation of distance functions on road networks with applications. [Citation Graph (, )][DBLP]
Covering point sets with two disjoint disks or squares. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.305secs
|