CGA - Computational Geometry and Applications
The research group on Computational Geometry and Applications (CGA) is devoted to carrying out research on computational geometry with a strong emphasis in applications. Computational geometry is an active field in the interface between applied mathematics and computer science that studies algorithmic problems involving discrete geometric objects. The field has applications in robotics, computer graphics, CAD/CAM, integrated circuit design, computer vision, and geographic information science.
The CGA group has the goal of working not only on the design of efficient algorithms, but also on their application to different domains. In particular, we will concentrate on making progress on core geometric problems, and on their applications to two concrete domains: robotics and geographic information science.
Col·leccions
-
Articles de revista [19]
Enviaments recents
-
Metric dimension of maximal outerplanar graphs
(2021-02-02)
Article
Accés restringit per política de l'editorialIn this paper, we study the metric dimension problem in maximal outerplanar graphs. Concretely, if ß(G) denotes the metric dimension of a maximal outerplanar graph G of order n, we prove that 2=ß(G)=¿2n5¿ and that the ... -
Optimizing generalized kernels of polygons
(Springer Nature, 2021-04-09)
Article
Accés restringit per política de l'editorialLet O be a set of k orientations in the plane, and let P be a simple polygon in the plane. Given two points p, q inside P, we say that p O-sees q if there is an O-staircase contained in P that connects p and q. The O-Kernel ... -
A comparative analysis of trajectory similarity measures
(2021-06-23)
Article
Accés restringit per política de l'editorialComputing trajectory similarity is a fundamental operation in movement analytics, required in search, clustering, and classification of trajectories, for example. Yet the range of different but interrelated trajectory ... -
Total domination in plane triangulations
(2021-01-01)
Article
Accés obertA total dominating set of a graph is a subset of such that every vertex in is adjacent to at least one vertex in . The total domination number of , denoted by , is the minimum cardinality of a total dominating set of . A ... -
A scalable method to construct compact road networks from GPS trajectories
(2020-10-06)
Article
Accés obertThe automatic generation of road networks from GPS tracks is a challenging problem that has been receiving considerable attention in the last years. Although dozens of methods have been proposed, current techniques suffer ... -
Farthest color Voronoi diagrams: complexity and algorithms
(Springer, 2021)
Text en actes de congrés
Accés restringit per política de l'editorialThe farthest-color Voronoi diagram (FCVD) is a farthestsite Voronoi structure defined on a family P of m point-clusters in the plane, where the total number of points is n. The FCVD finds applications in problems related ... -
Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations
(Springer Nature, 2021-03)
Article
Accés restringit per política de l'editorialLet P be a set of n points in the plane. We compute the value of ¿¿[0,2p) for which the rectilinear convex hull of P, denoted by RHP(¿), has minimum (or maximum) area in optimal O(nlogn) time and O(n) space, improving the ... -
Caterpillars are antimagic
(2021-01-21)
Article
Accés restringit per política de l'editorialAn antimagic labeling of a graph G is a bijection from the set of edges E(G) to {1,2,…,|E(G)|}, such that all vertex sums are pairwise distinct, where the vertex sum at vertex u is the sum of the labels assigned to the ... -
Flips in higher order Delaunay triangulations
(2021)
Text en actes de congrés
Accés restringit per política de l'editorialWe study the flip graph of higher order Delaunay triangulations. A triangulation of a set S of n points in the plane is order-k Delaunay if for every triangle its circumcircle encloses at most k points of S. The flip graph ... -
Affine invariant triangulations
(2019)
Text en actes de congrés
Accés restringit per política de l'editorialWe study affine invariant 2D triangulation methods. That is, methods that produce the same triangulation for a point set S for any (unknown) affine transformation of S. Our work is based on a method by Nielson [A ... -
Hamiltonicity for convex shape Delaunay and Gabriel Graphs
(Springer, 2019)
Text en actes de congrés
Accés restringit per política de l'editorialWe study Hamiltonicity for some of the most general variants of Delaunay and Gabriel graphs. Instead of defining these proximity graphs using circles, we use an arbitrary convex shape C. Let S be a point set in the plane. ... -
Hamiltonicity for convex shape Delaunay and Gabriel graphs
(2019)
Text en actes de congrés
Accés restringit per política de l'editorialWe study Hamiltonicity for some of the most general variants of Delaunay and Gabriel graphs. Let S be a point set in the plane. The k-order Delaunay graph of S, denoted k-DGC(S), has vertex set S and edge pq provided ...
RSS 1.0