activity
20062017
most citedGeometric Biplane Graphs II: Graph Augmentation

6 citations · 16 across the 6 of their papers we have counts for

collaborators

6 papers

cs.CG2017★ 6 cited

Geometric Biplane Graphs II: Graph Augmentation

Alfredo García, Ferran Hurtado, Matias Korman +5

We study biplane graphs drawn on a finite point set in the plane in general position. This is the family of geometric graphs whose vertex set is and which can be decomposed…

cs.CG2017★ 4 cited

Geometric Biplane Graphs I: Maximal Graphs

Alfredo García, Ferran Hurtado, Matias Korman +5

We study biplane graphs drawn on a finite planar point set in general position. This is the family of geometric graphs whose vertex set is and can be decomposed into two pl…

cs.CG2013

Terrain visibility with multiple viewpoints

Ferran Hurtado, Maarten Löffler, Inês Matos +4

We study the problem of visibility in polyhedral terrains in the presence of multiple viewpoints. We consider a triangulated terrain with viewpoints (or guards) located on th…

cs.CG2013★ 6 cited

Distance domination, guarding and vertex cover for maximal outerplanar graph

Santiago Canales, Gregorio Hernández, Mafalda Martins +1

This paper discusses a distance guarding concept on triangulation graphs, which can be associated with distance domination and distance vertex cover. We show how these subjects are…

cs.CG2013

Some Results on Open Edge and Open Mobile Guarding of Polygons and Triangulations

Antonio Leslie Bajuelos, Santiago Canales, Gregorio Hernández +2

This paper focuses on a variation of the Art Gallery problem that considers open edge guards and open mobile guards. A mobile guard can be placed on edges and diagonals of a polygo…

cs.CG2006

Good Illumination of Minimum Range

M. Abellanas, A. Bajuelos, G. Hernández +3

A point p is 1-well illuminated by a set F of n point lights if p lies in the interior of the convex hull of F. This concept corresponds to triangle-guarding or well-covering. In t…