Related papers: TSP on manifolds
A surface embedded in space, in such a way that each point has a neighborhood within which the surface is a terrain, projects to an immersed surface in the plane, the boundary of which is a self-intersecting curve. Under what circumstances…
The maximum traveling salesman problem (Max TSP) consists of finding a Hamiltonian cycle with the maximum total weight of the edges in a given complete weighted graph. This problem is APX-hard in the general metric case but admits…
In the Traveling Salesperson Problem with Neighborhoods (TSPN), we are given a collection of geometric regions in some space. The goal is to output a tour of minimum length that visits at least one point in each region. Even in the…
The theoretical models providing mathematical abstractions for several significant optimization problems in machine learning, combinatorial optimization, computer vision and statistical physics have intrinsic similarities. We propose a…
In this paper we refine the construction and related estimates for complete Constant Mean Curvature surfaces in Euclidean three-space developed in Kapouleas (1990) by adopting the more precise and powerful version of the methodology which…
We study the problem of finding a tour of $n$ points in which every edge is long. More precisely, we wish to find a tour that visits every point exactly once, maximizing the length of the shortest edge in the tour. The problem is known as…
We consider the problem of computing the topology and describing the geometry of a parametric curve in $\mathbb{R}^n$. We present an algorithm, PTOPO, that constructs an abstract graph that is isotopic to the curve in the embedding space.…
This paper proposes a method for computing the visible occluding contours of subdivision surfaces. The paper first introduces new theory for contour visibility of smooth surfaces. Necessary and sufficient conditions are introduced for when…
Multidimensional scaling (MDS) is a family of methods that embed a given set of points into a simple, usually flat, domain. The points are assumed to be sampled from some metric space, and the mapping attempts to preserve the distances…
We consider the Travelling Salesman Problem with Neighbourhoods (TSPN) on the Euclidean plane ($\mathbb{R}^2$) and present a Polynomial-Time Approximation Scheme (PTAS) when the neighbourhoods are parallel line segments with lengths between…
For a given spatial graph $\mathcal{G} \subset \mathbb{R}^3$, we would like to find a closed orientable surface $\mathcal{S}$ embedded in $\mathbb{R}^3$ in which $\mathcal{G}$ is cellular embedded. However, for general $\mathcal{G}$ this is…
We resolve in the affirmative conjectures of Repovs and A. Skopenkov (1998), and M. Skopenkov (2003) generalizing the classical Hanani-Tutte theorem to the setting of approximating maps of graphs on 2-dimensional surfaces by embeddings. Our…
We introduce the Polychromatic Traveling Salesman Problem (PCTSP), where the input is an edge weighted graph whose vertices are partitioned into $k$ equal-sized color classes, and the goal is to find a minimum-length Hamiltonian cycle that…
Weighted geometric set-cover problems arise naturally in several geometric and non-geometric settings (e.g. the breakthrough of Bansal-Pruhs (FOCS 2010) reduces a wide class of machine scheduling problems to weighted geometric set-cover).…
The past few years have seen a revived interest in quantum geometrical characterizations of band structures due to the rapid development of topological insulators and semi-metals. Although the metric tensor has been connected to many…
We construct a sequence of compact, oriented, embedded, two-dimensional surfaces of genus one into Euclidean 3-space with prescribed, almost constant, mean curvature of the form $H(X)=1+{A}{|X|^{-\gamma}}$ for $|X|$ large, when $A<0$ and…
A framed surface is a smooth surface in the Euclidean space with a moving frame. By using the moving frame, we can define Bertrand framed surfaces as the same idea as Bertrand framed curves. Then we find the caustics and involutes as…
Although many machine learning algorithms involve learning subspaces with particular characteristics, optimizing a parameter matrix that is constrained to represent a subspace can be challenging. One solution is to use Riemannian…
For many fundamental problems in computational topology, such as unknot recognition and $3$-sphere recognition, the existence of a polynomial-time solution remains unknown. A major algorithmic tool behind some of the best known algorithms…
An arrangement of pseudocircles is a finite set of oriented closed Jordan curves each two of which cross each other in exactly two points. To describe the combinatorial structure of arrangements on closed orientable surfaces, in (Linhart,…