Designing evacuation routes with GeoGebra
We expose in this paper how the command ShortestDistance can be used in GeoGebra to design evacuation routes in buildings in a dynamic and interactive way. For those cases in which a legal regulation or procedure compels specific requirements in the design, we also indicate how to make use of JavaSc...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2015 |
| País: | España |
| Institución: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/69095 |
| Acceso en línea: | https://hdl.handle.net/11441/69095 |
| Access Level: | acceso abierto |
| Palabra clave: | Evacuation route Graph theory Dijkstra’s algorithm |
| Sumario: | We expose in this paper how the command ShortestDistance can be used in GeoGebra to design evacuation routes in buildings in a dynamic and interactive way. For those cases in which a legal regulation or procedure compels specific requirements in the design, we also indicate how to make use of JavaScript in order to implement a more general version of Dijkstra’s algorithm that makes possible to deal with such specifications. |
|---|