Erin Chambers' Publications

Distances Between Immersed Graphs: Metric Properties Accepted to La Mathematica, 2022. With Maike Buchin, Pan Fan, Brittany Fasy, Ellen Gasparovic, Elizabeth Munch, and Carola Wenk.

Aggregating Community Maps Accepted to SIGSPATIAL, 2022. With Moon Duchin, Ranthony Edmonds, Parker Edwards, JN Matthews, Anthony Pizzimenti, Chanel Rickardson, Parker Rule, and Ari Stern.

Minimum Cuts in Surface Graphs Accepted to SIAM Journal on Computing, 2022. With Jeff Erickson, Kyle Fox, and Amir Nayyeri

Perceptually-grounded quantification of 2D shape complexity Appeared in Computer Graphics International (CGI), 2022, and published in The Visual Computer volume 38, pages 3351–3363 (2022). With Dena Bazazian, Cindy Grimm, Bonnie Magland, and Kathryn Leonard. Conference presentation recording

Topological Simplification of Nested Shapes Computer Graphics Forum (Proc. SGP 2022), 41(5). With Dan Zeng, David Letscher, and Tao Ju.

Reeb Graph Metrics from the Ground Up Preprint, 2021. With Brian Bollen, Joshua A. Levine, and Elizabeth Munch

Realizable piecewise linear paths of persistence diagrams with Reeb graphs Preprint, 2021. With Rehab Alharbi and Elizabeth Munch

On the complexity of computing bottleneck and lexicographic optimal cycles in a homology class In the Symposium on Computational Geometry (SoCG), 2022. With Salman Parsa and Hannah Schreiber

A Cautionary Tale: Burning the Medial Axis Is Unstable In the Symposium on Computational Geometry (SoCG) Multimedia Exposition, 2022. With Christopher Fillmore, Elizabeth Stephenson, and Mathijs Wintraecken

TopoRoot: A method for computing hierarchy and fine-grained traits of maize roots from X-ray CT images In Plant Methods, Volume 17, Article number: 127 (2021). With Dan Zeng, Mao Li, Ni Jiang, Yiwen Ju, Hannah Schreiber, Erin Chambers, David Letscher, Tao Ju, and Christopher N. Topp

Covering a Curve with Subtrajectories Preprint, 2021. Preliminary abstract in EuroCG 2021. With Hugo A. Akitaya, Frederik Brüning, and Anne Driemel

Constructing monotone homotopies and sweepouts In Journal of Differential Geometry 119(3): 383-401 (November 2021). With Gregory R. Chambers, Arnaud de Mesmay, Tim Ophelders, and Regina Rotman

Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries In SoCG 2021. With Francis Lazarus, Arnaud de Mesmay, and Salman Parsa

A family of metrics from the truncated smoothing of Reeb graphs In SoCG 2021. With Elizabeth Munch and Tim Ophelders

Comparing Embedded Graphs Using Average Branching Distance Accepted to Involve, a Journal of Mathematics, 2022. With Levent Batakci, Abigail Branson, Bryan Castillo, Candace Todd, and Elizabeth Munch

How to morph graphs on the torus In SODA 2021. With Jeff Erickson, Patrick Lin, and Salman Parsa

To cut or to fill: a global optimization approach to topological simplification Project page ACM Transactions on Graphics (Proc. ACM Siggraph Asia 2020), 39(6): No. 201 With Dan Zeng, David Letscher, and Tao Ju. Conference presentation recording

Low-stretch spanning trees of graphs with bounded width In SWAT 2020. With Glencora Borradaile, David Eppstein, William Maxwell, and Amir Nayyeri

Homotopy height, grid-major height and graph-drawing height In Symposium on Graph Drawing and Network Visualization, 2019 With Therese Biedl, David Eppstein, Arnaud De Mesmay, and Tim Ophelders

University of Illinois Department of Computer Science Culture Survey Technical report, 2019 With Tanya Crenshaw, Cinda Heeren, Heather Metcalf, and Aspen Russell.

Some Heuristics for the Homological Simplification Problem In CCCG 2018 With Tao Ju, David Letscher, Mao Li, Chris Topp, and Yajie Yan

Map-Matching Using Shortest Paths In ACM Transactions on Spatial Algorithms and Systems (TSAS), 2020. Preliminary version in Workshop on Interactive and Spatial Computing, 2018 With Brittany Fasy, Yusu Wang, and Carola Wenk.

