Related papers: Intersection of paraboloids and application to Min…

Optical surfaces represented by second-degree polynomials (quadratic or conics) are ubiquitous in optics. We revisit the equations of the conic shapes in the context of grazing incidence optics, gathering together the curves commonly used…

Computing the diameter of the intersection graphs of objects is a basic problem in computational geometry. Previous works showed that the complexity of computing the diameter mainly depends on the object types: for unit disks and squares in…

We consider the computation of the volume of the union of high-dimensional geometric objects. While showing that this problem is #P-hard already for very simple bodies (i.e., axis-parallel boxes), we give a fast FPRAS for all objects where…

Matroid intersection is one of the most powerful frameworks of matroid theory that generalizes various problems in combinatorial optimization. Edmonds' fundamental theorem provides a min-max characterization for the unweighted setting,…

This paper develops and compares algorithms to compute inner approximations of the Minkowski sum of convex polytopes. As an application, the paper considers the computation of the feasibility set of aggregations of distributed energy…

I show that particle collider experiments on relativistic nuclear collisions can serve as direct probes of the deformation of the colliding nuclear species. I argue that collision events presenting very large multiplicities of particles and…

This work establishes a deep connection between two seemingly distant branches of nuclear physics: nuclear structure and relativistic heavy-ion collisions. At the heart of this connection is the recent discovery made at particle colliders…

We examine the metrics that arise when a finite set of points is embedded in the real line, in such a way that the distance between each pair of points is at least 1. These metrics are closely related to some other known metrics in the…

For any simple digraph $D$ we offer a new proof for the intersection number of its middle digraph, $M(D)$; while doing so we also solve for the intersection number when $D$ has loops. In addition, a new transformation, the union of $D$ and…

Initial eccentricity of the interacting volume of QCD matter created in collisions of prolate and oblate nuclei is studied using optical Glauber simulation. Collisions of prolate 165-Ho + 165-Ho nuclei and Au+Au nuclei are investigated…

The $L_p$-Minkowski problem deals with the existence of closed convex hypersurfaces in $\mathbb{R}^{n+1}$ with prescribed $p$-area measures. It extends the classical Minkowski problem and embraces several important geometric and physical…

An algorithm is demonstrated that finds an ordinary intersection in an arrangement of $n$ lines in $\mathbb{R}^2$, not all parallel and not all passing through a common point, in time $O(n \log{n})$. The algorithm is then extended to find…

Under conditions that prevent tangential intersection, we prove quadratic convergence of a projection algorithm for the feasibility problem of finding a point in the intersection of a smooth curve and line in $\mathbb{R}^2$. This nonconvex…

Using combinatorial methods, we derive several formulas for the volume of convex bodies obtained by intersecting a unit hypercube with a halfspace, or with a hyperplane of codimension 1, or with a flat defined by two parallel hyperplanes.…

Let $\Gamma\subseteq\text{PSL}(2, \mathbb{R})$ correspond to the group of units of norm $1$ in an Eichler order $\mathrm{O}$ of an indefinite quaternion algebra over $\mathbb{Q}$. Closed geodesics on $\Gamma\backslash\mathbb{H}$ correspond…

The aim of the paper is to develop a unified algebraical approach to representing the Minkowski difference for convex polyhedra. Namely, there is proposed an exact analytical formulas of the Minkowski difference for convex polyhedra with…

In this research paper, the problem of optimization of a quadratic form over the convex hull generated by the corners of hypercube is attempted and solved. It is reasoned that under some conditions, the optimum occurs at the corners of…

The orbit problem is at the heart of symmetry reduction methods for model checking concurrent systems. It asks whether two given configurations in a concurrent system (represented as finite strings over some finite alphabet) are in the same…

We address the problem of constructing elliptic polytopes in R^d, which are convex hulls of finitely many two-dimensional ellipses with a common center. Such sets arise in the study of spectral properties of matrices, asymptotics of long…

Let $E_d(n)$ be the maximum number of pairs that can be selected from a set of $n$ points in $R^d$ such that the midpoints of these pairs are convexly independent. We show that $E_2(n)\geq \Omega(n\sqrt{\log n})$, which answers a question…