M. Abellanas, J. Garcia-lopez, G. Hernández-peñalver, M. Noy, and P. A. Ramos, Bipartite embeddings of trees in the plane, Discrete Applied Mathematics, vol.93, issue.2-3, pp.141-148, 1999.
DOI : 10.1016/S0166-218X(99)00042-6

O. Aichholzer, S. Cabello, R. F. Monroy, D. Flores-peñaloza, T. Hackl et al., Edge-removal and non-crossing configurations in geometric graphs, Discrete Mathematics & Theoretical Computer Science, vol.12, issue.1, pp.75-86, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00990435

O. Aichholzer, T. Hackl, M. Korman, A. Pilz, and B. Vogtenhuber, Geodesicpreserving polygon simplification, Proceedings of the 24th International Symposium on Algorithms and Computation (ISAAC), pp.11-21, 2013.

A. Biniaz, A. Maheshwari, S. C. Nandy, and M. Smid, An optimal algorithm for plane matchings in multipartite geometric graphs, To appear in Algorithms and Data Structures Symposium (WADS'15), 2015.
DOI : 10.1007/978-3-319-21840-3_6

P. Bose, E. D. Demaine, F. Hurtado, J. Iacono, S. Langerman et al., Geodesic Ham-Sandwich Cuts, Discrete & Computational Geometry, vol.37, issue.3, pp.325-339, 2007.
DOI : 10.1007/s00454-006-1287-2
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.1218

L. J. Guibas, J. Hershberger, D. Leven, M. Sharir, and R. E. Tarjan, Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons, Algorithmica, vol.32, issue.1-4, pp.209-233, 1987.
DOI : 10.1007/BF01840360

A. Kaneko, On the Maximum Degree of Bipartite Embeddings of Trees in the Plane, Japan Conference on Discrete and Computational Geometry, JCDCG, pp.166-171, 1998.
DOI : 10.1007/978-3-540-46515-7_13

A. Kaneko and M. Kano, Discrete Geometry on Red and Blue Points in the Plane ??? A Survey ???, Discrete and Computational Geometry, pp.551-570, 2003.
DOI : 10.1007/978-3-642-55566-4_25

M. Kano, K. Suzuki, and M. Uno, Properly Colored Geometric Matchings and 3-Trees Without Crossings on Multicolored Points in the Plane, 16th Japanese Conference on Disc. Comp. Geom. and Graphs, JCDCGG, pp.96-111, 2013.
DOI : 10.1007/978-3-319-13287-7_9

D. G. Kirkpatrick, Optimal Search in Planar Subdivisions, SIAM Journal on Computing, vol.12, issue.1, pp.28-35, 1983.
DOI : 10.1137/0212002
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.461.1866

D. Sitton, Maximum matchings in complete multipartite graphs, pp.6-16, 1996.

G. T. Toussaint, Computing geodesic properties inside a simple polygon. Revue D'Intelligence Artificielle, pp.9-42, 1989.