We 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” ...

Rectangulations are partitions of a square into axis-aligned rectangles. A number of results provide bijections between combinatorial equivalence classes of rectangulations and families of pattern-avoiding permutations. ...

In this paper we address the problem of segmenting a trajectory such that each segment is in some sense homogeneous. We formally define different spatio-temporal criteria under which a trajectory can be homogeneous, including ...

In a visibility representation of a graph G, the vertices are represented by nonoverlapping geometric objects, while the edges are represented as segments that only intersect the geometric objects associated with their ...

We study an algorithmic problem that is motivated by ink minimization for sparse set visualizations. Our input is a set of points in the plane which are either blue, red, or purple. Blue points belong exclusively to the ...

A formal framework for the development of algebraic specifications is presented. Ther main issues concerning the approach are the following: we allow to deal with incomplete specifications during the design process. This ...

In this paper we propose novel algorithms for reconfiguring modular robots that are composed of n atoms. Each atom has the shape of a unit cube and can expand/contract each face by half a unit, as well as attach to or ...

The farthest-color Voronoi diagram (FCVD) is a farthestsite Voronoi structure defined on a family P of m point-clusters in the plane, where the total number of points is n. The FCVD finds applications in problems related ...