Compatible Paths on Labelled Point Sets
暂无分享,去创建一个
Csaba D. Tóth | Debajyoti Mondal | John Iacono | Kshitij Jain | Elena Arseneva | Pilar Cano | Anna Lubiw | Ahmad Biniaz | Khadijeh Sheikhan | Yeganeh Bahoo | Farah Chanchary | A. Lubiw | Debajyoti Mondal | Ahmad Biniaz | Kshitij Jain | J. Iacono | F. Chanchary | Pilar Cano | Elena Arseneva | Khadijeh Sheikhan | Yeganeh Bahoo
[1] Diane L. Souvaine,et al. Constructing piecewise linear homeomorphisms of polygons with holes , 1997, CCCG.
[2] Michael Tarsi,et al. The Structure of Well-Covered Graphs and the Complexity of Their Recognition Problems , 1997, J. Comb. Theory, Ser. B.
[3] Michael D. Plummer,et al. On well-covered pentagonalizations of the plane , 2017, Discret. Appl. Math..
[4] Richard Pollack,et al. On the Combinatorial Classification of Nondegenerate Configurations in the Plane , 1980, J. Comb. Theory, Ser. A.
[5] Debajyoti Mondal,et al. On Compatible Triangulations with a Minimum Number of Steiner Points , 2017, CCCG.
[6] Xin-She Yang,et al. Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.
[7] Alan Saalfeld. Joint triangulations and triangulation maps , 1987, SCG '87.
[8] Ronald L. Rivest,et al. Introduction to Algorithms, 3rd Edition , 2009 .
[9] Farhad Shahrokhi,et al. Applications of the crossing number , 1994, SCG '94.
[10] William V. Baxter,et al. Compatible Embedding for 2D Shape Animation , 2009, IEEE Transactions on Visualization and Computer Graphics.
[11] Marcus Schaefer,et al. Paired Pointset Traversal , 2004, ISAAC.
[12] John Hershberger,et al. An optimal visibility graph algorithm for triangulated simple polygons , 1989, Algorithmica.
[13] Franz Aurenhammer,et al. Towards compatible triangulations , 2001, Theor. Comput. Sci..
[14] Boris Aronov,et al. On Compatible Triangulations of Simple Polygons , 1993, Comput. Geom..
[15] Craig Gotsman,et al. High quality compatible triangulations , 2004, Engineering with Computers.