Advertisement

Performing Multicut on Walkable Environments

Obtaining a Minimally Connected Multi-layered Environment from a Walkable Environment
  • Arne Hillebrand
  • Marjan van den Akker
  • Roland Geraerts
  • Han Hoogeveen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10043)

Abstract

A multi-layered environment is a representation of the walkable space in a 3D virtual environment that comprises a set of two-dimensional layers together with the locations where the different layers touch, which are called connections. This representation can be used for crowd simulations, e.g. to determine evacuation times in complex buildings. Since the execution times of many algorithms depend on the number of connections, we will study multi-layered environments with a minimal number of connections. We show how finding a minimally connected multi-layered environment can be formulated as an instance of the multicut problem. We will prove that finding a minimally connected multi-layered environment is an NP-Hard problem. Lastly, we will present techniques which shrink the size of the underlying graph by removing redundant information. These techniques decrease the input size for algorithms that use this representation for finding multi-layered environments.

Keywords

Simple Path Visibility Graph Graph Reduction Crowd Simulation Walkable Environment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Calinescu, G., Fernandes, C.G., Reed, B.: Multicuts in unweighted graphs with bounded degree and bounded tree-width. In: Bixby, R.E., Boyd, E.A., Ríos-Mercado, R.Z. (eds.) IPCO 1998. LNCS, vol. 1412, p. 137. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  2. 2.
    Dahlhaus, E., Johnson, D., Papadimitriou, C., Seymour, P., Yannakakis, M.: The complexity of multiterminal cuts. SIAM J. Comput. 23(4), 864–894 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Deusdado, L., Fernandes, A.R., Belo, O.: Path planning for complex 3D multilevel environments. In: Proceedings of 24th Spring Conference on Computer Graphics, pp. 187–194 (2008)Google Scholar
  4. 4.
    Ford, L., Fulkerson, D.: Solving the transportation problem. Manag. Sci. 3(1), 24–32 (1956)CrossRefGoogle Scholar
  5. 5.
    Guo, J., Hüffner, F., Kenar, E., Niedermeier, R., Uhlmann, J.: Complexity and exact algorithms for multicut. In: Software Seminar, pp. 303–312 (2006)Google Scholar
  6. 6.
    Harel, D., Sardas, M.: An algorithm for straight-line drawing of planar graphs. Algorithmica 20, 119–135 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Hillebrand, A., van den Akker, M., Geraerts, R., Hoogeveen, H.: Separating a walkable environment into layers. In: 9th International ACM SIGGRAPH Conference on Motion in Games (2016, to appear)Google Scholar
  8. 8.
    Itai, A.: Two-commodity flow. J. ACM 25, 596–611 (1978)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Jiang, H., Xu, W., Mao, T., Li, C., Xia, S., Wang, Z.: A semantic environment model for crowd simulation in multilayered complex environment. ACM Symp. Virtual Reality Softw. Technol. 2015, 191–198 (2009)Google Scholar
  10. 10.
    Lozano-Pérez, T., Wesley, M.A.: An algorithm for planning collision-free paths among polyhedral obstacles. Commun. ACM 22(10), 560–570 (1979)CrossRefGoogle Scholar
  11. 11.
    Oliva, R., Pelechano, N.: NEOGEN: near optimal generator of navigation meshes for 3D multi-layered environments. Comput. Graph. 37(5), 403–412 (2013)CrossRefGoogle Scholar
  12. 12.
    Pettré, J., Laumond, J.P., Thalmann, D.: A navigation graph for real-time crowd animation on multilayered and uneven terrain. First Int. Workshop Crowd Simul. 47(2), 81–90 (2005)Google Scholar
  13. 13.
    Saaltink, W.: Partitioning polygonal environments into multi-layered environments. Master’s thesis, Utrecht University (2011)Google Scholar
  14. 14.
    Schrijver, A.: Combinatorial Optimization - Polyhedra and Efficiency. Algorithms and Combinatorics, vol. 24. Springer, Heidelberg (2003)zbMATHGoogle Scholar
  15. 15.
    Snook, G.: Simplified 3D movement and pathfinding using navigation meshes. In: DeLoura, M. (ed.) Game Programming Gems, pp. 288–304. Charles River Media, Newton Centre (2000)Google Scholar
  16. 16.
    van Toll, W., Cook IV., A., Geraerts, R.: Navigation meshes for realistic multi-layered environments. In: 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 3526–3532 (2011)Google Scholar
  17. 17.
    Whyte, J., Bouchlaghem, N., Thorpe, A., McCaffer, R.: From cad to virtual reality: modelling approaches, data exchange and interactive 3D building design tools. Autom. Constr. 10(1), 43–55 (2000)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  • Arne Hillebrand
    • 1
  • Marjan van den Akker
    • 1
  • Roland Geraerts
    • 1
  • Han Hoogeveen
    • 1
  1. 1.Institute of Information and Computing SciencesUtrecht UniversityUtrechtThe Netherlands

Personalised recommendations