Articles de revista
http://hdl.handle.net/2117/3197
2017-09-24T03:30:11ZStabbing segments with rectilinear objects
http://hdl.handle.net/2117/104941
Stabbing segments with rectilinear objects
Claverol Aguas, Mercè; Garijo Royo, Delia; Korman, Matias; Seara Ojea, Carlos; Silveira, Rodrigo Ignacio
Given a set S of n line segments in the plane, we say that a region R¿R2 is a stabber for S if R contains exactly one endpoint of each segment of S. In this paper we provide optimal or near-optimal algorithms for reporting all combinatorially different stabbers for several shapes of stabbers. Specifically, we consider the case in which the stabber can be described as the intersection of axis-parallel halfplanes (thus the stabbers are halfplanes, strips, quadrants, 3-sided rectangles, or rectangles). The running times are O(n) (for the halfplane case), O(nlog¿n) (for strips, quadrants, and 3-sided rectangles), and O(n2log¿n) (for rectangles).
2017-05-26T16:14:19ZClaverol Aguas, MercèGarijo Royo, DeliaKorman, MatiasSeara Ojea, CarlosSilveira, Rodrigo IgnacioGiven a set S of n line segments in the plane, we say that a region R¿R2 is a stabber for S if R contains exactly one endpoint of each segment of S. In this paper we provide optimal or near-optimal algorithms for reporting all combinatorially different stabbers for several shapes of stabbers. Specifically, we consider the case in which the stabber can be described as the intersection of axis-parallel halfplanes (thus the stabbers are halfplanes, strips, quadrants, 3-sided rectangles, or rectangles). The running times are O(n) (for the halfplane case), O(nlog¿n) (for strips, quadrants, and 3-sided rectangles), and O(n2log¿n) (for rectangles).On perfect and quasiperfect dominations in graphs
http://hdl.handle.net/2117/104244
On perfect and quasiperfect dominations in graphs
Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Cáceres, José; Puertas, M. Luz
A subset S ¿ V in a graph G = ( V , E ) is a k -quasiperfect dominating set (for k = 1) if every vertex not in S is adjacent to at least one and at most k vertices in S . The cardinality of a minimum k -quasiperfect dominating set in G is denoted by ¿ 1 k ( G ). Those sets were first introduced by Chellali et al. (2013) as a generalization of the perfect domination concept and allow us to construct a decreasing chain of quasiperfect dominating numbers n = ¿ 11 ( G ) = ¿ 12 ( G ) = ... = ¿ 1 ¿ ( G ) = ¿ ( G ) in order to indicate how far is G from being perfectly dominated. In this paper we study properties, existence and realization of graphs for which the chain is short, that is, ¿ 12 ( G ) = ¿ ( G ). Among them, one can find cographs, claw-free graphs and graphs with extremal values of ¿ ( G ).
2017-05-10T05:56:12ZHernando Martín, María del CarmenMora Giné, MercèPelayo Melero, Ignacio ManuelCáceres, JoséPuertas, M. LuzA subset S ¿ V in a graph G = ( V , E ) is a k -quasiperfect dominating set (for k = 1) if every vertex not in S is adjacent to at least one and at most k vertices in S . The cardinality of a minimum k -quasiperfect dominating set in G is denoted by ¿ 1 k ( G ). Those sets were first introduced by Chellali et al. (2013) as a generalization of the perfect domination concept and allow us to construct a decreasing chain of quasiperfect dominating numbers n = ¿ 11 ( G ) = ¿ 12 ( G ) = ... = ¿ 1 ¿ ( G ) = ¿ ( G ) in order to indicate how far is G from being perfectly dominated. In this paper we study properties, existence and realization of graphs for which the chain is short, that is, ¿ 12 ( G ) = ¿ ( G ). Among them, one can find cographs, claw-free graphs and graphs with extremal values of ¿ ( G ).Stabbing circles for sets of segments in the plane
http://hdl.handle.net/2117/104128
Stabbing circles for sets of segments in the plane
Claverol Aguas, Mercè; Khramtcova, Elena; Papadopoulou, Evanthia; Saumell, Maria; Seara Ojea, Carlos
Stabbing 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 to two cluster Voronoi diagrams, in particular, the Hausdorff and the farthest-color Voronoi diagram. Based on these diagrams, we provide a method to compute a representation of all the combinatorially different stabbing circles for S, and the stabbing circles with maximum and minimum radius. We give conditions under which our method is fast. These conditions are satisfied if the segments in S are parallel, resulting in a O(nlog2n) time and O(n) space algorithm. We also observe that the stabbing circle problem for S can be solved in worst-case optimal O(n2) time and space by reducing the problem to computing the stabbing planes for a set of segments in 3D. Finally we show that the problem of computing the stabbing circle of minimum radius for a set of n parallel segments of equal length has an O(nlogn) lower bound.
2017-05-05T13:16:02ZClaverol Aguas, MercèKhramtcova, ElenaPapadopoulou, EvanthiaSaumell, MariaSeara Ojea, CarlosStabbing 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 to two cluster Voronoi diagrams, in particular, the Hausdorff and the farthest-color Voronoi diagram. Based on these diagrams, we provide a method to compute a representation of all the combinatorially different stabbing circles for S, and the stabbing circles with maximum and minimum radius. We give conditions under which our method is fast. These conditions are satisfied if the segments in S are parallel, resulting in a O(nlog2n) time and O(n) space algorithm. We also observe that the stabbing circle problem for S can be solved in worst-case optimal O(n2) time and space by reducing the problem to computing the stabbing planes for a set of segments in 3D. Finally we show that the problem of computing the stabbing circle of minimum radius for a set of n parallel segments of equal length has an O(nlogn) lower bound.General properties of c-circulant digraphs
http://hdl.handle.net/2117/103764
General properties of c-circulant digraphs
Mora Giné, Mercè; Serra Albó, Oriol; Fiol Mora, Miquel Àngel
A digraph is said to be a c-circulant if its adjacency matrix is c-circulant. This paper deals with general properties of this family of digraphs, as isomorphisms, regularity, strong connectivity, diameter and the relation between c-circulant digraphs and the line digraph technique.
2017-04-26T17:41:13ZMora Giné, MercèSerra Albó, OriolFiol Mora, Miquel ÀngelA digraph is said to be a c-circulant if its adjacency matrix is c-circulant. This paper deals with general properties of this family of digraphs, as isomorphisms, regularity, strong connectivity, diameter and the relation between c-circulant digraphs and the line digraph technique.Production matrices for geometric graphs
http://hdl.handle.net/2117/103649
Production matrices for geometric graphs
Huemer, Clemens; Pilz, Alexander; Seara Ojea, Carlos; Silveira, Rodrigo Ignacio
We present production matrices for non-crossing geometric graphs on point sets in convex position, which allow us to derive formulas for the numbers of such graphs. Several known identities for Catalan numbers, Ballot numbers, and Fibonacci numbers arise in a natural way, and also new formulas are obtained, such as a formula for the number of non-crossing geometric graphs with root vertex of given degree. The characteristic polynomials of some of these production matrices are also presented. The proofs make use of generating trees and Riordan arrays.
2017-04-24T08:25:14ZHuemer, ClemensPilz, AlexanderSeara Ojea, CarlosSilveira, Rodrigo IgnacioWe present production matrices for non-crossing geometric graphs on point sets in convex position, which allow us to derive formulas for the numbers of such graphs. Several known identities for Catalan numbers, Ballot numbers, and Fibonacci numbers arise in a natural way, and also new formulas are obtained, such as a formula for the number of non-crossing geometric graphs with root vertex of given degree. The characteristic polynomials of some of these production matrices are also presented. The proofs make use of generating trees and Riordan arrays.New results on stabbing segments with a polygon
http://hdl.handle.net/2117/103547
New results on stabbing segments with a polygon
Díaz Bañez, José Miguel; Korman Cozzetti, Matías; Pérez Lantero, Pablo; Pilz, Alexander; Seara Ojea, Carlos; Silveira, Rodrigo Ignacio
We consider a natural variation of the concept of stabbing a set of segments with a simple polygon: a segment s is stabbed by a simple polygon P if at least one endpoint of s is contained in P, and a segment set S is stabbed by P if P stabs every element of S. Given a segment set S, we study the problem of finding a simple polygon P stabbing S in a way that some measure of P (such as area or perimeter) is optimized. We show that if the elements of S are pairwise disjoint, the problem can be solved in polynomial time. In particular, this solves an open problem posed by Loftier and van Kreveld [Algorithmica 56(2), 236-269 (2010)] [16] about finding a maximum perimeter convex hull for a set of imprecise points modeled as line segments. Our algorithm can also be extended to work for a more general problem, in which instead of segments, the set S consists of a collection of point sets with pairwise disjoint convex hulls. We also prove that for general segments our stabbing problem is NP-hard. (C) 2014 Elsevier B.V. All rights reserved.
2017-04-19T12:27:10ZDíaz Bañez, José MiguelKorman Cozzetti, MatíasPérez Lantero, PabloPilz, AlexanderSeara Ojea, CarlosSilveira, Rodrigo IgnacioWe consider a natural variation of the concept of stabbing a set of segments with a simple polygon: a segment s is stabbed by a simple polygon P if at least one endpoint of s is contained in P, and a segment set S is stabbed by P if P stabs every element of S. Given a segment set S, we study the problem of finding a simple polygon P stabbing S in a way that some measure of P (such as area or perimeter) is optimized. We show that if the elements of S are pairwise disjoint, the problem can be solved in polynomial time. In particular, this solves an open problem posed by Loftier and van Kreveld [Algorithmica 56(2), 236-269 (2010)] [16] about finding a maximum perimeter convex hull for a set of imprecise points modeled as line segments. Our algorithm can also be extended to work for a more general problem, in which instead of segments, the set S consists of a collection of point sets with pairwise disjoint convex hulls. We also prove that for general segments our stabbing problem is NP-hard. (C) 2014 Elsevier B.V. All rights reserved.Adjacency-preserving spatial treemaps
http://hdl.handle.net/2117/101755
Adjacency-preserving spatial treemaps
Buchin, Kevin; Eppstein, David; Löffler, Maarten; Nöllenburg, Martin; Silveira, Rodrigo Ignacio
Rectangular layouts, subdivisions of an outer rectangle into smaller rectangles, have many applications in visualizing spatial information, for instance in rectangular cartograms in which the rectangles represent geographic or political regions. A spatial treemap is a rectangular layout with a hierarchical structure: the outer rectangle is subdivided into rectangles that are in turn subdivided into smaller rectangles. We describe algorithms for transforming a rectangular layout that does not have this hierarchical structure, together with a clustering of the rectangles of the layout, into a spatial treemap that respects the clustering and also respects to the extent possible the adjacencies of the input layout.
2017-03-01T07:41:22ZBuchin, KevinEppstein, DavidLöffler, MaartenNöllenburg, MartinSilveira, Rodrigo IgnacioRectangular layouts, subdivisions of an outer rectangle into smaller rectangles, have many applications in visualizing spatial information, for instance in rectangular cartograms in which the rectangles represent geographic or political regions. A spatial treemap is a rectangular layout with a hierarchical structure: the outer rectangle is subdivided into rectangles that are in turn subdivided into smaller rectangles. We describe algorithms for transforming a rectangular layout that does not have this hierarchical structure, together with a clustering of the rectangles of the layout, into a spatial treemap that respects the clustering and also respects to the extent possible the adjacencies of the input layout.Widening the analysis of Energy Return On Investment (EROI) in agroecosystems: A proposal to study socio-ecological transitions to industrialized farm systems (the Vallès County, Catalonia, c.1860 and 1999)
http://hdl.handle.net/2117/100439
Widening the analysis of Energy Return On Investment (EROI) in agroecosystems: A proposal to study socio-ecological transitions to industrialized farm systems (the Vallès County, Catalonia, c.1860 and 1999)
Galán, E.; Padró, R.; Marco, I.; Tello Aragay, Enric; Cunfer, G.; Guzmán, G. I.; González de Molina, M.; Krausmann, F.; Gingrich, S.; Sacristán Adinolfi, Vera; Moreno-Delgado, D.
Energy balances of farm systems have overlooked the role of energy flows that remain within agro-ecosystems. Yet, such internal flows fulfil important socio-ecological functions, including maintenance of farmers themselves and agro-ecosystem structures. Farming can either give rise to complex landscapes that favour associated biodiversity, or the opposite. This variability can be understood by assessing several types of Energy Returns on Investment (EROI). Applying these measures to a farm system in Catalonia, Spain in 1860 and in 1999, reveals the expected decrease in the ratio of final energy output to total and external inputs. The transition from solar-based to a fossil fuel based agro-ecosystem was further accompanied by an increase in the ratio of final energy output to biomass reused, as well as an absolute increase of Unharvested Phytomass grown in derelict forestland. The study reveals an apparent link between reuse of biomass and the decrease of landscape heterogeneity along with its associated biodiversity.
2017-02-01T10:58:29ZGalán, E.Padró, R.Marco, I.Tello Aragay, EnricCunfer, G.Guzmán, G. I.González de Molina, M.Krausmann, F.Gingrich, S.Sacristán Adinolfi, VeraMoreno-Delgado, D.Energy balances of farm systems have overlooked the role of energy flows that remain within agro-ecosystems. Yet, such internal flows fulfil important socio-ecological functions, including maintenance of farmers themselves and agro-ecosystem structures. Farming can either give rise to complex landscapes that favour associated biodiversity, or the opposite. This variability can be understood by assessing several types of Energy Returns on Investment (EROI). Applying these measures to a farm system in Catalonia, Spain in 1860 and in 1999, reveals the expected decrease in the ratio of final energy output to total and external inputs. The transition from solar-based to a fossil fuel based agro-ecosystem was further accompanied by an increase in the ratio of final energy output to biomass reused, as well as an absolute increase of Unharvested Phytomass grown in derelict forestland. The study reveals an apparent link between reuse of biomass and the decrease of landscape heterogeneity along with its associated biodiversity.Computing the canonical representation of constructible sets
http://hdl.handle.net/2117/100350
Computing the canonical representation of constructible sets
Brunat Blay, Josep Maria; Montes Lozano, Antonio
Constructible sets are needed in many algorithms of Computer Algebra, particularly in the GröbnerCover and other algorithms for parametric polynomial systems. In this paper we review the canonical form ofconstructible sets and give algorithms for computing it.
2017-01-31T09:20:18ZBrunat Blay, Josep MariaMontes Lozano, AntonioConstructible sets are needed in many algorithms of Computer Algebra, particularly in the GröbnerCover and other algorithms for parametric polynomial systems. In this paper we review the canonical form ofconstructible sets and give algorithms for computing it.The degree/diameter problem in maximal planar bipartite graphs
http://hdl.handle.net/2117/89907
The degree/diameter problem in maximal planar bipartite graphs
Dalfó Simó, Cristina; Huemer, Clemens; Salas Piñon, Julián
The (Δ,D)(Δ,D) (degree/diameter) problem consists of finding the largest possible number of vertices nn among all the graphs with maximum degree ΔΔ and diameter DD. We consider the (Δ,D)(Δ,D) problem for maximal planar bipartite graphs, that is, simple planar graphs in which every face is a quadrangle. We obtain that for the (Δ,2)(Δ,2) problem, the number of vertices is n=Δ+2n=Δ+2; and for the (Δ,3)(Δ,3) problem, n=3Δ−1n=3Δ−1 if ΔΔ is odd and n=3Δ−2n=3Δ−2 if ΔΔ is even. Then, we prove that, for the general case of the (Δ,D)(Δ,D) problem, an upper bound on nn is approximately 3(2D+1)(Δ−2)⌊D/2⌋3(2D+1)(Δ−2)⌊D/2⌋, and another one is C(Δ−2)⌊D/2⌋C(Δ−2)⌊D/2⌋ if Δ≥DΔ≥D and CC is a sufficiently large constant. Our upper bounds improve for our kind of graphs the one given by Fellows, Hell and Seyffarth for general planar graphs. We also give a lower bound on nn for maximal planar bipartite graphs, which is approximately (Δ−2)k(Δ−2)k if D=2kD=2k, and 3(Δ−3)k3(Δ−3)k if D=2k+1D=2k+1, for ΔΔ and DD sufficiently large in both cases.
2016-09-14T10:33:44ZDalfó Simó, CristinaHuemer, ClemensSalas Piñon, JuliánThe (Δ,D)(Δ,D) (degree/diameter) problem consists of finding the largest possible number of vertices nn among all the graphs with maximum degree ΔΔ and diameter DD. We consider the (Δ,D)(Δ,D) problem for maximal planar bipartite graphs, that is, simple planar graphs in which every face is a quadrangle. We obtain that for the (Δ,2)(Δ,2) problem, the number of vertices is n=Δ+2n=Δ+2; and for the (Δ,3)(Δ,3) problem, n=3Δ−1n=3Δ−1 if ΔΔ is odd and n=3Δ−2n=3Δ−2 if ΔΔ is even. Then, we prove that, for the general case of the (Δ,D)(Δ,D) problem, an upper bound on nn is approximately 3(2D+1)(Δ−2)⌊D/2⌋3(2D+1)(Δ−2)⌊D/2⌋, and another one is C(Δ−2)⌊D/2⌋C(Δ−2)⌊D/2⌋ if Δ≥DΔ≥D and CC is a sufficiently large constant. Our upper bounds improve for our kind of graphs the one given by Fellows, Hell and Seyffarth for general planar graphs. We also give a lower bound on nn for maximal planar bipartite graphs, which is approximately (Δ−2)k(Δ−2)k if D=2kD=2k, and 3(Δ−3)k3(Δ−3)k if D=2k+1D=2k+1, for ΔΔ and DD sufficiently large in both cases.