Applications of Topology to the Analysis of 1-Dimensional Objects (Dagstuhl Seminar 17072)
暂无分享,去创建一个
[1] Michael S. Floater,et al. Parametric Tilings and Scattered Data Approximation , 1998, Int. J. Shape Model..
[2] M. Lackenby. A polynomial upper bound on Reidemeister moves , 2013, 1302.0180.
[3] Xuemin Lin,et al. Towards area requirements for drawing hierarchically planar graphs , 2003, Theor. Comput. Sci..
[4] A. Hatcher. On triangulations of surfaces , 1991 .
[5] Günter Rote,et al. Convexifying Polygons Without Losing Visibilities , 2011, CCCG.
[6] W. T. Tutte. How to Draw a Graph , 1963 .
[7] Norishige Chiba,et al. Drawing plane graphs nicely , 1985, Acta Informatica.
[8] Hiroshi Nagamochi,et al. Convex drawings of hierarchical planar graphs and clustered planar graphs , 2010, J. Discrete Algorithms.
[9] Marc Lackenby,et al. Core curves of triangulated solid tori , 2011, 1106.2934.
[10] Sergei Matveev,et al. Algorithmic Topology and Classification of 3-Manifolds , 2003 .
[11] David Eppstein,et al. Planar and Poly-Arc Lombardi Drawings , 2018, J. Comput. Geom..
[12] A. Mijatović. Simplifying triangulations of S3 , 2003 .
[13] Craig Gotsman,et al. Discrete one-forms on meshes and applications to 3D mesh parameterization , 2006, Comput. Aided Geom. Des..
[14] David Eppstein,et al. Planar Lombardi Drawings for Subcubic Graphs , 2012, GD.
[15] Timothy M. Chan,et al. How to Morph Planar Graph Drawings , 2016, SIAM J. Comput..
[16] D. Rolfsen. Knots and Links , 2003 .
[17] Giordano Da Lozzo,et al. Optimal Morphs of Convex Drawings , 2015, SoCG.