We prove the existence of normal forms for some local real-analytic Levi-flat hypersurfaces with an isolated line singularity. We also give sufficient conditions for a Levi-flat hypersurface with a complex line as singularity to be a pullback of a real-analytic curve in $\mathbb{C}$ via a holomorphic function.

The development of shocks in nonlinear hyperbolic conservation laws may be regularized through either diffusion or relaxation. However, we have observed surprisingly that for some physical problems, when both of the smoothing factors - diffusion and relaxation - coexist, under appropriate asymptotic assumptions, the dispersive waves are enhanced. This phenomenon is studied asymptotically in the sense of the Chapman-Enskog expansion and demonstrated numerically.

No abstract uploaded!

In this paper, we give the sharp upper bound for the number of vertices with positive curvature in a planar graph with nonnegative combinatorial curvature. Based on this, we show that the automorphism group of a planar—possibly infinite—graph with nonnegative combinatorial curvature and positive total curvature is a finite group, and give an upper bound estimate for the order of the group.

Delaunay meshes (DM) are a special type of triangle mesh where the local Delaunay condition holds everywhere. We present an efficient algorithm to convert an arbitrary manifold triangle mesh M into a Delaunay mesh. We show that the constructed DM has O(Kn) vertices, where n is the number of vertices in M and K is a model-dependent constant. We also develop a novel algorithm to simplify Delaunay meshes, allowing a smooth choice of detail levels. Our methods are conceptually simple, theoretically sound and easy to implement. The DM construction algorithm also scales well due to its O(nK logK) time complexity. Delaunay meshes have many favorable geometric and numerical properties. For example, a DM has exactly the same geometry as the input mesh, and it can be encoded by any mesh data structure. Moreover, the empty geodesic circumcircle property implies that the commonly used cotangent Laplace-Beltrami operator has non-negative weights. Therefore, the existing digital geometry processing algorithms can benefit the numerical stability of DM without changing any codes. We observe that DMs can improve the accuracy of the heat method for computing geodesic distances. Also, popular parameterization techniques, such as discrete harmonic mapping, produce more stable results on the DMs than on the input meshes.