Stefanie Wuhrer

Publication List Details

Period

2006 - 2009

Number

25

Co-Authors

Reconfiguration of 3D Crystalline Robots Using O(log n) Parallel Moves (2009)

Aloupis, Greg, Collette, Sebastien, Demaine, Erik D., Langerman, Stefan, Sacristan, Vera, Wuhrer, Stefanie

We consider the theoretical model of Crystalline robots, which have been introduced and prototyped by the robotics community. These robots consist of independently manipulable unit-square atoms that...

Abstract Rotationally Monotone Polygons ∗ (2009)

Prosenjit Bose, Pat Morin, Michiel Smid, Stefanie Wuhrer

A generalization of monotonicity is introduced. An nvertex polygon P is rotationally monotone w.r.t. a point r if there exists a partitioning of the boundary of P into exactly two polygonal chains,...

Geodesic Paths On 3D Surfaces: Survey and Open Problems (2009)

Maheshwari, Anil, Wuhrer, Stefanie

This survey gives a brief overview of theoretically and practically relevant algorithms to compute geodesic paths and distances on three-dimensional surfaces. The survey focuses on polyhedral...

Algorithms for Designing Clamshell Molds (2008)

Stefanie Wuhrer, Prosenjit Bose, Pat Morin, Michiel Smid

Clamshell casting is a popular manufacturing technique where liquid is poured into a mold or cast and the cast is removed once the liquid has hardened. The term clamshell refers to the way in which...

Linear Reconfiguration of Cube-Style Modular Robots (2008)

Greg Aloupis, Sébastien Collette, Mirela Damian, Erik D. Demaine, Stefan Langerman, Suneeta Ramaswami, ...

Abstract. 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...

Linear-Space Algorithms for Distance Preserving Embedding ∗ (2008)

Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel Smid, ...

The distance preserving graph embedding problem is to embed vertices of a given weighted graph into points in 2-dimensional Euclidean space so that for each edge the distance between their...

Linear Reconfiguration of Cube-Style Modular Robots (2008)

Greg Aloupis, Sébastien Collette, Mirela Damian, Erik D. Demaine, Robin Flatl, Vera Sacristán, ...

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

A Linear-Space Algorithm for Distance Preserving Graph Embedding ∗ (2008)

Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel Smid, ...

The distance preserving graph embedding problem is to embed vertices of a given weighted graph into points in d-dimensional Euclidean space for a constant d so that for each edge the distance between...

Linear Reconfiguration of Cube-Style Modular Robots (2008)

Greg Aloupis, Sébastien Collette, Mirela Damian, Erik D. Demaine, Stefan Langerman, Suneeta Ramaswami, ...

Abstract. 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...

Morphing of Triangular Meshes in Shape Space (2008)

Wuhrer, Stefanie, Bose, Prosenjit, Shu, Chang, O'Rourke, Joseph, Brunton, Alan

We present a novel approach to morph between two isometric poses of the same non-rigid object given as triangular meshes. We model the morphs as linear interpolations in a suitable shape space...

Linear-Space Algorithms for Distance Preserving Embedding ∗ (2008)

Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel Smid, ...

The distance preserving graph embedding problem is to embed vertices of a given weighted graph into points in 2-dimensional Euclidean space so that for each edge the distance between their...

Linear Reconfiguration of Cube-Style Modular Robots (2008)

Greg Aloupis, Sébastien Collette, Mirela Damian, Erik D. Demaine, Robin Flatl, ...

In this paper we propose a novel algorithm for both contracting and expanding cube-style modular robots which reconfigures any given source robot composed of n atoms into any given target robot with...

ALGORITHMS FOR OPTIMAL OUTLIER REMOVAL ∗ (2008)

Rossen Atanassov, Prosenjit Bose, Mathieu Couture, Anil Maheshwari, Pat Morin, Michel Paquette, ...

Abstract. We consider the problem of removing c points from a set S of n points so that the remaining point set is optimal in some sense. Definitions of optimality we consider include having minimum...

Linear Reconfiguration of Cube-Style Modular Robots (2008)

Greg Aloupis, Sébastien Collette, Mirela Damian, Erik D. Demaine, Robin Flatl, Suneeta Ramaswami, ...

Abstract. 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...

Clamshell Casting ∗ (2008)

Prosenjit Bose, Pat Morin, Michiel Smid, Stefanie Wuhrer

A popular manufacturing technique is clamshell casting, where liquid is poured into a cast and the cast is removed by a rotation once the liquid has hardened. We consider the case where the object to...

Algorithms for Optimal Outlier Removal 1 Abstract Rossen Atanassov, Prosenjit Bose, Mathieu Couture, (2008)

Anil Maheshwari, Pat Morin, Michel Paquette, Michiel Smid, Stefanie Wuhrer

We consider the problem of removing c points from a set S of n points so that the remaining point set is optimal in some sense. Definitions of optimality we consider include having minimum diameter,...

ARTICLE IN PRESS COMGEO:889 JID:COMGEO AID:889 /FLA [m3SC+; v 1.70; Prn:5/04/2007; 14:09] P.1 (1-16) Computational Geometry •• • (••••) •••–••• (2007)

Rotationally Monotone Polygons, Prosenjit Bose, Pat Morin, Michiel Smid, Stefanie Wuhrer

doi:10.1016/j.comgeo.2007.02.004 www.elsevier.com/locate/comgeo We introduce a generalization of monotonicity. An n-vertex polygon P is rotationally monotone with respect to a point r if there exists...

A Characterization of the Degree Sequences of 2-Trees (2006)

Bose, Prosenjit, Dujmović, Vida, Krizanc, Danny, Langerman, Stefan, Morin, Pat, Wood, David R., ...

A graph G is a 2-tree if G=K_3, or G has a vertex v of degree 2, whose neighbours are adjacent, and G\v{i}s a 2-tree. A characterization of the degree sequences of 2-trees is given. This...

Rotational clamshell casting in two dimensions (2006)

Prosenjit Bose, Pat Morin, Michiel Smid, Stefanie Wuhrer

A popular manufacturing technique is clamshell casting, where liquid is poured into a cast and the cast is removed once the liquid has hardened. We consider the case where the object to be...

Rotational clamshell casting in three dimensions (2006)

Prosenjit Bose, Pat Morin, Michiel Smid, Stefanie Wuhrer

A popular manufacturing technique is clamshell casting, where liquid is poured into a cast and the cast is removed once the liquid has hardened. We consider the case where the object to be...

Removing outliers to minimize area and perimeter (2006)

Rossen Atanassov, Pat Morin, Stefanie Wuhrer

We consider the problem of removing c points from a set S of n points so that the resulting point set has the smallest possible convex hull. Our main result is an O � n � � � � � 4c c 2c...

Removing outliers to minimize area and perimeter (2006)

Rossen Atanassov, Pat Morin, Stefanie Wuhrer

We consider the problem of removing c points from a set S of n points so that the resulting point set has the smallest possible convex hull. Our main result is an O � n � � � � � 4c c 2c...

Removing outliers to minimize area and perimeter (2006)

Rossen Atanassov, Pat Morin, Stefanie Wuhrer

Abstract. We consider the problem of removing c points from a set S of n points so that the resulting point set has the smallest possible convex hull. Our main result is an O � n � � � �...