No abstract uploaded!

We present a novel remeshing algorithm that avoids triangles with small (acute) angles and those with large (obtuse) angles. Our solution is based on an extension of Centroidal Voronoi Tesselation (CVT).We augment the original CVT formulation with a penalty term that penalizes short Voronoi edges, while the CVT term helps to avoid small angles. Our results show significant improvements in remeshing quality over the state of the art.

No abstract uploaded!

In this note we show that one open 4-dimensional ellipsoid embeds symplectically into another if and only if the ECH capacities of the first are no larger than those of the second. This proves a conjecture due to Hofer. The argument uses the equivalence of the ellipsoidal embedding problem with a ball embedding problem that was recently established by McDuff. Its method is inspired by Hutchings’ recent results on embedded contact homology (ECH) capacities but does not use them.

We prove the following conjecture of Furstenberg (1969): if 𝐴,𝐵⊂[0,1] are closed and invariant under ×𝑝 mod1 and ×𝑞 mod1, respectively, and if log𝑝/log𝑞∉ℚ, then for all real numbers 𝑢 and 𝑣, dim_H (𝑢𝐴 + 𝑣) ∩ 𝐵 ≤ max {0, dim_H 𝐴 + dim_H 𝐵 − 1}. We obtain this result as a consequence of our study on the intersections of incommensurable self-similar sets on ℝ. Our methods also allow us to give upper bounds for dimensions of arbitrary slices of planar self-similar sets satisfying SSC and certain natural irreducible conditions.