Related papers: Landscapes of the Octahedron
The geodesic between two points $a$ and $b$ in the interior of a simple polygon~$P$ is the shortest polygonal path inside $P$ that connects $a$ to $b$. It is thus the natural generalization of straight line segments on unconstrained point…
Skeletal polyhedra and polygonal complexes in ordinary Euclidean 3-space are finite or infinite 3-periodic structures with interesting geometric, combinatorial, and algebraic properties. They can be viewed as finite or infinite 3-periodic…
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 investigates the relationship between a system of differential equations and the underlying geometry associated with it. The geometry of a surface determines shortest paths, or geodesics connecting nearby points, which are…
We study the parameterized complexity of finding shortest s-t-paths with an additional fairness requirement. The task is to compute a shortest path in a vertex-colored graph where each color appears (roughly) equally often in the solution.…
We study self-approaching paths that are contained in a simple polygon. A self-approaching path is a directed curve connecting two points such that the Euclidean distance between a point moving along the path and any future position does…
In this paper, a novel technique for tight outer-approximation of the intersection region of a finite number of ellipses in 2-dimensional (2D) space is proposed. First, the vertices of a tight polygon that contains the convex intersection…
In this paper, a geometrical interpretation of light diffraction is given using an infinity of fluctuating geodesics that represent paths of least time in an homogeneous space. Without using the wave theory, we provide a geometrical…
A complete treatment of the intersections of two geodesics on the surface of an ellipsoid of revolution is given. With a suitable metric for the distances between intersections, bounds are placed on their spacing. This leads to fast and…
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to find a shortest descending path (SDP) from s to t in a…
We define the crossing graph of a given embedded graph (such as a road network) to be a graph with a vertex for each edge of the embedding, with two crossing graph vertices adjacent when the corresponding two edges of the embedding cross…
The shortest path problem is among the most fundamental combinatorial optimization problems to answer reachability queries. It is hard to deter-mine which vertices or edges are visited during shortest path traversals. In this paper, we…
We consider the billiard map inside a polyhedron. We give a condition for the stability of the periodic trajectories. We apply this result to the case of the tetrahedron. We deduce the existence of an open set of tetrahedra which have a…
We present the first polynomial time approximation algorithm for computing shortest paths in weighted three-dimensional domains. Given a polyhedral domain $\D$, consisting of $n$ tetrahedra with positive weights, and a real number…
Any surface that is intrinsically polyhedral can be represented by a collection of simple polygons (fragments), glued along pairs of equally long oriented edges, where each fragment is endowed with the geodesic metric arising from its…
Multi-layered social networks consist of the fixed set of nodes linked by multiple connections. These connections may be derived from different types of user activities logged in the IT system. To calculate any structural measures for…
Understanding the structure of neural network loss surfaces, particularly the emergence of low-loss tunnels, is critical for advancing neural network theory and practice. In this paper, we propose a novel approach to directly embed loss…
We study tetrahedra and the space of tetrahedra from the viewpoint of local and global maxima for intrinsic distance functions.
The circuits of a polyhedron are a superset of its edge directions. Circuit walks, a sequence of steps along circuits, generalize edge walks and are "short" if they have few steps or small total length. Both interpretations of short are…
A quasigeodesic is a curve on the surface of a convex polyhedron that has $\le \pi$ surface to each side at every point. In contrast, a geodesic has exactly $\pi$ to each side and so can never pass through a vertex, whereas quasigeodesics…