Tracing compressed curves in triangulated surfaces
From MaRDI portal
Publication:5919981
DOI10.1007/s00454-013-9515-zzbMath1275.68153OpenAlexW2011930413MaRDI QIDQ5919981
Publication date: 5 August 2013
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-013-9515-z
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
Counting intersections of normal curves ⋮ Experimental Statistics for Mirzakhani’s Theorem ⋮ Finding weakly simple closed quasigeodesics on polyhedral spheres ⋮ Algorithms for contractibility of compressed curves on 3-manifold boundaries ⋮ Simplifying triangulations
Cites Work
- Spiraling and folding: the word view
- A survey of geodesic paths on 3D surfaces
- The action of the mapping class group on curves in surfaces
- Theorie der Normalflächen. Ein Isotopiekriterium für den Kreisknoten
- An optimal-time algorithm for shortest paths on realistic polyhedra
- Visibility and intersection problems in plane geometry
- Geodesics with bounded intersection number on surfaces are sparsely distributed
- Visibility between two edges of a simple polygon
- Algebraic linearity for an automorphism of a surface group
- An almost optimal algorithm for unbounded searching
- Computing minimum length paths of a given homotopy class
- Origins of the analysis of the Euclidean algorithm
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- Optimally cutting a surface into a disk
- Storing the subdivision of a polyhedral surface
- Recognizing string graphs is decidable
- 0-efficient triangulations of 3-manifolds
- On a construction of Burago and Zalgaller
- On the complexity of braids.
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
- Curves von 2-manifolds and isotopies
- Thurston's Work on Surfaces (MN-48)
- The computational complexity of knot and link problems
- Computing the Crosscap Number of a Knot Using Integer Programming and Normal Surfaces
- The Modular Surface and Continued Fractions
- Euclidean shortest paths in the presence of rectilinear barriers
- Processing Compressed Texts: A Tractability Border
- Geometrical Markov coding of geodesics on surfaces of constant negative curvature
- Shortest path solves edge-to-edge visibility in a polygon
- On the geometry and dynamics of diffeomorphisms of surfaces
- Geodesics on modular surfaces and continued fractions
- Combinatorics of Train Tracks. (AM-125)
- Grammar-based codes: a new class of universal lossless source codes
- A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
- SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
- Efficient algorithms for Lempel-Ziv encoding
- The complexity of the normal surface solution space
- An extraordinary origami curve
- The computational complexity of knot genus and spanning area
- Tracing compressed curves in triangulated surfaces
- Recognizing string graphs in NP
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Tracing compressed curves in triangulated surfaces
