#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2001

2016

- This year (0)
- Last 5 years (3)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Val Pinciu
- DMTCS
- 2003

- Greg Aloupis, Sébastien Collette, +9 authors Stefanie Wuhrer
- WAFR
- 2008

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 detach from faces of neighboring atoms. For universal reconfiguration, atoms must be arranged in 2× 2× 2 modules. We respect certain physical… (More)

- T. S. Michael, Val Pinciu
- Comput. Geom.
- 2003

We prove two art gallery theorems in which the guards must guard one another in addition to the gallery. A set G of points (the guards) in a simple closed polygon (the art gallery) is a guarded guard set provided (i) every point in the polygon is visible to some point in G; and (ii) every point in G is visible to some other point in G. We prove that a… (More)

- Greg Aloupis, Sébastien Collette, +8 authors Stefanie Wuhrer
- Robotica
- 2011

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 detach from faces of neighboring atoms. For universal reconfiguration, atoms must be arranged in 2×2×2 modules. We respect certain physical… (More)

- Val Pinciu
- CTW
- 2010

- Val Pinciu
- CCCG
- 2007

Given a convex polyhedron with n vertices and F faces, what is the fewest number of pieces, each of which unfolds to a simple polygon, into which it may be cut by slices along edges? Shephard’s conjecture says that this number is always 1, but it’s still open. The fewest nets problem asks to provide upper bounds for the number of pieces in terms of n and/or… (More)

- T. S. Michael, Val Pinciu
- International Conference on Computational Science
- 2001

- Zachary Abel, David Charlton, +6 authors Godfried T. Toussaint
- ArXiv
- 2008

We propose a variant of Cauchy’s Lemma, proving that when a convex chain on one sphere is redrawn (with the same lengths and angles) on a larger sphere, the distance between its endpoints increases. The main focus of this work is a comparison of three alternate proofs, to show the links between Toponogov’s Comparison Theorem, Legendre’s Theorem and Cauchy’s… (More)

- Val Pinciu
- ICCSA
- 2003

- Val Pinciu
- Electronic Notes in Discrete Mathematics
- 2015

We consider variations of the original art gallery problem where the domain is a polyomino, a polycube, or a polyhypercube. Anm-polyomino is the connected union of m unit squares called pixels, an m-polycube is the connected union of m unit cubes called voxels, and an m-polyhypercube is the connected union of m unit hypercubes in a d dimensional Euclidean… (More)