Splitting (complicated) surfaces is hard
From MaRDI portal
Publication:934027
DOI10.1016/j.comgeo.2007.10.010zbMath1152.65026OpenAlexW2199785256MaRDI QIDQ934027
Francis Lazarus, Éric Colin de Verdière, Kim Whittlesey, Jeff Erickson, Erin Wolf Chambers
Publication date: 29 July 2008
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2007.10.010
cycleloophomotopyorientable surfacecomputational topologycombinatorial surfacescurve on surfacesplitting curvesurface splitting
Geometric structures on manifolds of high or arbitrary dimension (57N16) Computer-aided design (modeling of curves and surfaces) (65D17)
Related Items (12)
Minimum Cuts in Surface Graphs ⋮ Irreducible triangulations of surfaces with boundary ⋮ Computing the shortest essential cycle ⋮ Multicuts in planar and bounded-genus graphs with bounded number of terminals ⋮ Non total-unimodularity neutralized simplicial complexes ⋮ Counting and sampling minimum cuts in genus \(g\) graphs ⋮ Topologically trivial closed walks in directed surface graphs ⋮ A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs With a Fixed Number of Terminals ⋮ Unnamed Item ⋮ Computing intersection numbers and bases of cohomology groups for triangulated closed three-dimensional manifolds ⋮ Unnamed Item ⋮ Discrete systolic inequalities and decompositions of triangulated surfaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimally cutting a surface into a disk
- Optimal system of loops on an orientable surface
- The Discrete Geodesic Problem
- Tightening non-simple paths and cycles on surfaces
- Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
- Finding the k Shortest Paths
- Topology for Computing
- Hamilton Paths in Grid Graphs
- SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
- Computing a canonical polygonal schema of an orientable triangulated surface
- Algorithms – ESA 2005
- Graph Drawing
- Many distances in planar graphs
This page was built for publication: Splitting (complicated) surfaces is hard
