Narcís Coll

Narcís Coll

Auto-generated profile, based on publicly available information

Narcís Coll

Universitat de Girona

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 September 2017 in Journal of Hydrology
Verified
Journal Article
Open access
Anna MencióAnna Menció
Anna Menció
XCX. Casamitjana
X. Casamitjana
JMJosep Mas-Pla
Josep Mas-Pla
NCN. Coll
N. Coll
JCJ. Compte
J. Compte
XQX.D. Quintana
X.D. Quintana

13 March 2017 in International Journal of Geographical Information Science
Verified
Journal Article
Closed access
NCNarcís Coll
Narcís Coll
MGMarité Guerrieri
Marité Guerrieri
In this paper, we propose a new graphics processing unit GPU method able to compute the 2D constrained Delaunay triangulation CDT of a planar straight-line graph consisting of points and segments. All existing methods compute the Delaunay triangulation of the given point set, insert all the segments, and then finally transform the resulting triangulation into the CDT. To the contrary, our novel approach simultaneously inserts points and segments into the triangulation, taking special care to avoid conflicts during retriangulations due to concurrent insertion of points or concurrent edge flips. Our implementation using the Compute Unified Device Architecture programming model on NVIDIA GPUs improves, in terms of running time, the best known GPU-based approach to the CDT problem.

1 June 2013 in ACM Transactions on Graphics
Verified
Journal Article
Open access
FGFrancisco González García
Francisco González García
TPTeresa Paradinas
Teresa Paradinas
NCNarcís Coll
Narcís Coll
GPGustavo Patow
Gustavo Patow
Cage-based deformation has been one of the main approaches for mesh deformation in recent years, with a lot of interesting and active research. The main advantages of cage-based deformation techniques are their simplicity, relative flexibility, and speed. However, to date there has been no widely accepted solution that provides both user control at different levels of detail and high-quality deformations. We present *Cages (star-cages), a significant step forward with respect to traditional single-cage coordinate systems, and which allows the usage of multiple cages enclosing the model for easier manipulation while still preserving the smoothness of the mesh in the transitions between them. The proposed deformation scheme is extremely flexible and versatile, allowing the usage of heterogeneous sets of coordinates and different levels of deformation, ranging from a whole-model deformation to a very localized one. This locality allows faster evaluation and a reduced memory footprint, and as a result outperforms single-cage approaches in flexibility, speed, and memory requirements for complex editing operations.

1 July 2008 in International Journal of Computer Mathematics
Verified
Journal Article
Closed access
Imma BoadaImma Boada
Imma Boada
NCNarcís Coll
Narcís Coll
NMNarcís Madern
Narcís Madern
JSJ. Antoni Sellarès
J. Antoni Sellarès
We propose a new approach for computing in an efficient way polygonal approximations of generalized 2D/3D Voronoi diagrams. The method supports distinct site shapes (points, line-segments, curved-arc segments, polygons, spheres, lines, polyhedra, etc.), different distance functions (Euclidean distance, convex distance functions, etc.) and is restricted to diagrams with connected Voronoi regions. The presented approach constructs a tree (a quadtree in 2D/an octree in 3D) which encodes in its nodes and in a compact way all the information required for generating an explicit representation of the boundaries of the Voronoi diagram approximation. Then, by using this hierarchical data structure a reconstruction strategy creates the diagram approximation. We also present the algorithms required for dynamically maintaining under the insertion or deletion of sites the Voronoi diagram approximation. The main features of our approach are its generality, efficiency, robustness and easy implementation.

20 November 2007 in International Journal of Geographical Information Science
Verified
Journal Article
Closed access
NCN. Coll
N. Coll
MFM. Fort
M. Fort
NMN. Madern
N. Madern
JSJ. A. Sellarès
J. A. Sellarès
Visibility computation on terrain models is an important research topic with many applications in Geographical Information Systems. A multi‐visibility map is the subdivision of the domain of a terrain into regions that, according to different criteria, encodes the visibility with respect to a set of view elements. We present an approach for visualising approximated multi‐visibility maps of a triangulated terrain corresponding to a set of view elements by using graphics hardware. Our method supports heterogeneous sets of view elements containing points, segments, polygonal chains and polygons and works for weak and strong visibility. Moreover, we are also able to efficiently solve approximated point and polygonal region multi‐visibility queries. To illustrate the usefulness of our approach we present results obtained with an implementation of the proposed algorithms.

12 April 2022 in Expert Systems with Applications
Verified
Journal Article
Open access
NCNarcís Coll
Narcís Coll
MFMarta Fort
Marta Fort
MSMoisès Saus
Moisès Saus