Diversity Across a Decade: A Case Study on Undergraduate Computing Culture In SIGCSE 2018 With Tanya Crenshaw, Cinda Heeren, and Heather Metcalf.

On the complexity of optimal homotopies In SODA 2018 With Arnaud de Mesmay and Tim Ophelders

Topological Persistence Over Directed Acyclic Graphs To appear in Research in Coputational Topology, Erin Chambers, Brittany Fasy, and Lori Ziegelmeier (eds), published by Springer. With David Letscher.

Exploring 2d Shape Complexity To appear in Research in Shape Analysis Volume 2, Gençtav et al (eds), published by Springer. With Tegan Emerson, Cindy Grimm, and Kathryn Leonard.

Medial Fragments for Segmentation of Articulating Objects in Images To appear in Research in Shape Analysis Volume 2, Gençtav et al (eds), published by Springer. With Ellen Gasparovic and Kathryn Leonard.

Computing optimal homotopies over a spiked plane with polygonal boundary In ESA 2017 With Ben Burton, Marc van Kreveld, Wouter Meulemans, Tim Ophelders, and Bettina Speckmann

Frechet Isotopies to Monotone Curves In EuroCG 2017 With Kevin Buchin, Tim Ophelders, and Bettina Speckmann

Ten Years toward Equity: Preliminary Results from a Follow-Up Case Study of Academic Computing Culture In Frontiers in Psychology With Tanya Crenshaw, Cinda Heeren, and Heather Metcalf

Erosion Thickness on Medial Axes of 3D Shapes Project webpage In ACM Transactions on Graphics (Proceedings of ACM Siggraph 2016), 35(4): Article No. 38 With Yajie Yan, Kyle Sykes, David Letscher, and Tao Ju

Minimum cycle and homology bases of surface embedded graphs In SoCG 2016 Invited to special issue of JoCG from the conference With Glencora Borradaile, Kyle Fox, and Amir Nayyeri

Integrating and sampling cuts in bounded treewidth graphs In Advances in the Mathematical Sciences: Research from the 2015 Association for Women in Mathematics Symposium, Letzner et all (eds), pages 401-415, 2016. With Ivona Bezáková and Kyle Fox.

Homotopy Measures for Representative Trajectories In ESA (European Symposium on Algorithms) 2016 Preliminary version appeared in EuroCG 2015 (Proceedings of the 31st European Workshop on Computational Geometry). With Irina Kostitsyna, Maarten Löffler, and Frank Staals,

Computing minimum area homologies In Computer Graphics Forum, 2014, doi: 10.1111/cgf.12514. With Mikael Vejdemo-Johansson.

Global Minimum Cuts in Surface-Embedded Graphs In the Encyclopedia of Algorithms, Springer, 2014. With Jeff Erickson, Kyle Fox, and Amir Nayyeri.

Skeleton-based recognition of shapes in images via the longest path In Research in Shape Analysis, K. Leonard, S. Tari (eds.), Springer, 2014. With Gulce Bal, Julia Diebold, Ellen Gasparovic, Ruizhen Hu, Kathryn Leonhard, Matineh Shaker, and Carola Wenk.

Covering nearly surface-embedded graphs with a fixed number of balls In Discrete & Computational Geometry, pp. 979-996, volume 54, issue 4, 2014. With Glencora Borradaile.

The Polylink Package A package deleoped using C# which allows the user to manipulate and unfold polyhedra in Mathematica. Preprint and development completed in 2013. With Christopher Conlon, Richard Pham, and Kyle Sykes.

The Zipper Foldings of the Diamond In INVOLVE, Vol. 8 (2015), No. 3, 521–534 DOI: 10.2140/involve.2015.8.521 Preliminary version in Fall Workshop on Computational Geometry, 2013. NOTE: The paper published in Involve is considered by the authors to be the final version of this paper. An earlier draft of this paper appears in the journal Geombinatorics and was published without the knowledge of the authors. With Di Fang, Kyle Sykes, Cindy Traub, and Philip Trettenero.

Medial Residues of Piecewise Linear Manifolds In CCCG 2013. Preliminary version in the Fall Workshop on Computational Geometry 2012. With Tao Ju and David Letscher.

Privacy by fake data: a geometric approach In CCCG 2013. With Victor Alvarez and László Kozma.

Measuring Similarity Between Curves on 2-Manifolds via Homotopy Area In SOCG 2013. With Yusu Wang.

