Pointwise wave behavior of the Navier-Stokes equations in half space

In this paper, we investigate the pointwise behavior of the solution for the compressible Navier-Stokes equations with mixed boundary condition in half space. Our results show that the leading order of Green's function for the linear system in half space are heat kernels propagating with sound speed in two opposite directions and reflected heat kernel (due to the boundary effect) propagating with positive sound speed. With the strong wave interactions, the nonlinear analysis exhibits the rich wave structure: the diffusion waves interact with each other and consequently, the solution decays with algebraic rate.Comment: Comments and references are added and some typos are corrected. Accepted by DCDS-

Pointwise wave behavior of the Navier-Stokes equations in half space

In this paper, we investigate the pointwise behavior of the solution for the compressible Navier-Stokes equations with mixed boundary condition in half space. Our results show that the leading order of Green's function for the linear system in half space are heat kernels propagating with sound speed in two opposite directions and reflected heat kernel (due to the boundary effect) propagating with positive sound speed. With the strong wave interactions, the nonlinear analysis exhibits the rich wave structure: the diffusion waves interact with each other and consequently, the solution decays with algebraic rate.Comment: Comments and references are added and some typos are corrected. Accepted by DCDS-

Computing Shortest Paths among Curved Obstacles in the Plane

A fundamental problem in computational geometry is to compute an obstacle-avoiding Euclidean shortest path between two points in the plane. The case of this problem on polygonal obstacles is well studied. In this paper, we consider the problem version on curved obstacles, commonly modeled as splinegons. A splinegon can be viewed as replacing each edge of a polygon by a convex curved edge (polygons are special splinegons). Each curved edge is assumed to be of O(1) complexity. Given in the plane two points s and t and a set of $h$ pairwise disjoint splinegons with a total of $n$ vertices, we compute a shortest s-to-t path avoiding the splinegons, in $O(n+h\log^{1+\epsilon}h+k)$ time, where k is a parameter sensitive to the structures of the input splinegons and is upper-bounded by $O(h^2)$. In particular, when all splinegons are convex, $k$ is proportional to the number of common tangents in the free space (called "free common tangents") among the splinegons. We develop techniques for solving the problem on the general (non-convex) splinegon domain, which also improve several previous results. In particular, our techniques produce an optimal output-sensitive algorithm for a basic visibility problem of computing all free common tangents among $h$ pairwise disjoint convex splinegons with a total of $n$ vertices. Our algorithm runs in $O(n+h\log h+k)$ time and $O(n)$ space, where $k$ is the number of all free common tangents. Even for the special case where all splinegons are convex polygons, the previously best algorithm for this visibility problem takes $O(n+h^2\log n)$ time.Comment: 45 pages, 21 figures; to appear in TALG; an extended-abstract appeared in SoCG 201

Weak Visibility Queries of Line Segments in Simple Polygons

Given a simple polygon P in the plane, we present new algorithms and data structures for computing the weak visibility polygon from any query line segment in P. We build a data structure in O(n) time and O(n) space that can compute the visibility polygon for any query line segment s in O(k log n) time, where k is the size of the visibility polygon of s and n is the number of vertices of P. Alternatively, we build a data structure in O(n^3) time and O(n^3) space that can compute the visibility polygon for any query line segment in O(k + log n) time.Comment: 16 pages, 9 figures. A preliminary version of this paper appeared in ISAAC 2012 and we have improved results in this full versio