David Letscher

Erin Wolf Chambers and David Letscher. “Persistent Homology Over Directed Acyclic Graphs”. In: CoRR abs/1407.2523 (2014). arXiv: 1407.2523. url: http://arxiv.org/abs/1407.2523.

Erin W. Chambers, Tao Ju, and David Letscher. “Medial Residues of Piecewise Linear Manifolds”. In: Proceedings of the 25th Canadian Conference on Computational Geometry, CCCG 2013, Waterloo, Ontario, Canada, August 8-10, 2013. 2013. url: http://cccg.ca/proceedings/2013/papers/paper%5C_13.pdf.

David Letscher. “On persistent homotopy, knotted complexes and the Alexander module”. In: Innovations in Theoretical Computer Science 2012, Cambridge, MA, USA, January 8-10, 2012. 2012, pp. 428–441. doi: 10.1145/2090236.2090270. url: http://doi.acm.org/10.1145/2090236.2090270.

Lu Liu, Erin W. Chambers, David Letscher, and Tao Ju. “Extended grassfire transform on medial axes of 2D shapes”. In: Computer-Aided Design 43.11 (2011), pp. 1496–1505. doi: 10.1016/j.cad.2011.09.002. url: https://doi.org/10.1016/j.cad.2011.09.002.

Erin W. Chambers, David Letscher, Tao Ju, and Lu Liu. “Isotopic Fr?chet Distance”. In: Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, Toronto, Ontario, Canada, August 10-12, 2011. 2011. url: http://www.cccg.ca/proceedings/2011/papers/paper88.pdf.

L. Liu, Erin W. Chambers, David Letscher, and Tao Ju. “A simple and robust thinning algorithm on cell complexes”. In: Comput. Graph. Forum 29.7 (2010), pp. 2253–2260. doi: 10.1111/j.1467-8659.2010.01814.x. url: https://doi.org/10.1111/j.1467-8659.2010.01814.x.

Michael H. Goldwasser and David Letscher. “A graphics package for the first day and beyond”. In: Proceedings of the 40th SIGCSE Technical Symposium on Computer Science Education, SIGCSE 2009, Chattanooga, TN, USA, March 4-7, 2009. 2009, pp. 206–210. doi: 10.1145/1508865.1508945. url: http://doi.acm.org/10.1145/1508865.1508945.

Erin W. Chambers and David Letscher. “On the Height of a Homotopy”. In: Proceedings of the 21st Annual Canadian Conference on Computational Geometry, Vancouver, British Columbia, Canada, August 17-19, 2009. 2009, pp. 103–106. url: http://cccg.ca/proceedings/2009/cccg09%5C_27.pdf.

Michael H. Goldwasser and David Letscher. “A python graphics package for the first day and beyond”. In: Proceedings of the 13th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, ITiCSE 2008, Madrid, Spain, June 30 - July 2, 2008. 2008, p. 326. doi: 10.1145/1384271.1384369. url: http://doi.acm.org/10.1145/1384271.1384369.

Michael H. Goldwasser and David Letscher. “Teaching an object-oriented CS1 -: with Python”. In: Proceedings of the 13th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, ITiCSE 2008, Madrid, Spain, June 30 - July 2, 2008. 2008, pp. 42–46. doi: 10.1145/1384271.1384285. url: http://doi.acm.org/10.1145/1384271.1384285.

Bryan Clair and David Letscher. “Optimal Strategies for Sports Betting Pools”. In: Operations Research 55.6 (2007), pp. 1163–1177. doi: 10.1287/opre.1070.0448. url: https://doi.org/10.1287/opre.1070.0448.

Michael H. Goldwasser and David Letscher. “Teaching strategies for reinforcing structural recursion with lists”. In: Companion to the 22nd Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2007, October 21-25, 2007, Montreal, Quebec, Canada. 2007, pp. 889–896. doi: 10.1145/1297846.1297940. url: http://doi.acm.org/10.1145/1297846.1297940.

