Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Narcís Coll"'
Publikováno v:
Expert Systems with Applications, 2022, vol. 202, art. núm.117185
Articles publicats (D-IMAE)
Coll i Arnau, Narcís Fort, Marta Saus, Moisès 2022 Coverage area maximization with Parallel Simulated Annealing Expert Systems with Applications 202 art. núm.117185
DUGiDocs – Universitat de Girona
instname
Articles publicats (D-IMAE)
Coll i Arnau, Narcís Fort, Marta Saus, Moisès 2022 Coverage area maximization with Parallel Simulated Annealing Expert Systems with Applications 202 art. núm.117185
DUGiDocs – Universitat de Girona
instname
This study provides a system that determines where to locate 𝑘 disks-like services of radius 𝑟 so that they globally cover as much as possible a region of demand. It is an NP-hard problem with notorious applications in the facility location fie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2e12dce89d466bb64d691fc5a0c84cb5
http://hdl.handle.net/10256/21510
http://hdl.handle.net/10256/21510
Autor:
Marité Guerrieri, Narcís Coll
Publikováno v:
International Journal of Geographical Information Science. 31:1467-1484
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 triangulati
Publikováno v:
© Computers and Operations Research, 2019, vol. 104, p. 59-73
Articles publicats (D-IMAE)
Coll i Arnau, Narcís Fort, Marta Sellarès i Chiva, Joan Antoni 2019 On the overlap area of a disk and a piecewise circular domain Computers & Operations Research 104 59 73
DUGiDocs – Universitat de Girona
instname
Articles publicats (D-IMAE)
Coll i Arnau, Narcís Fort, Marta Sellarès i Chiva, Joan Antoni 2019 On the overlap area of a disk and a piecewise circular domain Computers & Operations Research 104 59 73
DUGiDocs – Universitat de Girona
instname
We provide an approach to solve the problem of locating a disk so that its overlap area with a piecewise circular domain is near-optimal when considering partial converage. To this purpose, we introduce the concept of overlap area map. Both, overlap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::be0717aa724ff1a13ae3c902af6f168a
http://hdl.handle.net/10256/21595
http://hdl.handle.net/10256/21595
Publikováno v:
© Journal of Computational and Applied Mathematics, 2011, vol. 236, núm. 6, p. 1410-1422
Articles publicats (D-IMA)
DUGiDocs – Universitat de Girona
instname
Articles publicats (D-IMA)
DUGiDocs – Universitat de Girona
instname
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 strategy that assures both small approximation error and well-shaped 3D triangles. This is a refin
Autor:
Narcís Coll, Teresa Paradinas
Publikováno v:
Computer Graphics Forum. 30:187-198
Autor:
Narcís Coll, Teresa Paradinas
Publikováno v:
Computer Graphics Forum. 29:1842-1853
Scanning and acquisition methods produce highly detailed surface meshes that need multi-chart parameterizations to reduce stretching and distortion. From these complex shape surfaces, high-quality approximations are automatically generated by using s
Publikováno v:
The Visual Computer. 26:109-120
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 how deep or central q is with respect to the points in V that see q while minding the obstac
Publikováno v:
International Journal of Computer Mathematics. 85:1003-1022
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
Publikováno v:
Applied Mathematics and Computation. 201:527-546
We propose a framework that combines improvement and Delaunay refinement techniques for incrementally adapting a refined mesh by interactively inserting and removing domain elements. Our algorithms achieve quality mesh by deleting, moving or insertin
Publikováno v:
International Journal of Computational Geometry & Applications. 17:529-554
Given an unknown target planar map, we present an algorithm for constructing an approximation of the unknown target based on information gathered from linear probes of the target. Our algorithm is a general purpose reconstruction algorithm that can b