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

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.

Polyacrylic acid/ octavinyl polyhedral oligomeric silsesquioxane, nanocomposite hydrogel with 3-D network was synthesized via radical polymerization. Octavinyl polyhedral oligomeric silsesquioxane was used as crosslinker and nanofiller simultaneously in the preparation of the hydrogel. Hydrogel adsorption performance was determined by adsorption of methylene blue. The adsorption capacity was ev...

A k-trestle of a graph G is a 2-connected spanning subgraph of G of maximum degree at most k. We show that a polyhedral graph G has a 3-trestle, if the separator-hypergraph of G contains no two different cycles joined by a path of 3-separators of length ≥ 0. There are graphs not satisfying this condition that have no 3-trestles. Further, for each integer k every graph with toughness smaller tha...

In the end of the 19th century Bricard discovered a phenomenon of flexible polyhedra, that is, polyhedra with rigid faces and hinges at edges that admit non-trivial flexes. One of the most important results in this field is a theorem of Sabitov asserting that the volume of a flexible polyhedron is constant during the flexion. In this paper we study flexible polyhedral surfaces in R two-periodic...

We investigate the asymptotics of the number of “overlattices” of a cocompact lattice Γ in Aut(X), where X is a locally finite polyhedral complex. We use complexes of groups to prove an upper bound for general X, and a lower bound for certain right-angled buildings.

In this paper, we give a polyhedral realization of the highest weight crystals B(λ) associated with the highest weight modules V (λ) for the generalized Kac-Moody algebras. As applications, we give explicit descriptions of crystals for the generalized Kac-Moody algebras of ranks 2, 3, and Monster algebras.

A subset S of R is said to be polyhedral if it is the intersection of a finite number of closed halfspaces, i.e., if there exist J ∈ N and collections {y1, . . . , yJ} ⊂ R, {α1, . . . , αJ} ⊂ R such that S = ∩j=1{x ∈ R : y jx ≤ αj}. A function f : R → [−∞,+∞] is polyhedral if its epigraph epi f ⊂ R is a polyhedral set. Clearly, any polyhedral set is automatically convex and closed. Consequently...

a k-nacci sequence in a finite group is a sequence of group elements x0 , x1, x2 ,, xn , forwhich, given an initial (seed) set 0 1 2 1 , , , ,j x x x x  , each element is defined by0 1 11 1for ,for .nnn k n k nxx x j n kxx x x n k        in this paper, we examine the periods of the k-nacci sequences in miller’s generalization of the polyhedralgroups 2,2 2;q , n,2 2;q , 2, n 2;...