Now showing items 1-12 of 68

• #### Order types of random point sets can be realized with small integer coordinates ﻿

(2017)
Conference report
Open Access
Let S := {p1, . . . , pn} be a set of n points chosen independently and uniformly at random from the unit square and let M be a positive integer. For every point pi = (xi , yi) in S, let p 0 i = (bMxic, bMyic). Let S 0 := ...
• #### Matching points with diametral disks ﻿

(2017)
Conference report
Open Access
We consider matchings between a set R of red points and a set B of blue points with diametral disks. In other words, for each pair of matched points p ¿ R and q ¿ B, we consider the diametral disk defined by p and q. We ...
• #### The connectivity of the flip graph of Hamiltonian paths of the grid graph ﻿

(2017)
Conference report
Open Access
Let Gn,m be the grid graph with n columns and m rows. Let Hn,m be the graph whose vertices are the Hamiltonian paths in Gn,m, where two vertices P1 and P2 are adjacent if we can obtain P2 from P1 by deleting an edge in P1 ...
• #### Location in maximal outerplanar graphs ﻿

(2017)
Conference report
Restricted access - publisher's policy
In this work we study the metric dimension and the location-domination number of maximal outerplanar graphs. Concretely, we determine tight upper and lower bounds on the metric dimension and characterize those maximal ...
• #### Locating-dominating partitions in graphs ﻿

(2016)
Conference report
Open Access
Let G = (V, E) be a connected graph of order n. Let ¿ = {S1, . . . , Sk} be a partition of V . Let r(u|¿) denote the vector of distances between a vertex v ¿ V and the elements of ¿, that is, r(v, ¿) = (d(v, S1), . . . ...
• #### Map construction algorithms: an evaluation through hiking data ﻿

(Association for Computing Machinery (ACM), 2017)
Conference report
Restricted access - publisher's policy
We study five existing map construction algorithms, designed and tested with urban vehicle data in mind, and apply them to hiking trajectories with different terrain characteristics. Our main goal is to better understand ...
• #### Implementing data-dependent triangulations with higher order Delaunay triangulations ﻿

(Association for Computing Machinery (ACM), 2016)
Conference report
Restricted access - publisher's policy
The Delaunay triangulation is the standard choice for building triangulated irregular networks (TINs) to represent terrain surfaces. However, the Delaunay triangulation is based only on the 2D coordinates of the data points, ...
• #### Stabbing circles for some sets of Delaunay segments ﻿

(2016)
Conference report
Open Access
Let 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 ...
• #### Stabbing circles for sets of segments in the plane ﻿

(2016)
Conference report
Restricted access - publisher's policy
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 ...
• #### A new meta-module for efficient reconfiguration of hinged-units modular robots ﻿

(Institute of Electrical and Electronics Engineers (IEEE), 2016)
Conference report
Open Access
We present a robust and compact meta-module for edge-hinged modular robot units such as M-TRAN, SuperBot, SMORES, UBot, PolyBot and CKBot, as well as for central-point-hinged ones such as Molecubes and Roombots. Thanks ...
• #### Ramsey numbers for empty convex polygons ﻿

(University of Ljubljana, 2015)
Conference report
Restricted access - publisher's policy
We study a geometric Ramsey type problem where the vertices of the complete graph Kn are placed on a set S of n points in general position in the plane, and edges are drawn as straight-line segments. We define the empty ...
• #### On the disks with diameters the sides of a convex 5-gon ﻿

(Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada II (MA2), 2015)
Conference report
Restricted access - publisher's policy
We prove that for any convex pentagon there are two disks, among the five disks having a side of the pentagon as diameter and the midpoint of the side as its center, that do not intersect. This shows that K5 is never the ...