Díaz Báñez, José MiguelGarijo Royo, DeliaMárquez Pérez, AlbertoUrrutia Galicia, Jorge2017-05-232017-05-232013Claverol Aguas, M., Garijo Royo, D., Hurtado Díaz, F., Lara Cuevas, M.D. y Seara Ojea, C. (2013). The alternating path problem revisited. En XV Spanish Meeting on Computational Geometry, Sevilla.http://hdl.handle.net/11441/60281It is well known that, given n red points and n blue points on a circle, it is not always possible to find a plane geometric Hamiltonian alternating path. In this work we prove that if we relax the constraint on the path from being plane to being 1-plane, then the problem always has a solution, and even a Hamiltonian alternating cycle can be obtained on all instances. We also extend this kind of result to other configurations and provide remarks on similar problems.application/pdfengAttribution-NonCommercial-NoDerivatives 4.0 Internacionalhttp://creativecommons.org/licenses/by-nc-nd/4.0/info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/openAccess