Brandon Dybala, Brian Jennings, and David Letscher. “Detecting filtered cloning in digital images”. In: Proceedings of the 9th workshop on Multimedia & Security, MM&Sec 2007, Dallas, Texas, USA, September 20-21, 2007. 2007, pp. 43–50. doi: 10.1145/1288869.1288877. url: http://doi.acm.org/10.1145/1288869.1288877.

Michael H. Goldwasser and David Letscher. “Teaching object-oriented programming in python”. In: Proceedings of the 12th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, ITiCSE 2007, Dundee, Scotland, UK, June 25-27, 2007. 2007, pp. 365–366. doi: 10.1145/1268784.1268937. url: http://doi.acm.org/10.1145/1268784.1268937.

Michael H. Goldwasser and David Letscher. “Introducing network programming into a CS1 course”. In: Proceedings of the 12th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, ITiCSE 2007, Dundee, Scotland, UK, June 25-27, 2007. 2007, pp. 19–22. doi: 10.1145/1268784.1268793. url: http://doi.acm.org/10.1145/1268784.1268793.

David Letscher. “Vector Weighted Anisotropic Voronoi Diagrams and Delaunay Traingulations”. In: Proceedings of the 19th Annual Canadian Conference on Computational Geometry, CCCG 2007, August 20-22, 2007, Carleton University, Ottawa, Canada. 2007, pp. 165–168. url: http://cccg.ca/proceedings/2007/07b2.pdf.

David Letscher. “Reconstructing Submanifolds of Euclidean Space”. In: Proceedings of the 19th Annual Canadian Conference on Computational Geometry, CCCG 2007, August 20-22, 2007, Carleton University, Ottawa, Canada. 2007, pp. 65–68. url: http://cccg.ca/proceedings/2007/03b1.pdf.

David Letscher and Jason Fritts. “Image Segmentation Using Topological Persistence”. In: Computer Analysis of Images and Patterns, 12th International Conference, CAIP 2007, Vienna, Austria, August 27-29, 2007, Proceedings. 2007, pp. 587–595. doi: 10.1007/978-3-540-74272-2“?73. url: https://doi.org/10.1007/978-3-540-74272-2%5C_73.

Michael H. Goldwasser and David Letscher. “Providing students universal access to a centralized, graphical computing environment”. In: Proceedings of the 10th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, ITiCSE 2005, Caparica, Portugal, June 27-29, 2005. 2005, pp. 79–83. doi: 10.1145/1067445.1067470. url: http://doi.acm.org/10.1145/1067445.1067470.

Herbert Edelsbrunner, David Letscher, and Afra Zomorodian. “Topological Persistence and Simplification”. In: Discrete & Computational Geometry 28.4 (2002), pp. 511–533. doi: 10.1007/s00454-002-2885-2. url: https://doi.org/10.1007/s00454-002-2885-2.

Herbert Edelsbrunner, David Letscher, and Afra Zomorodian. “Topological Persistence and Simplification”. In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA. 2000, pp. 454–463. doi: 10.1109/SFCS.2000.892133. url: https://doi.org/10.1109/SFCS.2000.892133.

Greg Leibon and David Letscher. “Delaunay triangulations and Voronoi diagrams for Riemannian manifolds”. In: Proceedings of the Sixteenth Annual Symposium on Computational Geometry, Clear Water Bay, Hong Kong, China, June 12-14, 2000. 2000, pp. 341–349. doi: 10.1145/336154.336221. url: http://doi.acm.org/10.1145/336154.336221.

Marshall W. Bern, David Eppstein, Pankaj K. Agarwal, Nina Amenta, L. Paul Chew, Tamal K. Dey, David P. Dobkin, Herbert Edelsbrunner, Cindy Grimm, Leonidas J. Guibas, John Harer, Joel Hass, Andrew Hicks, Carroll K. Johnson, Gilad Lerman, David Letscher, Paul E. Plassmann, Eric Sedgwick, Jack Snoeyink, Jeff Weeks, Chee-Keng Yap, and Denis Zorin. “Emerging Challenges in Computational Topology”. In: CoRR cs.CG/9909001 (1999). url: http://arxiv.org/abs/cs.CG/9909001.