The least spanning area of a knot and the optimal bounding chain problem. (English) Zbl 1283.68357
Proceedings of the 27th annual symposium on computational geometry, SoCG 2011, Paris, France, June 13–15, 2011. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-0682-9). 135-144 (2011).
MSC:
| 68U05 | Computer graphics; computational geometry (digital and algorithmic aspects) |
| 91C05 | Measurement theory in the social and behavioral sciences |
| 68Q17 | Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) |
