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.

In earlier work, Maire developed a class of cell-centered Lagrangian schemes for solving Euler equations of compressible gas dynamics in cylindrical coordinates. These schemes use a node-based discretization of the numerical fluxes. The control volume version has several distinguished properties, including the conservation of mass, momentum and total energy and compatibility with the geometric conservation law (GCL). However it also has a limitation in that it cannot preserve spherical symmetry for one-dimensional spherical flow. An alternative is also given to use the first order area-weighted approach which can ensure spherical symmetry, at the price of sacrificing conservation of momentum. In this paper, we apply the methodology proposed in our recent work to the first order control volume scheme of Maire to obtain the spherical symmetry property. The modified scheme can preserve one-dimensional spherical symmetry in a two-dimensional cylindrical geometry when computed on an equal-angle-zoned initial grid, and meanwhile it maintains its original good properties such as conservation and GCL. Several two-dimensional numerical examples in cylindrical coordinates are presented to demonstrate the good performance of the scheme in terms of symmetry, non-oscillation and robustness properties.

No abstract uploaded!

No abstract uploaded!

Two functions Δ and Δ_{$b$}, of interest in combinatorial geometry and the theory of linear programming, are defined and studied. Δ($d, n$) is the maximum diameter of convex polyhedra of dimension$d$with$n$faces of dimension$d$−1; similarly, Δ_{$b$}($d,n$) is the maximum diameter of bounded polyhedra of dimension$d$with$n$faces of dimension$d$−1. The diameter of a polyhedron$P$is the smallest integer$l$such that any two vertices of$P$can be joined by a path of$l$or fewer edges of$P$. It is shown that the bounded$d$-step conjecture, i.e. Δ_{$b$}$(d,2d)=d$, is true for$d$≤5. It is also shown that the general$d$-step conjecture, i.e. Δ($d, 2d$)≤$d$, of significance in linear programming, is false for$d$≥4. A number of other specific values and bounds for Δ and Δ_{$b$}are presented.