Related papers: Vertex Classification of Planar C-polygons
The convex hull of N independent random points chosen on the boundary of a simple polytope in R^n is investigated. Asymptotic formulas for the expected number of vertices and facets, and for the expectation of the volume difference are…
A planar set $P$ is said to be cover-decomposable if there is a constant $k=k(P)$ such that every $k$-fold covering of the plane with translates of $P$ can be decomposed into two coverings. It is known that open convex polygons are…
We prove area bounds for planar convex bodies in terms of their number of interior integral points and their lattice width data. As an application, we obtain sharp area bounds for rational polygons with a fixed number of interior integral…
A lattice point $\vec x=(x_1,\dots,x_n)\in\mathbb Z^{n}$ is said to be visible if the line segment between $\vec x$ and the origin contains no other lattice point. In this paper, we compute the asymptotic density of visible lattice points…
We study the lengths of curves passing through a fixed number of points on the boundary of a convex shape in the plane. We show that for any convex shape $K$, there exist four points on the boundary of $K$ such that the length of any curve…
Fix any $\lambda\in\mathbb{C}$. We say that a set $S\subseteq\mathbb{C}$ is $\lambda$-$convex$ if, whenever $a$ and $b$ are in $S$, the point $(1-\lambda)a+\lambda b$ is also in $S$. If $S$ is also (topologically) closed, then we say that…
The present article includes the enumeration of $n$-polygons with a certain symmetry property: For an even number $n$ of vertices, we count the $n$-polygons with $\frac{n}{2}$ symmetry axes. In addition, if $n$ is a power of 2, we show the…
Let P be a polygon with rational vertices in the plane. We show that for any finite odd-sized collection of translates of P, the area of the set of points lying in an odd number of these translates is bounded away from 0 by a constant…
It is conjectured since long that for any convex body $P\subset \mathbb{R}^n$ there exists a point in its interior which belongs to at least $2n$ normals from different points on the boundary of $P$. The conjecture is known to be true for…
This paper proposed a method to judge whether the point is inside or outside of the simple convex polygon by the intersection of the vertical line. It determined the point to an area enclosed by two straight lines, then convert the problem…
A convex cone is homogeneous if its automorphism group acts transitively on the interior of the cone, i.e., for every pair of points in the interior of the cone, there exists a cone automorphism that maps one point to the other. Cones that…
In this paper, we investigate the characterization of balanced bounded convex domains in $\mathbb{C}^n$ in terms of the squeezing function. As an application, we provide a characterization of the polydisc in $\mathbb{C}^n$.
Let $B$ be a point robot moving in the plane, whose path is constrained to forward motions with curvature at most one, and let $P$ be a convex polygon with $n$ vertices. Given a starting configuration (a location and a direction of travel)…
We prove that all locally exposable points in a Stein compact in a complex space can be exposed along a given curve to a given real hypersurface. Moreover, the exposing map for a boundary point can be sufficiently close to the identity map…
We study the motion of a single point vortex in simply and multiply connected polygonal domains. In case of multiply connected domains, the polygonal obstacles can be viewed as the cross-sections of 3D polygonal cylinders. First, we utilize…
We classify the connected-homogeneous digraphs with more than one end. We further show that if their underlying undirected graph is not connected-homogeneous, they are highly-arc-transitive.
Given a planar straight-line graph $G=(V,E)$ in $\mathbb{R}^2$, a \emph{circumscribing polygon} of $G$ is a simple polygon $P$ whose vertex set is $V$, and every edge in $E$ is either an edge or an internal diagonal of $P$. A circumscribing…
Three polynomials are defined for given sets $S$ of $n$ points in general position in the plane: The Voronoi polynomial with coefficients the numbers of vertices of the order-$k$ Voronoi diagrams of $S$, the circle polynomial with…
A line g is a transversal to a family F of convex polytopes in 3-dimensional space if it intersects every member of F. If, in addition, g is an isolated point of the space of line transversals to F, we say that F is a pinning of g. We show…
We study the multiplicative convolution for c-monotone independence. This convolution unifies the monotone, Boolean and orthogonal multiplicative convolutions. We characterize convolution semigroups for the c-monotone multiplicative…