We consider the flow of closed convex hypersurfaces in Euclidean space R^{n+1} with speed given by a power of the k-th mean curvature E_k plus a global term chosen to impose a constraint involving the enclosed volume V_{n+1} and the mixed volume V_{n+1−k} of the evolving hypersurface. We prove that if the initial hypersurface is strictly convex, then the solution of the flow exists for all time and converges to a round sphere smoothly. No curvature pinching assumption is required on the initial hypersurface.

Suppose V^G is the fixed-point vertex operator subalgebra of a compact group G acting on a simple abelian intertwining algebra V. We show that if all irreducible V^G-modules contained in V live in some braided tensor category of V^G-modules, then they generate a tensor subcategory equivalent to the category Rep G of finite-dimensional representations of G, with associativity and braiding isomorphisms modified by the abelian 3-cocycle defining the abelian intertwining algebra structure on V. Additionally, we show that if the fusion rules for the irreducible V^G-modules contained in V agree with the dimensions of spaces of intertwiners among G-modules, then the irreducibles contained in V already generate a braided tensor category of V^G-modules. These results do not require rigidity on any tensor category of V^G-modules and thus apply to many examples where braided tensor category structure is known to exist but rigidity is not known; for example they apply when V^G is C_2-cofinite but not necessarily rational. When V^G is both C_2-cofinite and rational and V is a vertex operator algebra, we use the equivalence between Rep G and the corresponding subcategory of V^G-modules to show that V is also rational. As another application, we show that a certain category of modules for the Virasoro algebra at central charge 1 admits a braided tensor category structure equivalent to Rep SU(2), up to modification by an abelian 3-cocycle.

No abstract uploaded!

No abstract uploaded!

We propose a novel framework for reconstructing lightweight polygonal surfaces from point clouds. Unlike traditional methods that focus on either extracting good geometric primitives or obtaining proper arrangements of primitives, the emphasis of this work lies in intersecting the primitives (planes only) and seeking for an appropriate combination of them to obtain a manifold polygonal surface model without boundary. We show that reconstruction from point clouds can be cast as a binary labeling problem. Our method is based on a hypothesizing and selection strategy. We first generate a reasonably large set of face candidates by intersecting the extracted planar primitives. Then an optimal subset of the candidate faces is selected through optimization. Our optimization is based on a binary linear programming formulation under hard constraints that enforce the final polygonal surface model to be manifold and watertight. Experiments on point clouds from various sources demonstrate that our method can generate lightweight polygonal surface models of arbitrary piecewise planar objects. Besides, our method is capable of recovering sharp features and is robust to noise, outliers, and missing data.