English
Related papers

Related papers: Analysis of a method to parameterize planar curves…

200 papers

The {\em topological symmetry group} of an embedding $\Gamma$ of an abstract graph $\gamma$ in $S^3$ is the group of automorphisms of $\gamma$ which can be realized by homeomorphisms of the pair $(S^3, \Gamma)$. These groups are motivated…

Geometric Topology · Mathematics 2025-10-07 Blake Mellor , Robin Wilson

Parameterized complexity enables the practical solution of generally intractable NP-hard problems when certain parameters are small, making it particularly useful in real-world applications. The study of string problems in this framework…

Quantum Physics · Physics 2025-10-20 Josh Cudby , Sergii Strelchuk

We derive a local criterion for a plane near-triangulated graph to be perfect. It is shown that a plane near-triangulated graph is perfect if and only if it does not contain either a vertex, an edge or a triangle, the neighbourhood of which…

Discrete Mathematics · Computer Science 2020-07-08 Sameera M. Salam , Jasine Babu , K. Murali Krishnan

We prove that any weakly acausal curve $\Gamma$ in the boundary of Anti-de Sitter (2+1)-space is the asymptotic boundary of two spacelike $K$-surfaces, one of which is past-convex and the other future-convex, for every $K\in(-\infty,-1)$.…

Differential Geometry · Mathematics 2019-04-24 Francesco Bonsante , Andrea Seppi

We provide a rigorous justification of the classical linearization approach in plasticity. By taking the small-deformations limit, we prove via \Gamma-convergence for rate-independent processes that energetic solutions of the quasi-static…

Analysis of PDEs · Mathematics 2011-11-07 Alexander Mielke , Ulisse Stefanelli

Kernelization is an important tool in parameterized algorithmics. Given an input instance accompanied by a parameter, the goal is to compute in polynomial time an equivalent instance of the same problem such that the size of the reduced…

Computational Complexity · Computer Science 2018-10-23 Till Fluschnik , George B. Mertzios , André Nichterlein

Orienting the edges of an undirected graph such that the resulting digraph satisfies some given constraints is a classical problem in graph theory, with multiple algorithmic applications. In particular, an $st$-orientation orients each edge…

Data Structures and Algorithms · Computer Science 2023-07-11 Carla Binucci , Giuseppe Liotta , Fabrizio Montecchiani , Giacomo Ortali , Tommaso Piselli

We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propagate completely have natural parameters which make them…

Artificial Intelligence · Computer Science 2009-03-04 Christian Bessiere , Emmanuel Hebrard , Brahim Hnich , Zeynep Kiziltan , Toby Walsh

A \emph{queue layout} of a graph consists of a \emph{linear order} of its vertices and a partition of its edges into \emph{queues}, so that no two independent edges of the same queue are nested. The \emph{queue number} of a graph is the…

Data Structures and Algorithms · Computer Science 2019-08-12 Michael A. Bekos , Henry Förster , Martin Gronemann , Tamara Mchedlidze , Fabrizio Montecchiani , Chrysanthi Raftopoulou , Torsten Ueckerdt

The aim of this paper is to develop a new axiomatization of planar geometry by reinterpreting the original axioms of Euclid. The basic concept is still that of a line segment but its equivalent notion of betweenness is viewed as a…

Metric Geometry · Mathematics 2015-06-12 Jerzy Dydak

We study quotients of mapping class groups (\Gamma_{g,1}) of oriented surfaces with one boundary component by terms of their Johnson filtrations, and we show that the homology of these quotients with suitable systems of twisted coefficients…

Algebraic Topology · Mathematics 2017-04-06 Tomáš Zeman

Conformal surface parameterization is useful in graphics, imaging and visualization, with applications to texture mapping, atlas construction, registration, remeshing and so on. With the increasing capability in scanning and storing data,…

Computational Geometry · Computer Science 2020-07-06 Gary P. T. Choi , Yusan Leung-Liu , Xianfeng Gu , Lok Ming Lui

Surface parameterization plays an essential role in numerous computer graphics and geometry processing applications. Traditional parameterization approaches are designed for high-quality meshes laboriously created by specialized 3D…

Computer Vision and Pattern Recognition · Computer Science 2024-10-29 Qijian Zhang , Junhui Hou , Wenping Wang , Ying He

A classical problem in constant mean curvature hypersurface theory is, for given $H\geq 0$, to determine whether a compact submanifold $\Gamma^{n-1}$ of codimension two in Euclidean space $\R_+^{n+1}$, having a single valued orthogonal…

Differential Geometry · Mathematics 2010-05-17 Marcos Dajczer , Jaime Ripoll

We show that, given an absolutely continuous horizontal curve $\gamma$ in the Heisenberg group, there is a $C^1$ horizontal curve $\Gamma$ such that $\Gamma=\gamma$ and $\Gamma'=\gamma'$ outside a set of small measure. Conversely, we…

Metric Geometry · Mathematics 2015-11-26 Gareth Speight

We introduce a new approach for establishing fixed-parameter tractability of problems parameterized above tight lower bounds. To illustrate the approach we consider three problems of this type of unknown complexity that were introduced by…

Data Structures and Algorithms · Computer Science 2009-08-18 G. Gutin , E. J. Kim , S. Szeider , A. Yeo

A $configuration$ of a linkage $\Gamma$ is a possible positioning of $\Gamma$ in $\mathbb{R}^d$ and the collection of all such forms the configuration space $\mathcal{C}(\Gamma)$ of $\Gamma$. We here introduce the notion of the $symmetric…

Algebraic Topology · Mathematics 2022-07-19 David Blanc , Nir Shvalb

Let $\Gamma$ be a smooth, closed, oriented, $(n-1)$-dimensional submanifold of $\mathbb{R}^{n+1}$. We show that there exist arbitrarily small perturbations $\Gamma'$ of $\Gamma$ with the property that minimizing integral $n$-currents with…

Differential Geometry · Mathematics 2024-05-27 Otis Chodosh , Christos Mantoulidis , Felix Schulze

We show that a metric Jordan curve $\Gamma$ is \emph{bounded turning} if and only if there exists a \emph{weak-quasisymmetric} homeomorphism $\phi\colon \mathsf{S}^1 \to \Gamma$.

Complex Variables · Mathematics 2011-11-01 Daniel Meyer

Consider a sequence of closed, orientable surfaces of fixed genus $g$ in a Riemannian manifold $M$ with uniform upper bounds on mean curvature and area. We show that on passing to a subsequence and choosing appropriate parametrisations, the…

Differential Geometry · Mathematics 2008-11-13 Siddartha Gadgil , Harish Seshadri