This paper presents a new image-based modeling method that facilitates the recovery of accurate polyhedral models of architectural scenes. The method is particularly e ective because it exploits many of the constraints that are characteristic of architectural scenes. This work is placed in the context of the Fa cade project, whose goal is to use images to produce photo-realistic novel views of ...

We study the nullcone for the symplectic group with respect to a joint action of the general linear group and the symplectic group. By extracting an algebra over a distributive lattice structure from the coordinate ring of the nullcone, we describe a toric degeneration and standard monomial theory of the nullcone in terms of double tableaux and integral points in a convex polyhedral cone.

The problem of automating rate region converse proofs in multi-source network coding is considered, and an algorithm for explicitly computing polyhedral outer bounds on the rate regions of multi-source network coding instances using known bounds on the entropy function region is proposed. This algorithm is based on the Convex Hull Method, which is an algorithm to compute projections of polyhedr...

During the last twenty years the Polyhedral Skeletal Electron Pair Theory and the isolobal analogy have provided a theoretical basis for the rapid experimental developments, which have occurred in metal cluster chemistry. These theoretical principles have been underpinned by m.o. calculations on specific molecules and more generally by the Tensor Surface Harmonic Theory. This paper will review ...

We develop an explicit covering theory for complexes of groups, parallel to that developed for graphs of groups by Bass. Given a covering of developable complexes of groups, we construct the induced monomorphism of fundamental groups and isometry of universal covers. We characterize faithful complexes of groups and prove a conjugacy theorem for groups acting freely on polyhedral complexes. We a...

We present a polyhedral algorithm to manipulate positive dimensional solution sets. Using facet normals to Newton polytopes as pretropisms, we focus on the first two terms of a Puiseux series expansion. The leading powers of the series are computed via the tropical prevariety. This polyhedral algorithm is well suited for exploitation of symmetry, when it arises in systems of polynomials. Initia...

It was shown in 12] that four-nger force-closure grasps fall into three categories: concurrent, pencil, and regulus grasps. We propose new techniques for computing these three types of grasps. We have implemented them and present examples.