Matching is as easy as matrix inversion
Combinatorica
The steiner problem with edge lengths 1 and 2,
Information Processing Letters
Computational complexity of combinatorial surfaces
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Piecewise surface flattening for non-distorted texture mapping
Proceedings of the 18th annual conference on Computer graphics and interactive techniques
Computing sums of radicals in polynomial time
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
A compendium of parameterized complexity results
ACM SIGACT News
SIAM Journal on Computing
Parametrization and smooth approximation of surface triangulations
Computer Aided Geometric Design
Handbook of discrete and computational geometry
Transforming curves on surfaces
Journal of Computer and System Sciences - Special issue on the 36th IEEE symposium on the foundations of computer science
Efficient Algorithms for Shortest Paths in Sparse Networks
Journal of the ACM (JACM)
Seamless texture mapping of subdivision surfaces by model pelting and texture blending
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Computing a canonical polygonal schema of an orientable triangulated surface
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Randomness efficient identity testing of multivariate polynomials
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Conformal Surface Parameterization for Texture Mapping
IEEE Transactions on Visualization and Computer Graphics
Parameterized Complexity
Interactive geometry remeshing
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Seamster: inconspicuous low-distortion texture seam layout
Proceedings of the conference on Visualization '02
Dynamic generators of topologically embedded graphs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
An optimal algorithm for the minimum edge cardinality cut surface problem
Proceedings of the nineteenth annual symposium on Computational geometry
Graph based topological analysis of tessellated surfaces
SM '03 Proceedings of the eighth ACM symposium on Solid modeling and applications
Domain decomposition for multiresolution analysis
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Global conformal surface parameterization
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Graphical Models - Special issue on SMI 2002
Transforming 3D mesh surfaces into images by parameterization
Integrated image and graphics technologies
Removing excess topology from isosurfaces
ACM Transactions on Graphics (TOG)
Fair morse functions for extracting the topological structure of a surface mesh
ACM SIGGRAPH 2004 Papers
Feature-based surface parameterization and texture mapping
ACM Transactions on Graphics (TOG)
Centroidal Voronoi diagrams for isotropic surface remeshing
Graphical Models - Special issue on SMI 2003
Harmonic functions for quadrilateral remeshing of arbitrary manifolds
Computer Aided Geometric Design - Special issue: Geometry processing
Conformal virtual colon flattening
Proceedings of the 2006 ACM symposium on Solid and physical modeling
Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time
Proceedings of the twenty-second annual symposium on Computational geometry
Planar parameterization for closed 2-manifold genus-1 meshes
SM '04 Proceedings of the ninth ACM symposium on Solid modeling and applications
Families of cut-graphs for bordered meshes with arbitrary genus
Graphical Models
Approximate convex decomposition of polyhedra
Proceedings of the 2007 ACM symposium on Solid and physical modeling
Computing crossing number in linear time
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Graph and map isomorphism and all polyhedral embeddings in linear time
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Computational Geometry: Theory and Applications
Approximate convex decomposition of polyhedra and its applications
Computer Aided Geometric Design
Algorithms for finding an induced cycle in planar graphs and bounded genus graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Harmonic functions for quadrilateral remeshing of arbitrary manifolds
Computer Aided Geometric Design - Special issue: Geometry processing
GMP'08 Proceedings of the 5th international conference on Advances in geometric modeling and processing
Origami embedding of piecewise-linear two-manifolds
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Finding shortest non-separating and non-contractible cycles for topologically embedded graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Planar drawings of higher-genus graphs
GD'09 Proceedings of the 17th international conference on Graph Drawing
Topological detection on wormholes in wireless ad hoc and sensor networks
IEEE/ACM Transactions on Networking (TON)
Geometry curves: A compact representation for 3D shapes
Graphical Models
| Hi-index | 0.00 |
We consider the problem of cutting a set of edges on a polyhedral manifold surface, possibly with boundary, to obtain a single topological disk, minimizing either the total number of cut edges or their total length. We show that this problem is NP-hard, even for manifolds without boundary and for punctured spheres. We also describe an algorithm with running time n O(g+k), where n is the combinatorial complexity, g is the genus, and k is the number of boundary components of the input surface. Finally, we describe a greedy algorithm that outputs a O(log2 g)-approximation of the minimum cut graph in O(g 2 n log n) time.