English
Related papers

Related papers: An Implementation of the Bestvina-Handel Algorithm…

200 papers

We consider two systems of curves $(\alpha_1,...,\alpha_m)$ and $(\beta_1,...,\beta_n)$ drawn on a compact two-dimensional surface $M$ with boundary. Each $\alpha_i$ and each $\beta_j$ is either an arc meeting the boundary of $M$ at its two…

Combinatorics · Mathematics 2014-03-10 Jiří Matoušek , Eric Sedgwick , Martin Tancer , Uli Wagner

In this work we develop a new criterion for the existence of topological horseshoes for surface homeomorphisms in the isotopy class of the identity. Based on our previous work on forcing theory, this new criterion is purely topological and…

Dynamical Systems · Mathematics 2021-02-18 Patrice Le Calvez , Fabio Armando Tal

In this paper, we present a general approach to obtain numerical schemes with good mesh properties for problems with moving boundaries, that is for evolving submanifolds with boundaries. This includes moving domains and surfaces with…

Numerical Analysis · Mathematics 2016-09-13 Charles M. Elliott , Hans Fritz

For an $\alpha$-expansive homeomorphism of a compact space we give an elementary proof of the following well-known result in topological dynamics: A sufficient condition for the homeomorphism to have the shadowing property is that it has…

Dynamical Systems · Mathematics 2019-04-30 Mauricio Achigar

We present a novel shape-approximating anisotropic re-meshing algorithm as a geometric generalization of the adaptive moving mesh method. Conventional moving mesh methods reduce the interpolation error of a mesh that discretizes a given…

Computational Geometry · Computer Science 2023-06-21 Nicolas Nebel , Albert Chern

The fine curve graph was introduced as a geometric tool to study homeomorphisms of surfaces. In this paper we study the Gromov boundary of this space and the local topology near points associated with certain foliations and laminations. We…

Geometric Topology · Mathematics 2024-10-28 Jonathan Bowden , Sebastian Hensel , Richard Webb

The ARRIVAL problem is to decide the fate of a train moving along the edges of a directed graph, according to a simple (deterministic) pseudorandom walk. The problem is in $NP \cap coNP$ but not known to be in $P$. The currently best…

Data Structures and Algorithms · Computer Science 2021-04-12 Bernd Gärtner , Sebastian Haslebacher , Hung P. Hoang

Following the success of machine vision systems for on-line automated quality control and inspection processes, an object recognition solution is presented in this work for two different specific applications, i.e., the detection of quality…

Computer Vision and Pattern Recognition · Computer Science 2022-07-01 Kai Yao , Alberto Ortiz , Francisco Bonnin-Pascual

Guided image filter is a well-known local filter in image processing. However, the presence of halo artifacts is a common issue associated with this type of filter. This paper proposes an algorithm that utilizes gradient information to…

Computer Vision and Pattern Recognition · Computer Science 2023-07-11 Bo Wang , Yihong Wang , Xiubao Sui , Yuan Liu , Qian Chen

We give a proof of the Neilsen-Thurston classification theorem of a homeomorphism f of a standard surface of finite type as either periodic, pseudo-Anosov, or reducible. In the periodic case, we show that there exists an integer n>0 such…

Geometric Topology · Mathematics 2018-11-29 John Cantwell

Surface parametrization is a crucial part in various fields, having applications in computer graphic, medical imaging, scientific computing and computational engineering. The majority of surface parametrization approaches are performed on…

Computational Geometry · Computer Science 2025-04-09 Ka Ho Lai , Lok Ming Lui

Neural implicit functions have emerged as a powerful representation for surfaces in 3D. Such a function can encode a high quality surface with intricate details into the parameters of a deep neural network. However, optimizing for the…

Computer Vision and Pattern Recognition · Computer Science 2021-04-13 Wang Yifan , Shihao Wu , Cengiz Oztireli , Olga Sorkine-Hornung

Junctions play an important role in the characterization of local geometric structures in images, the detection of which is a longstanding and challenging task. Existing junction detectors usually focus on identifying the junction locations…

Computer Vision and Pattern Recognition · Computer Science 2017-11-06 Nan Xue , Gui-Song Xia , Xiang Bai , Liangpei Zhang , Weiming Shen

For Bezier curves, subdivision algorithms create control polygons as piecewise linear (PL) approximations that converge in terms of Hausdorff distance. We prove that the exterior angles of control polygons under subdivision converge to 0 at…

Geometric Topology · Mathematics 2013-10-01 J. Li , T. J. Peters , J. A. Roulier

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

The vertical handover decision is considered an NP-Hard problem. For that reason, a large variety of vertical handoff algorithms (VHA) have been proposed to help the user to select dynamically the best access network in terms of quality of…

Networking and Internet Architecture · Computer Science 2012-06-11 Mohamed Lahby , Leghris Cherkaoui , Abdellah Adib

Although deep models have greatly improved the accuracy and robustness of image segmentation, obtaining segmentation results with highly accurate boundaries and fine structures is still a challenging problem. In this paper, we propose a…

Computer Vision and Pattern Recognition · Computer Science 2021-05-12 Xuebin Qin , Deng-Ping Fan , Chenyang Huang , Cyril Diagne , Zichen Zhang , Adrià Cabeza Sant'Anna , Albert Suàrez , Martin Jagersand , Ling Shao

The task of hyper-parameter optimization (HPO) is burdened with heavy computational costs due to the intractability of optimizing both a model's weights and its hyper-parameters simultaneously. In this work, we introduce a new class of HPO…

Machine Learning · Computer Science 2021-12-14 Mathieu Tuli , Mahdi S. Hosseini , Konstantinos N. Plataniotis

We study the convex hulls of trajectories of polynomial dynamical systems. Such trajectories include real algebraic curves. The boundaries of the resulting convex bodies are stratified into families of faces. We present numerical algorithms…

Dynamical Systems · Mathematics 2024-01-26 Daniel Ciripoi , Nidhi Kaihnsa , Andreas Löhne , Bernd Sturmfels

We introduce an operation that measures the self intersections of paths on a surface. As applications, we give a criterion of the realizability of a generalized Dehn twist, and derive a geometric constraint on the image of the Johnson…

Geometric Topology · Mathematics 2013-02-28 Nariya Kawazumi , Yusuke Kuno