Articles de revista
Recent Submissions
-
Maximum box problem on stochastic points
(Springer Nature, 2021-10-28)
Article
Open AccessGiven a finite set of weighted points in Rd (where there can be negative weights), the maximum box problem asks for an axis-aligned rectangle (i.e., box) such that the sum of the weights of the points that it contains is ... -
A new meta-module design for efficient reconfiguration of modular robots
(Springer Nature, 2021-05-01)
Article
Open AccessWe propose a new meta-module design for two important classes of modular robots. The new metamodule is three-dimensional, robust and compact, improving on the previously proposed one. It applies to socalled “edge-hinged” ... -
New production matrices for geometric graphs
(Elsevier, 2022-01-15)
Article
Open AccessWe use production matrices to count several classes of geometric graphs. We present novel production matrices for non-crossing partitions, connected geometric graphs, and k-angulations, which provide another, simple and ... -
On circles enclosing many points
(2021-10-01)
Article
Open AccessWe prove that every set of n red and n blue points in the plane contains a red and a blue point such that every circle through them encloses at least points of the set. This is a two-colored version of a problem posed by ... -
Affine invariant triangulations
(2021-11-01)
Article
Open AccessWe 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 (1993) that ... -
Trees whose even-degree vertices induce a path are antimagic
(2022-08)
Article
Open AccessAn antimagic labeling of a connected 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 v is the sum of the labels ... -
Metric dimension of maximal outerplanar graphs
(2021-02-02)
Article
Open AccessIn 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
Open AccessLet 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
Open AccessComputing 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
Open AccessA 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
(2021)
Article
Open AccessThe 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 ... -
Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations
(Springer Nature, 2021-03)
Article
Open AccessLet 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 ...
RSS 1.0