Related papers: Intersection of paraboloids and application to Min…
The problem deals with an exact calculation of the intersection area of a circle arbitrary placed on a grid of square shaped elements with gaps between them (finite fill factor). Usually an approximation is used for the calculation of the…
In this paper, we discuss the algorithm engineering aspects of an O(n^2)-time algorithm [6] for computing a minimum-area convex polygon that intersects a set of n isothetic line segments.
In the space of holomorphic functions in a convex domain it is studied the interpolation problem by means of sums of the series of exponentials converging uniformly on all compact sets of the domain. The discrete set of the interpolation…
We consider the planar restricted $N$-body problem where the $N-1$ primaries are assumed to be in a central configuration whereas the infinitesimal particle escapes to infinity in a parabolic orbit. We prove the existence of transversal…
In this note we investigate the behavior of the volume that the convex hull of two congruent and intersecting simplices in Euclidean $n$-space can have. We prove some useful equalities and inequalities on this volume. For the regular…
In this work, we use algebraic methods for studying distance computation and subgraph detection tasks in the congested clique model. Specifically, we adapt parallel matrix multiplication implementations to the congested clique, obtaining an…
This paper constructs (with challenging obstacles) on the three torus with its cubical decomposition: Firstly, a combinatorial graded intersection algebra (graded by the codimension) which is commutative and associative defined by…
A generalization of pairwise intersecting Minkowski arrangement of centrally symmetric convex bodies is the pairwise intersecting Minkowski arrangement of order $\mu$. Here, the homothetic copies of a centrally symmetric convex body are so…
In this paper We investigate the Lu Qi-Keng problem for intersection of two complex ellipsoids $\{z \in \mathbb{C}^3 \colon |z_1|^2 + |z_2|^q < 1, \quad |z_1|^2 + |z_3|^r < 1\}$.
Let $f \colon \mathcal{M} \to \mathbb{R}$ be a Lipschitz and geodesically convex function defined on a $d$-dimensional Riemannian manifold $\mathcal{M}$. Does there exist a first-order deterministic algorithm which (a) uses at most…
We introduce a fast, high-precision algorithm for calculating intersections between great circle arcs and lines of constant latitude on the unit sphere. We first propose a simplified intersection point formula with improved speed and…
We present a simplification of the recursive algorithm for the evaluation of intersection numbers for differential $n$-forms, by combining the advantages emerging from the choice of delta-forms as generators of relative twisted cohomology…
We study polar orbitopes, i.e. convex hulls of orbits of a polar representation of a compact Lie group. The face structure is studied by means of the gradient momentum map and it is shown that every face is exposed and is again a polar…
In this work we study algebraic, geometric and topological properties of the Milnor classes of local complete intersections with arbitrary singularities. We describe first the Milnor class of the intersection of a finite number of…
Optimization over the intersection of two manifolds arises in a broad range of applications, but is hindered by the coupled geometry of the feasible region. In this paper, we prove that the regularities -- clean intersection and intrinsic…
In this paper, we study arrangements of orthogonal circles, that is, arrangements of circles where every pair of circles must either be disjoint or intersect at a right angle. Using geometric arguments, we show that such arrangements have…
In this short article, we find an explicit formula for Maslov index of Whitney n-gons joining intersections points of n half-dimensional tori in the symmetric product of a surface. The method also yields a formula for the intersection…
We present two exact implementations of efficient output-sensitive algorithms that compute Minkowski sums of two convex polyhedra in 3D. We do not assume general position. Namely, we handle degenerate input, and produce exact results. We…
This letter casts the problem of optimum discrete beamforming as the computation of the Minkowski sum of convex polygons, which is itself a convex polygon. The number of vertices of the latter is at most the sum of the number of vertices of…
Divide-and-conquer is a central paradigm for the design of algorithms, through which some fundamental computational problems, such as sorting arrays and computing convex hulls, are solved in optimal time within $\Theta(n\log{n})$ in the…