#### Filter Results:

#### Publication Year

1997

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We show that the Yao graph Y 4 in the L 2 metric is a spanner with stretch factor 8 √ 2(29+ 23 √ 2). Enroute to this, we also show that the Yao graph Y ∞ 4 in the L∞ metric is a plane spanner with stretch factor 8.

We show that, for any integer k ≥ 6, the Sparse-Yao graph Y Y 6k (also known as Yao-Yao) is a spanner with stretch factor 11.67. The stretch factor drops down to 4.75 for k ≥ 8.

Let S and T be two sets of points with total cardinality n. The minimum-cost many-to-many matching problem matches each point in S to at least one point in T and each point in T to at least one point in S, such that sum of the matching costs is minimized. Here we examine the special case where both S and T lie on the line and the cost of matching s ∈ S to t… (More)

- Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Joseph O'Rourke, André van Renssen +2 others
- JoCG
- 2014

For a set of points in the plane and a fixed integer k > 0, the Yao graph Yk partitions the space around each point into k equiangular cones of angle &thetas; = 2π/k, and connects each point to a nearest neighbor in each cone. It is known for all Yao graphs, with the sole exception of Y5, whether or not they are geometric spanners. In this paper we… (More)

The data distribution problem is very complex, because it involves trade-off decisions between minimizing communication and maximizing parallelism. A common approach towards solving this problem is to break the data mapping into two stages: an alignment stage and a distribution stage. The alignment stage attempts to increase parallelism, while the… (More)

- Mirela Damian, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Dania El-Khechen, Robin Y. Flatland +7 others
- CCCG
- 2006

- Zachary Abel, Nadia Benbernou, Mirela Damian, Erik D. Demaine, Martin L. Demaine, Robin Y. Flatland +2 others
- SODA
- 2010

We introduce the problem of <i>shape replication</i> in the Wang tile self-assembly model. Given an input shape, we consider the problem of designing a self-assembly system which will replicate that shape into either a specific number of copies, or an unbounded number of copies. Motivated by practical DNA implementations of Wang tiles, we consider a model… (More)

In this paper we propose a novel algorithm that, given a source robot S and a target robot T , reconfigures S into T. Both S and T are robots composed of n atoms arranged in 2 × 2 × 2 meta-modules. The reconfiguration involves a total of O(n) atom operations (expand, contract, attach, detach) and is performed in O(n) parallel steps. This improves on… (More)