Delaunay meshes (DM) are a special type of manifold triangle meshes --- where the local Delaunay condition holds everywhere --- and find important applications in digital geometry processing. This paper addresses the \yongjin{general} DM simplification problem: given an arbitrary manifold triangle mesh M with n vertices and the user-specified resolution m(< n), compute a Delaunay mesh M* with m vertices that has the least Hausdorff distance to M. To solve the problem, we abstract the simplification process using a 2D Cartesian grid model, in which each grid point corresponds to triangle meshes with a certain number of vertices and a simplification process is a monotonic path on the grid. We develop a novel differential-evolution-based method to compute a low-cost path, which leads to a high quality Delaunay mesh. Extensive evaluation shows that our method consistently outperforms the existing methods in terms of approximation error. In particular, our method is highly effective for small-scale CAD models and man-made objects with sharp features but less details. Moreover, our method is fully automatic and can preserve sharp features well and deal with models with multiple components, whereas the existing methods often fail.

No abstract uploaded!

No abstract uploaded!

We show that if E is an s-regular set in R^2 for which the triple integral \int_E \int_E \int_E c(x, y, z)^{2s} dH^sx dH^sy dH^sz of the Menger curvature c is finite and if 0 < s ≤ 1/2, then H^s almost all of E can be covered with countably many C^1 curves. We give an example to show that this is false for 1/2 <s< 1.

Consider an N-Boson system interacting via a two-body repulsive short-range potential $V$ in a three dimensional box  of side length $L$. We take the $limit N,L \to \infty $ while keeping the density $\rho = N/L^3 fixed and small. We prove a new lower bound for its ground state energy per particle $$ \frac{E(N,\Lambda)}{N} \ge 4 \pi a \rho [1- O(\rho^{1/3} | log \rho |^3) ] $$ as $\rho \to 0$, where $a$ is the scattering length of $V$.