Counting and Sampling Minimum Cuts in Genus g Graphs Discrete & Computational Geometry, 52(3):450-475, 2014 (Special issue of invited papers from the 29th SoCG) Preliminary version in SOCG 2013. With Kyle Fox and Amir Nayyeri.

Flows in one-crossing-minor-free graphs In J. Graph Algorithms Appl. 17(3), pages 201-220, 2013. Preliminary version appeared in ISAAC 2010. With David Eppstein.

Multiple Source Shortest Paths in Embedded Graphs In SIAM Journal on Computing, 42(4), pages 1542-1571, 2013. With Sergio Cabello and Jeff Erickson. Originial version with Sergio Cabello in SODA 2007.

Unfolding Rectangle-Faced Orthostacks In CCCG 2012. With Kyle Sykes and Cindy Traub.

Homology Flows, Cohomology Cuts In SIAM Journal on Computing 41(6):1605-1634, 2012. (Special section of invited papers from STOC 2009) Preliminary version appeared in STOC 2009. With Jeff Erickson and Amir Nayyeri.

Drawing graphs in the plane with a prescribed outer face and polynomial area In the Journal of Graph Algorithms and Applications 16(2):243-259, 2012. Preliminary version appeared in Graph Drawing 2010. With David Eppstein, M. T. Goodrich, and M. Löffler.

Isotopic Frechet Distance In CCCG 2011. With Tao Ju. David Letscher, and Lu Liu

Extended Grassfire Transform on Medial Axes of 2D Shapes In Computer Aided Design (Proceedings of SPM 2011), 43(11):1496-1505. With Lu Liu, David Letscher, and Tao Ju.

Connecting a Set of Circles with Minimum Sum of Radii In WADS 2011. With Sandor Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joe Mitchell, Venkatesh Srinivasan, Ulrike Stege, Sue Whitesides.

Connectivity graphs of uncertainty regions In ISAAC 2010. With Al Erickson, Sandor Fekete, Jon Lenchner, Jeff Sember, Venkatesh Srinivasan, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, and Sue Whitesides.

A simple and robust thinning algorithm on cell complexes In Computer Graphics Forum (Proceedings of Pacific Graphics 2010), 29(7):2253-2260. With Lu Liu, David Letscher, and Tao Ju. Movie

Vietoris-Rips Complexes of Planar Point Sets In DCG, July 2010, Volume 44, Issue 1, pp 75-90. With Vin de Silva, Jeff Erickson, and Rob Ghrist.

On the Height of a Homotopy In CCCG 2009. With David Letscher. Erratum to the paper

Minimum Cuts and Shortest Homologous Cycles In SOCG 2009. With Jeff Erickson and Amir Nayyeri.

Testing Contractibility in Planar Rips Complexes In SoCG 2008. Preliminary verison in Fall Workshop 2007 With Jeff Erickson and Pratik Worah.

Homotopic Frechet Distance Between Curves or Walking Your Dog in the Woods in Polynomial Time In Computational Geometry: Theory and Applications, Volume 43 Issue 3, April, 2010, Pages 295-311. (Special issue of invited papers from SoCG 2008) Preliminary version in SoCG 2008 and Fall Workshop 2007 With Éric Colin de Verdière, Jeff Erickson, Sylvain Lazard, Francis Lazarus, and Shripad Thite.

Extremal Problems for Roman Domination In SIAM Journal on Discrete Math, 2009 With Bill Kinnersley, Noah Prince, and Douglas West

A Case Study of Retention Practices at University of Illinois at Urbana-Champaign In SIGCSE 2008 With Tanya Crenshaw, Heather Metcalf, and Umesh Thakkar.

Pebbling and Optimal Pebbling in Graphs In Journal of Graph Theory, 2008 With David Bunde, Dan Cranston, Kevin Milans, and Douglas West.

Splitting (Complicated) Surfaces is Hard In Computational Geometry: Theory and Applications, Volume 41 Issue 1-2, October, 2008, Pages 94-110. (Special issue of papers from EuroCG 2006) Preliminary version in SOCG 2006 With Éric Colin de Verdière, Jeff Erickson, Francis Lazarus, and Kim Whittlesey.

Thesis: Computing Interesting Topological Features Tech Report UIUCDCS-R-2008-3036

Recuitment, Preparation, Retention: A case study of computing culture at the University of Illinois at Urbana-Champaign University of Illinois Technical Report UIUCDCS-R-2007-2811 With Tanya Crenshaw, Heather Metcalf, and Umesh Thakkar.