Tracing compressed curves in triangulated surfaces
From MaRDI portal
Publication:5919981
Recommendations
- Tracing compressed curves in triangulated surfaces
- Tracing curvature paths on trimmed multipatch surfaces
- An efficient method for tracing planar implicit curves
- Compressed piecewise-circular approximations of 3D curves
- scientific article; zbMATH DE number 917634
- Triangulation des surfaces implicites
- Triangulation of trimmed surfaces in parametric space
- Compressing totally geodesic surfaces
Cites work
- scientific article; zbMATH DE number 412172 (Why is no real title available?)
- scientific article; zbMATH DE number 5595151 (Why is no real title available?)
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 3630641 (Why is no real title available?)
- scientific article; zbMATH DE number 1223734 (Why is no real title available?)
- scientific article; zbMATH DE number 1304322 (Why is no real title available?)
- scientific article; zbMATH DE number 1045405 (Why is no real title available?)
- scientific article; zbMATH DE number 1948486 (Why is no real title available?)
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- scientific article; zbMATH DE number 1857881 (Why is no real title available?)
- scientific article; zbMATH DE number 2089992 (Why is no real title available?)
- scientific article; zbMATH DE number 857402 (Why is no real title available?)
- scientific article; zbMATH DE number 1408356 (Why is no real title available?)
- scientific article; zbMATH DE number 1424303 (Why is no real title available?)
- scientific article; zbMATH DE number 3213117 (Why is no real title available?)
- scientific article; zbMATH DE number 3102009 (Why is no real title available?)
- 0-efficient triangulations of 3-manifolds
- A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
- A survey of geodesic paths on 3D surfaces
- Algebraic linearity for an automorphism of a surface group
- An almost optimal algorithm for unbounded searching
- An extraordinary origami curve
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
- An optimal-time algorithm for shortest paths on realistic polyhedra
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- Combinatorics of Train Tracks. (AM-125)
- Computational topology. An introduction
- Computing minimum length paths of a given homotopy class
- Computing the crosscap number of a knot using integer programming and normal surfaces
- Curves von 2-manifolds and isotopies
- Efficient algorithms for Lempel-Ziv encoding
- Euclidean shortest paths in the presence of rectilinear barriers
- Geodesics on modular surfaces and continued fractions
- Geodesics with bounded intersection number on surfaces are sparsely distributed
- Geometric folding algorithms. Linkages, origami, polyhedra
- Geometrical Markov coding of geodesics on surfaces of constant negative curvature
- Grammar-based codes: a new class of universal lossless source codes
- Graphs on surfaces
- On a construction of Burago and Zalgaller
- On the complexity of braids.
- On the geometry and dynamics of diffeomorphisms of surfaces
- Optimally cutting a surface into a disk
- Ordering braids.
- Origins of the analysis of the Euclidean algorithm
- Processing Compressed Texts: A Tractability Border
- Recognizing string graphs in NP
- Recognizing string graphs is decidable
- SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
- Shortest path solves edge-to-edge visibility in a polygon
- Sphere recognition lies in NP
- Spiraling and folding: the word view
- Storing the subdivision of a polyhedral surface
- The Modular Surface and Continued Fractions
- The action of the mapping class group on curves in surfaces
- The complexity of the normal surface solution space
- The computational complexity of knot and link problems
- The computational complexity of knot genus and spanning area
- Theorie der Normalflächen. Ein Isotopiekriterium für den Kreisknoten
- Thurston's work on surfaces. Transl. from the French by Djun Kim and Dan Margalit
- Tracing compressed curves in triangulated surfaces
- Visibility and intersection problems in plane geometry
- Visibility between two edges of a simple polygon
Cited in
(12)- The complexity of iterated reversible computation
- Finding weakly simple closed quasigeodesics on polyhedral spheres
- Robust Polylines Tracing for N-Symmetry Direction Field on Triangulated Surfaces
- Tracing compressed curves in triangulated surfaces
- Algorithms for contractibility of compressed curves on 3-manifold boundaries
- Experimental Statistics for Mirzakhani’s Theorem
- Simplifying triangulations
- Counting intersections of normal curves
- Recognition of Seifert fibered spaces with boundary is in NP
- scientific article; zbMATH DE number 2089992 (Why is no real title available?)
- Squigraphs for Fine and Compact Modeling of 3-D Shapes
- Core curves of triangulated solid tori
This page was built for publication: Tracing compressed curves in triangulated surfaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5919981)
