Geodesic based Voronoi diagrams play an important role in many applications of computer graphics. Constructing such Voronoi diagrams usually resorts to exact geodesics. However, exact geodesic computation always consumes lots of time and memory, which has become the bottleneck of constructing geodesic based Voronoi diagrams. In this paper, we propose the window-VTP algorithm, which can effectively reduce redundant computation and save memory. As a result, constructing Voronoi diagrams using the proposed window-VTP algorithm runs 3-8 times faster than Liu et al.’s method [LCT11], 1.2 times faster than its FWP-MMP variant and more importantly uses 10-70 times less memory than both of them.

No abstract uploaded!

We prove the mean curvature flow of the graph of a symplectomorphism between Riemann surfaces converges smoothly as time approaches infinity.

We construct balanced metrics on the family of non-K¨ahler Calabi-Yau threefolds that are obtained by smoothing after contracting (−1,−1)-rational curves on a K¨ahler Calabi-Yau threefold. As an application, we construct balanced metrics on complex manifolds diffeomorphic to the connected sum of k  2 copies of S3 × S3.

No abstract uploaded!