Edge-intersection graphs of paths in grids are graphs that can be represented with vertices as paths in grids and edges between the vertices of the graph exist whenever two grid paths share a grid edge. This type of graphs is motivated by applications in conflict resolution of paths in grid networks. In this paper, we continue the study of edge-intersection graphs of paths in a grid, which was ...

In this paper we continue the study of the edge intersection graphs of single bend paths on a rectangular grid (i.e., the edge intersection graphs where each vertex is represented by one of the following shapes: x, p, y, q). These graphs, called B1-EPG graphs, were first introduced by Golumbic et al (2009) [5]. We consider the natural subclasses of B1-EPG formed by the subsets of the four singl...

First we recall some standard definitions. By a d-dimensional convex body we mean a compact convex subset of Rd with non-empty interior. Two subsets of Rd with non-empty interiors are non-overlapping if they have no common interior point, and we say that they touch each other if they are non-overlapping and their intersection is non-empty. Denote by H(K) the translative kissing number of a d-di...

Unlike green sand, chemically bonded sand cannot be used again and again without reclamation because in this system, the mixed sand gets it`s strength through chemical reaction which is irreversible in nature. Each sand particle is coated with this reacted chemical, which behaves like an inert element after usage once. This inert coating also called “Dead” binder needs to be removed from the us...

We present an interactive sand art drawing system using one RGB-D sensor, such as Kinect. Our system supports the common sand drawing functions, such as sand erosion, sand spilling, and sand leaking. To use hands to draw virtual sand on a drawing plane, we design four key gestures which enable drawing manipulation actions for sand. The basic idea is that the gesture of one hand controls the dra...

1 We are indebted to Milward (1994) for provoking and providing a starting point for this renewed research on coordination. Many of these ideas were discussed at various meetings and in email discussions and we thank the many participants: Caroline Brun, Max Copperman, Mary Dalrymple, Marc Dymetman, John Fry, Ron Kaplan, Lauri Karttunen, Martin Kay, Paula Newman, Mar a-Eugenia Ni~ no, Fr ed eri...

In general, not much is known about the arithmetic of K3 surfaces. Once the geometric Picard number, which is the rank of the Néron-Severi group over an algebraic closure of the base field, is high enough, more structure is known and more can be said. However, until recently not a single K3 surface was known to have geometric Picard number one. We give explicit examples of such surfaces over th...

Given a tree and a set P of non-trivial simple paths on it, Vpt(P) is the VPT graph (i.e. the vertex intersection graph) of the paths P of the tree T , and Ept(P) is the EPT graph (i.e. the edge intersection graph) of P. These graphs have been extensively studied in the literature. Given two (edge) intersecting paths in a graph, their split vertices is the set of vertices having degree at least...

http://dx.doi.org/10.1016/j.infsof.2015.02.002 0950-5849/ 2015 Elsevier B.V. All rights reserved. ⇑ Corresponding author at: Department of Computer Languages and Systems, University of Seville, Spain. E-mail addresses: [email protected], [email protected] (J.A. Galindo), deepak. [email protected] (D. Dhungana), [email protected] (R. Rabiser), [email protected] (D. Benavides), goetz.botterweck...