[9] Tony F. Chan and Selim Esedo¯ glu. Aspects of total variation regularized L 1 function approximation. SIAM Journal on Applied Mathematics , 65(5):1817–1837, 2005. [10] Chao Chen and Daniel Freedman. Hardness results for homology localization. In SODA ’10: Proc. 21st Ann. ACM-SIAM Sympos. Discrete Algorithms , pages 1594– 1604, 2010. [11] Siu-Wing Cheng, Tamal Dey, and Jonathan Shewchuk. Delaunay Mesh Generation . CRC Press, 2012. [12] Vin de Silva and Robert Ghrist. Coordinate-free coverage in sensor networks with controlled boundaries via homology. International Journal of Robotics Research , 25(12):1205–1222, 2006. [13] Vin de Silva and Robert Ghrist. Coverage in sensor networks via persistent homol- ogy. Algebraic and Geometric Topology , 7:339–358, 2007. [14] Tamal K. Dey, Anil N. Hirani, and Bala Krishnamoorthy. Optimal homologous cycles, total unimodularity, and linear programming. In STOC ’10: Proc. 42nd Ann. Sympos. Theo. Comput. , pages 221–230, 2010. [15] Tamal K. Dey, Anil N. Hirani, Bala Krishnamoorthy, and Gavin W. Smith. Edge contractions and simplicial homology. 2013. arxiv:1304.0664. [16] Nathan M. Dunfield and Anil N. Hirani. The least spanning area of a knot and the optimal bounding chain problem. In Prooceedings of the 27th ACM Annual Symposium on Computational Geometry , SoCG ’11, pages 135–144, 2011. [17] Herbert Edelsbrunner. Geometry and Topology for Mesh Generation . Cambridge 119