{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T13:14:08Z","timestamp":1769692448536,"version":"3.49.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2013,5,3]],"date-time":"2013-05-03T00:00:00Z","timestamp":1367539200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Vis Comput"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s00371-013-0837-x","type":"journal-article","created":{"date-parts":[[2013,5,2]],"date-time":"2013-05-02T20:37:10Z","timestamp":1367527030000},"page":"1051-1062","source":"Crossref","is-referenced-by-count":9,"title":["Enhanced waypoint graph for surface and volumetric path planning in virtual worlds"],"prefix":"10.1007","volume":"29","author":[{"given":"Nicholas Mario","family":"Wardhana","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henry","family":"Johan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hock Soon","family":"Seah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,5,3]]},"reference":[{"key":"837_CR1","first-page":"3","volume-title":"Proceedings of Eurographics \u201987","author":"J. Amanatides","year":"1987","unstructured":"Amanatides, J., Woo, A.: A fast voxel traversal algorithm for ray tracing. In: Proceedings of Eurographics \u201987, Amsterdam, Netherlands, pp. 3\u201310 (1987)"},{"issue":"1","key":"837_CR2","first-page":"7","volume":"1","author":"A. Botea","year":"2004","unstructured":"Botea, A., M\u00fcller, M., Schaeffer, J.: Near optimal hierarchical path-finding. J. Game Dev. 1(1), 7\u201328 (2004)","journal-title":"J. Game Dev."},{"key":"837_CR3","unstructured":"CGAL Open Source Project: Cgal\u2014Computational Geometry Algorithms Library, version 4.1 (2012). http:\/\/www.cgal.org"},{"key":"837_CR4","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1145\/28395.28402","volume-title":"Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC \u201987","author":"K.L. Clarkson","year":"1987","unstructured":"Clarkson, K.L.: Approximation algorithms for shortest path motion planning. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC \u201987, pp. 56\u201365. ACM, New York (1987)"},{"key":"837_CR5","volume-title":"SIGGRAPH 2010 Talks","author":"E. Coumans","year":"2010","unstructured":"Coumans, E.: Optimizing proximity queries for CPU, SPU and GPU. In: SIGGRAPH 2010 Talks (2010). http:\/\/bullet.googlecode.com\/files\/SIGGRAPH_2010_Coumans_Erwin_OptimizingCD.pdf"},{"key":"837_CR6","unstructured":"Coumans, E.: Bullet Physics Library, version 2.81 (2012). http:\/\/bulletphysics.org\/"},{"issue":"1","key":"837_CR7","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"837_CR8","volume-title":"GNU Scientific Library Reference Manual","author":"M. Galassi","year":"2009","unstructured":"Galassi, M., Davies, J., Theiler, J., Gough, B., Jungman, G., Booth, M., Rossi, F.: GNU Scientific Library Reference Manual, 3rd edn. Network Theory Ltd., London (2009)","edition":"3"},{"key":"837_CR9","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/3-540-48481-7_29","volume-title":"ESA \u201999: Proceedings of the 7th Annual European Symposium on Algorithms","author":"B. G\u00e4rtner","year":"1999","unstructured":"G\u00e4rtner, B.: Fast and robust smallest enclosing balls. In: ESA \u201999: Proceedings of the 7th Annual European Symposium on Algorithms, pp. 325\u2013338 (1999)"},{"key":"837_CR10","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.1109\/ROBOT.2007.363119","volume-title":"Proceedings of 2007 IEEE International Conference on Robotics and Automation","author":"R. Geraerts","year":"2007","unstructured":"Geraerts, R., Overmars, M.: The corridor map method: real-time high-quality path planning. In: Proceedings of 2007 IEEE International Conference on Robotics and Automation, Rome, Italy, pp. 1023\u20131028 (2007)"},{"key":"837_CR11","first-page":"147","volume-title":"Proceedings of the 4th Alvey Vision Conference","author":"C. Harris","year":"1988","unstructured":"Harris, C., Stephens, M.: A combined corner and edge detector. In: Proceedings of the 4th Alvey Vision Conference, pp. 147\u2013151 (1988)"},{"issue":"2","key":"837_CR12","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P.E. Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"837_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/3-540-60159-7_6","volume-title":"Advances in Spatial Databases","author":"G. Hjaltason","year":"1995","unstructured":"Hjaltason, G., Samet, H.: Ranking in spatial databases. In: Egenhofer, M., Herring, J. (eds.) Advances in Spatial Databases. Lecture Notes in Computer Science, vol. 951, pp. 83\u201395. Springer, Berlin (1995)"},{"issue":"4","key":"837_CR14","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1109\/70.508439","volume":"12","author":"L. Kavraki","year":"1994","unstructured":"Kavraki, L., Svestka, P., Latombe, J., Overmars, M.: Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans. Robot. Autom. 12(4), 566\u2013580 (1994)","journal-title":"IEEE Trans. Robot. Autom."},{"key":"837_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1007\/3-540-19487-8_23","volume-title":"Proceedings of 1st Scandinavian Workshop on Algorithm Theory","author":"J.M. Keil","year":"1988","unstructured":"Keil, J.M.: Approximating the complete Euclidean graph. In: Proceedings of 1st Scandinavian Workshop on Algorithm Theory. Lecture Notes in Computer Science, vol. 318, pp. 208\u2013213. Springer, London (1988)"},{"issue":"2","key":"837_CR16","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1109\/TC.1983.1676196","volume":"C-32","author":"T. Lozano-P\u00e9rez","year":"1983","unstructured":"Lozano-P\u00e9rez, T.: Spatial planning: a configuration space approach. IEEE Trans. Comput. C-32(2), 108\u2013120 (1983)","journal-title":"IEEE Trans. Comput."},{"issue":"10","key":"837_CR17","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/359156.359164","volume":"22","author":"T. Lozano-P\u00e9rez","year":"1979","unstructured":"Lozano-P\u00e9rez, T., Wesley, M.A.: An algorithm for planning collision-free paths among polyhedral obstacles. Commun. ACM 22(10), 560\u2013570 (1979)","journal-title":"Commun. ACM"},{"key":"837_CR18","first-page":"81","volume-title":"First International Workshop on Crowd Simulation (V-CROWDS \u201905)","author":"J. Pettr\u00e9","year":"2005","unstructured":"Pettr\u00e9, J., Laummond, J.P., Thalmann, D.: A navigation graph for real-time crowd animation on multilayered and uneven terrain. In: First International Workshop on Crowd Simulation (V-CROWDS \u201905), Lausanne, Switzerland, pp. 81\u201389 (2005)"},{"key":"837_CR19","volume-title":"Toward More Realistic Pathfinding","author":"M. Pinter","year":"2001","unstructured":"Pinter, M.: In: Toward More Realistic Pathfinding (2001). http:\/\/www.gamasutra.com\/features\/20010314\/pinter_02.htm"},{"key":"837_CR20","unstructured":"Siek, J., Lee, L.Q., Lumsdaine, A.: Boost Graph Library, version 1.52 (2012). http:\/\/www.boost.org\/libs\/graph\/"},{"key":"837_CR21","first-page":"113","volume-title":"AI Game Programming Wisdom 2, Chap. 2.1","author":"P. Tozour","year":"2004","unstructured":"Tozour, P.: Search space representations. In: AI Game Programming Wisdom 2, Chap. 2.1, pp. 113\u2013128. Charles River Media, Newton Center (2004)"},{"key":"837_CR22","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/978-3-642-12802-8_14","volume-title":"High-Quality Visual Experience, Signals and Communication Technology","author":"M. \u017dagar","year":"2010","unstructured":"\u017dagar, M., Kova\u010d, M., Knezovi\u0107, J., Mlinari\u0107, H., Hofman, D.: 3D object classification and segmentation methods. In: Mrak, M., Grgic, M., Kunt, M. (eds.) High-Quality Visual Experience, Signals and Communication Technology, pp. 331\u2013347. Springer, Berlin (2010)"},{"key":"837_CR23","first-page":"450","volume-title":"Proceedings of the 2012 International Workshop on Advanced Image Technology (IWAIT 2012)","author":"N.M. Wardhana","year":"2012","unstructured":"Wardhana, N.M., Johan, H., Seah, H.S.: Automatic generation of enhanced waypoint graph for volumetric path planning. In: Proceedings of the 2012 International Workshop on Advanced Image Technology (IWAIT 2012), pp. 450\u2013455, Ho Chi Minh City, Vietnam (2012)"},{"key":"837_CR24","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1109\/CW.2012.17","volume-title":"Proceedings of 2012 International Conference on Cyberworlds","author":"N.M. Wardhana","year":"2012","unstructured":"Wardhana, N.M., Johan, H., Seah, H.S.: Enhanced waypoint graph for path planning in virtual worlds. In: Proceedings of 2012 International Conference on Cyberworlds, Darmstadt, Germany, pp. 69\u201376 (2012)"},{"issue":"9","key":"837_CR25","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1007\/s00371-007-0149-0","volume":"23","author":"L. Zhang","year":"2007","unstructured":"Zhang, L., Chen, W., Ebert, D.S., Peng, Q.: Conservative voxelization. Vis. Comput. 23(9), 783\u2013792 (2007)","journal-title":"Vis. Comput."}],"container-title":["The Visual Computer"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00371-013-0837-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00371-013-0837-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00371-013-0837-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:33Z","timestamp":1559055573000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00371-013-0837-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,3]]},"references-count":25,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["837"],"URL":"https:\/\/doi.org\/10.1007\/s00371-013-0837-x","relation":{},"ISSN":["0178-2789","1432-2315"],"issn-type":[{"value":"0178-2789","type":"print"},{"value":"1432-2315","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5,3]]}}}