Related papers: Some New Insights from Highly Optimized Polyhedral…
The landscapes of a polyhedron are subsets of its nets one must consider to identify all shortest paths. Landscapes of cubes and tetrahedra have been used to identify coordinate based formulas for the lengths of the shortest paths between…
We show the existence of regular combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, t-designs, and t-wise…
We study the Travelling Salesman Problem (TSP) on the metric completion of cubic and subcubic graphs, which is known to be NP-hard. The problem is of interest because of its relation to the famous 4/3 conjecture for metric TSP, which says…
The Procrustes distance is used to quantify the similarity or dissimilarity of (3-dimensional) shapes, and extensively used in biological morphometrics. Typically each (normalized) shape is represented by N landmark points, chosen to be…
In 1907, Henry Ernest Dudeney posed a puzzle: ``cut any equilateral triangle \dots\ into as few pieces as possible that will fit together and form a perfect square'' (without overlap, via translation and rotation). Four weeks later, Dudeney…
Define a body A to be able to hide behind a body B if the orthogonal projection of B contains a translation of the corresponding orthogonal projection of A in every direction. In two dimensions, it is easy to observe that there exist two…
We provide conjectural necessary and (separately) sufficient conditions for the Hilbert scheme of points of a given length to have the maximum dimension tangent space at a point. The sufficient condition is claimed for 3D and reduces the…
We consider polyhedral approximations of strictly convex compacta in finite dimensional Euclidean spaces (such compacta are also uniformly convex). We obtain the best possible estimates for errors of considered approximations in the…
Three-dimensional $N^{th}$ order nodal Lagrangian tetrahedral finite elements ($P_N$ elements) can be generated using Pascal's tetrahedron $\mathcal{H}$ where each node in 3D element space corresponds to an entry in $\mathcal{H}$. For the…
Using a residuum approach, we provide a complete description of the space of the rational spatial curves of given tangent directions. The rational Pythagorean hodograph curves are obtained as a special case when the norm of the direction…
It is conjectured that all decomposable (i.e. interior can be triangulated without adding new vertices) polyhedra with vertices in convex position are infinitesimally rigid and only recently has it been shown that this is indeed true under…
Checking mesh validity is a mandatory step before doing any finite element analysis. If checking the validity of tetrahedra is trivial, checking the validity of hexahedral elements is far from being obvious. In this paper, a method that…
A fake octagon is a genus two translation surface with only one singular point and the same periods as the octagon. Existence of infinitely many fakes was first established by McMullen in 2007, and more generally follows from dynamical…
It is well known that a rigid motion of the Euclidean plane can be written as the composition of at most three reflections. It is perhaps not so widely known that a similar result holds for Euclidean space in any number of dimensions. The…
There are many space subdivision and space partitioning techniques used in many algorithms to speed up computations. They mostly rely on orthogonal space subdivision, resp. using hierarchical data structures, e.g. BSP trees, quadtrees,…
One of the key challenges in quantum information is coherently manipulating the quantum state. However, it is an outstanding question whether control can be realized with low error. Only gates from the Clifford group -- containing $\pi$,…
We present novel fully-symmetric quadrature rules with positive weights and strictly interior nodes of degrees up to 84 on triangles and 40 on tetrahedra. Initial guesses for solving the nonlinear systems of equations needed to derive…
In $2013$ a novel self-assembly strategy for polypeptide nanostructure design which could lead to significant developments in biotechnology was presented in [Design of a single-chain polypeptide tetrahedron assembled from coiled-coil…
This paper reports about the development of two provably correct approximate algorithms which calculate the Euclidean shortest path (ESP) within a given cube-curve with arbitrary accuracy, defined by $\epsilon >0$, and in time complexity…
This paper presents an improved analysis of a structured dimension-reduction map called the subsampled randomized Hadamard transform. This argument demonstrates that the map preserves the Euclidean geometry of an entire subspace of vectors.…