Optimally cutting a surface into a disk

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2002, Pages 244-253

  Erickson, Jeff ^a   Har Peled, Sariel ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Approximation; Computational topology; Cut graph; NP hardness; Polygonal schema; Polyhedral 2 manifold

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; THEOREM PROVING;

COMPUTATIONAL TOPOLOGY;

COMPUTATIONAL GEOMETRY;

EID: 0036368951     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/513400.513430     Document Type: Conference Paper

References (34)

1. Auditory Morse analysis of triangulated manifolds
2. Piecewise surface flattening for non-distorted texture mapping
3. The Steiner problem with edge lengths 1 and 2
4. Constructions for cubic graphs with large girth
5. Computing sums of radicals in polynomial time
6. Randomness-optimal unique element isolation with applications to perfect matching and related problems
7. Computational topology
8. Transforming curves on surfaces
9. A new technique to compute polygonal schema for 2-manifolds with application to null-homotopy detection
10. A note on two problems in connexion with graphs
11. Parameterized complexity
12. The Steiner problem in graphs
13. Seventeen proofs of Euler's formula: V - E + F = 2
14. Parametrization and smooth approximation of surface triangulations
15. Conway's ZIP proof
16. The complexity of computing Steiner minimal trees
17. The rectilinear Steiner tree problem is NP-complete
18. Conformal surface parameterization for texture mapping
19. A compendium of parameterized compplexity results
20. On Steiner's problem with rectilinear distance
21. Efficient algorithms for shortest paths in sparse networks
22. Randomness efficient identity testing of multivariate polynomials
23. A fast algorithm for Steiner trees
24. Computing a canonical polygonal schema of an orientable triangulated surface
25. Mathing is as easy as matrix inversion
26. Seamless texture mapping of subdivision surfaces by model pelting and texture blending
27. Surface parameterization for meshing by triangulation flattening
28. Classical topology and combinatorial group theory, 2nd edition
29. An approximate solution for the network Steiner tree problem
30. Computational topology
31. Computational complexity of combinatorial surfaces