Exploració per autor "Saumell, Maria"
Ara es mostren els items 1-11 de 11
-
A faster algorithm to compute the visibility map of a 1.5D terrain
(2014)
Text en actes de congrés
Accés obertGiven a 1.5D terrain, i.e., an x -monotone polygonal line in R 2 with n vertices, and 1 m n viewpoints placed on some of the terrain vertices, we study the problem of computing the parts of the terrain that are visible ... -
Colored Ray configurations
(2014)
Text en actes de congrés
Accés obertWe study the cyclic sequences induced at in nity by pairwise-disjoint colored rays with apices on a given bal- anced bichromatic point set, where the color of a ray is inherited from the color of its apex. We derive a lower ... -
Colored ray configurations
(2018-05)
Article
Accés obertWe study the cyclic color sequences induced at infinity by colored rays with apices being a given balanced finite bichromatic point set. We first study the case in which the rays are required to be pairwise disjoint. We ... -
Geometric biplane graphs I: maximal graphs
(2013)
Text en actes de congrés
Accés obert -
Geometric biplane graphs I: maximal graphs
(2015-03-01)
Article
Accés obertWe 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 plane graphs. We show that two maximal biplane ... -
Geometric biplane graphs II: graph augmentation
(2015-03-01)
Article
Accés obertWe 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 into two plane graphs. We show that every ... -
Geometric Biplane Graphs II: Graph Augmentation
(2013)
Text en actes de congrés
Accés obertWe study biplane graphs drawn on a nite point set S in the plane in general position. This is the family of geometric graphs whose vertex set is S and which can be decomposed into two plane graphs. We show that every ... -
Stabbing circles for sets of segments in the plane
(2016)
Text en actes de congrés
Accés restringit per política de l'editorialStabbing a set S of n segments in the plane by a line is a well-known problem. In this paper we consider the variation where the stabbing object is a circle instead of a line. We show that the problem is tightly connected ... -
Stabbing circles for sets of segments in the plane
(2017-03-13)
Article
Accés obertStabbing a set S of n segments in the plane by a line is a well-known problem. In this paper we consider the variation where the stabbing object is a circle instead of a line. We show that the problem is tightly connected ... -
Stabbing circles for some sets of Delaunay segments
(2016)
Text en actes de congrés
Accés obertLet S be a set of n segments in the plane such that, for every segment, its two endpoints are adjacent in the Delaunay triangulation of the set of endpoints of all segments in S. Our goal is to compute all the combinatorially ... -
Terrain visibility with multiple viewpoints
(Springer, 2013)
Text en actes de congrés
Accés obertWe study the problem of visibility in polyhedral terrains in the presence of multiple viewpoints. We consider three fundamental visibility structures: the visibility map, the colored visibility map, and the Voronoi visibility ...
