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.

No abstract uploaded!

No abstract uploaded!

Homological Projective duality (HP-duality) theory, introduced by Kuznetsov \cite{Kuz07HPD}, is one of the most powerful frameworks in the homological study of algebraic geometry. The main result (HP-duality theorem) of the theory gives complete descriptions of bounded derived categories of coherent sheaves of (dual) linear sections of HP-dual varieties. We show the theorem also holds for more general intersections beyond linear sections. More explicitly, for a given HP-dual pair $(X,Y)$, then analogue of HP-duality theorem holds for their intersections with another HP-dual pair $(S,T)$, provided that they intersect properly. We also prove a relative version of our main result. Taking $(S,T)$ to be dual linear subspaces (resp. subbundles), our method provides a more direct proof of the original (relative) HP-duality theorem.

This paper studies the Voronoi diagrams on 2-manifold meshes based on geodesic metric (a.k.a. geodesic Voronoi diagrams or GVDs), which have polyline generators. We show that our general setting leads to situations more complicated than conventional 2D Euclidean Voronoi diagrams as well as point-source based GVDs, since a typical bisector contains line segments, hyperbolic segments and parabolic segments. To tackle this challenge, we introduce a new concept, called local Voronoi diagram (LVD), which is a combination of additively weighted Voronoi diagram and line-segment Voronoi diagram on a mesh triangle. We show that when restricting on a single mesh triangle, the GVD is a subset of the LVD and only two types of mesh triangles can contain GVD edges. Based on these results, we propose an efficient algorithm for constructing the GVD with polyline generators. Our algorithm runs in O(nNlogN) time and takes O(nN) space on an n-face mesh with m generators, where N = max{m,n}. Computational results on real-world models demonstrate the efficiency of our algorithm.