Loading...
Loading...

Go to the content (press return)

The alternating path problem revisited

Author
Claverol, M.; Garijo, D.; Hurtado, F.; Lara, M.; Seara, C.
Type of activity
Presentation of work at congresses
Name of edition
XV Spanish Meeting on Computational Geometry
Date of publication
2013
Presentation's date
2013-06-28
Book of congress proceedings
XV Spanish Meeting on Computational Geometry
First page
115
Last page
118
Publisher
Universidad de Sevilla
Repository
http://hdl.handle.net/2117/21369 Open in new window
Abstract
It is well known that, given "n" red points and "n" blue points on acircle, 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. It is well known that, gi...
Citation
Claverol, M. [et al.]. The alternating path problem revisited. A: Spanish Meeting on Computational Geometry. "XV Spanish Meeting on Computational Geometry". Sevilla: Universidad de Sevilla, 2013, p. 115-118.
Group of research
CGA -Computational Geometry and Applications
DCG - Discrete and Combinatorial Geometry