English
Related papers

Related papers: TSP on manifolds

200 papers

We consider a minimal extension of the language of arithmetic, such that the bounded formulas provably total in a suitably-defined theory \`a la Buss (expressed in this new language) precisely capture polytime random functions. Then, we…

Logic in Computer Science · Computer Science 2023-11-28 Melissa Antonelli , Ugo Dal Lago , Davide Davoli , Isabel Oitavem , Paolo Pistone

This paper presents a high-order accurate numerical quadrature algorithm for evaluating integrals over curved surfaces and regions defined implicitly via a level set of a given function restricted to a hyperrectangle. The domain is divided…

Numerical Analysis · Mathematics 2025-06-17 Zibo Zhao

Sequential Convex Programming (SCP) has recently gained popularity as a tool for trajectory optimization due to its sound theoretical properties and practical performance. Yet, most SCP-based methods for trajectory optimization are…

Optimization and Control · Mathematics 2019-05-21 Riccardo Bonalli , Andrew Bylard , Abhishek Cauligi , Thomas Lew , Marco Pavone

Polynomial splines are ubiquitous in the fields of computer aided geometric design and computational analysis. Splines on T-meshes, especially, have the potential to be incredibly versatile since local mesh adaptivity enables efficient…

Algebraic Geometry · Mathematics 2019-03-15 Deepesh Toshniwal , Bernard Mourrain , Thomas Hughes

We study the problem of construction of explicit isometric embeddings of (pseudo)-Riemannian manifolds. We discuss the method which is based in the idea that the exterior symmetry of the embedded surface and the interior symmetry of the…

General Relativity and Quantum Cosmology · Physics 2020-12-17 A. A. Sheykin , M. V. Markov , Ya. A. Fedulov , S. A. Paston

This paper further develops the Method of Matched Sections (MMS), a robust numerical framework for the solution of boundary value problems governed by partial differential equations. It demonstrates its unique applicability to the…

Graphics · Computer Science 2026-05-05 Igor Orynyak , Kirill Danylenko , Danylo Tavrov

Let S be an immersed horizontal surface in a 3-dimensional graph manifold. We show that the fundamental group of the surface S is quadratically distorted whenever the surface is virtually embedded (i.e., separable) and is exponentially…

Group Theory · Mathematics 2019-02-13 G. Christopher Hruska , Hoang Thanh Nguyen

For real projective spaces, (a) the Euclidean immersion dimension, (b) the existence of axial maps, and (c) the topological complexity are known to be three facets of the same problem. But when it comes to embedding dimension, the classical…

Algebraic Topology · Mathematics 2014-10-01 Jesus Gonzalez , Peter Landweber

Bidimensionality theory is a powerful framework for the development of metaalgorithmic techniques. It was introduced by Demaine et al. as a tool to obtain sub-exponential time parameterized algorithms for problems on H-minor free graphs.…

Data Structures and Algorithms · Computer Science 2015-03-17 Fedor V. Fomin , Daniel Lokshtanov , Venkatesh Raman , Saket Saurabh

We study the properties of $\text{CAT}(\kappa)$ surfaces: length metric spaces homeomorphic to a surface having curvature bounded above in the sense of satisfying the $\text{CAT}(\kappa)$ condition locally. The main facts about…

Metric Geometry · Mathematics 2025-11-06 Saajid Chowdhury , Hechen Hu , Matthew Romney , Adam Tsou

We prove that finite area isolated singularities of surfaces with constant positive curvature in R^3 are removable singularities, branch points or immersed conical singularities. We describe the space of immersed conical singularities of…

Differential Geometry · Mathematics 2010-07-16 Jose A. Galvez , Laurent Hauswirth , Pablo Mira

We present a space and time efficient practical parallel algorithm for approximating the diameter of massive weighted undirected graphs on distributed platforms supporting a MapReduce-like abstraction. The core of the algorithm is a…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-11-10 Matteo Ceccarello , Andrea Pietracaprina , Geppino Pucci , Eli Upfal

Consider a graph drawn on a surface (for example, the plane minus a finite set of obstacle points), possibly with crossings. We provide an algorithm to decide whether such a drawing can be untangled, namely, if one can slide the vertices…

Computational Geometry · Computer Science 2025-07-18 Éric Colin de Verdière , Vincent Despré , Loïc Dubois

Turaev Viro invariants are amongst the most powerful tools to distinguish 3-manifolds: They are implemented in mathematical software, and allow practical computations. The invariants can be computed purely combinatorially by enumerating…

Computational Geometry · Computer Science 2018-10-24 Clément Maria , Jonathan Spreer

The geometry of a two-dimensional surface in a curved space can be most easily visualized by using an isometric embedding in flat three-dimensional space. Here we present a new method for embedding surfaces with spherical topology in flat…

General Relativity and Quantum Cosmology · Physics 2009-11-07 Mihai Bondarescu , Miguel Alcubierre , Edward Seidel

Normal surface theory is a central tool in algorithmic three-dimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important algorithms. However, it is not well understood how the number…

Geometric Topology · Mathematics 2010-06-18 Benjamin A. Burton

Tightness is a generalisation of the notion of convexity: a space is tight if and only if it is "as convex as possible", given its topological constraints. For a simplicial complex, deciding tightness has a straightforward exponential time…

Computational Geometry · Computer Science 2018-10-24 Bhaskar Bagchi , Benjamin A. Burton , Basudeb Datta , Nitin Singh , Jonathan Spreer

Let $M$ be a 3-manifold. Every knotted (embedded) surface in $M \times \R$ can be moved via an ambient isotopy in such a way that its projection into $M$ is a generic surface. A surface is generic if every point on it is either a regular,…

Geometric Topology · Mathematics 2016-05-30 Doron Ben Hadar

Edge-preserving smoothing (EPS) can be formulated as minimizing an objective function that consists of data and prior terms. This global EPS approach shows better smoothing performance than a local one that typically has a form of weighted…

Computer Vision and Pattern Recognition · Computer Science 2016-04-27 Youngjung Kim , Dongbo Min , Bumsub Ham , Kwanghoon Sohn

A regularization procedure developed in [1] for the integral curvature invariants on manifolds with conical singularities is generalized to the case of squashed cones. In general, the squashed conical singularities do not have rotational…

High Energy Physics - Theory · Physics 2015-06-16 Dmitri V. Fursaev , Alexander Patrushev , Sergey N. Solodukhin