{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T15:35:23Z","timestamp":1778168123132,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642169571","type":"print"},{"value":"9783642169588","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16958-8_22","type":"book-chapter","created":{"date-parts":[[2010,11,2]],"date-time":"2010-11-02T16:26:12Z","timestamp":1288715172000},"page":"230-241","source":"Crossref","is-referenced-by-count":23,"title":["Navigation Queries from Triangular Meshes"],"prefix":"10.1007","author":[{"given":"Marcelo","family":"Kallmann","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1142\/S0218195998000187","volume":"8","author":"G. Albers","year":"1992","unstructured":"Albers, G., Mitchell, J.S., Guibas, L.J., Roos, T.: Voronoi diagrams of moving points. Internat. J. Comput. Geom. Appl.\u00a08, 365\u2013380 (1992)","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Berg, J., Lin, M., Manocha, D.: Reciprocal velocity obstacles for real-time multi-agent navigation. In: Proceedings of the International Conference on Robotics and Automation, ICRA 2008 (2008)","DOI":"10.1109\/ROBOT.2008.4543489"},{"key":"22_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational geometry: algorithms and applications","author":"M. Berg De","year":"2008","unstructured":"De Berg, M., Cheong, O., van Kreveld, M.: Computational geometry: algorithms and applications. Springer, Heidelberg (2008)"},{"key":"22_CR4","first-page":"942","volume-title":"Proceedings of the 21st National Conference on Artificial Intelligence, AAAI 2006","author":"D. Demyen","year":"2006","unstructured":"Demyen, D., Buro, M.: Efficient triangulation-based pathfinding. In: Proceedings of the 21st National Conference on Artificial Intelligence, AAAI 2006, pp. 942\u2013947. AAAI Press, Menlo Park (2006)"},{"issue":"7","key":"22_CR5","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1177\/027836499801700706","volume":"17","author":"L.P. Fiorini","year":"1998","unstructured":"Fiorini, L.P., Shiller, Z.: Motion planning in dynamic environments using velocity obstacles. International Journal of Robotics Research\u00a017(7), 760\u2013772 (1998)","journal-title":"International Journal of Robotics Research"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1109\/TVCG.2008.84","volume":"15","author":"R. Gayle","year":"2009","unstructured":"Gayle, R., Sud, A., Andersen, E., Guy, S.J., Lin, M.C., Manocha, D.: Interactive navigation of heterogeneous agents using adaptive roadmaps. IEEE Transactions on Visualization and Computer Graphics\u00a015, 34\u201348 (2009)","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Geraerts, R.: Planning short paths with clearance using explicit corridors. In: Proceedings of the IEEE International Conference on Robotics and Automation, ICRA 2010 (2010)","DOI":"10.1109\/ROBOT.2010.5509263"},{"issue":"2","key":"22_CR8","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1002\/cav.166","volume":"18","author":"R. Geraerts","year":"2007","unstructured":"Geraerts, R., Overmars, M.H.: The corridor map method: a general framework for real-time high-quality path planning: Research articles. Computer Animation and Virtual Worlds\u00a018(2), 107\u2013119 (2007)","journal-title":"Computer Animation and Virtual Worlds"},{"issue":"2","key":"22_CR9","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/282918.282923","volume":"4","author":"L. Guibas","year":"1985","unstructured":"Guibas, L., Stolfi, J.: Primitives for the manipulation of general subdivisions and the computation of voronoi. ACM Trans. Graph.\u00a04(2), 74\u2013123 (1985)","journal-title":"ACM Trans. Graph."},{"issue":"2","key":"22_CR10","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0925-7721(94)90010-8","volume":"4","author":"J. Hershberger","year":"1994","unstructured":"Hershberger, J., Snoeyink, J.: Computing minimum length paths of a given homotopy class. Computational Geometry Theory and Application\u00a04(2), 63\u201397 (1994)","journal-title":"Computational Geometry Theory and Application"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"2215","DOI":"10.1137\/S0097539795289604","volume":"28","author":"J. Hershberger","year":"1997","unstructured":"Hershberger, J., Suri, S.: An optimal algorithm for euclidean shortest paths in the plane. SIAM Journal on Computing\u00a028, 2215\u20132256 (1997)","journal-title":"SIAM Journal on Computing"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Hoff III, K.E., Culver, T., Keyser, J., Lin, M., Manocha, D.: Fast computation of generalized voronoi diagrams using graphics hardware. In: Proceedings of the Sixteenth Annual Symposium on Computational Geometry (2000)","DOI":"10.1145\/336154.336226"},{"key":"22_CR13","unstructured":"Kallmann, M.: Shortest paths with arbitrary clearance from navigation meshes. In: Proceedings of the Eurographics \/ SIGGRAPH Symposium on Computer Animation, SCA (2010)"},{"key":"22_CR14","first-page":"241","volume-title":"Geometric Modeling for Scientific Visualization","author":"M. Kallmann","year":"2003","unstructured":"Kallmann, M., Bieri, H., Thalmann, D.: Fully dynamic constrained delaunay triangulations. In: Brunnett, G., Hamann, B., Mueller, H., Linsen, L. (eds.) Geometric Modeling for Scientific Visualization, pp. 241\u2013257. Springer, Heidelberg (2003) ISBN 3-540-40116-4"},{"issue":"1","key":"22_CR15","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1080\/10867651.2001.10487533","volume":"6","author":"M. Kallmann","year":"2001","unstructured":"Kallmann, M., Thalmann, D.: Star vertices: A compact representation for planar meshes with adjacency information. Journal of Graphics Tools\u00a06(1), 7\u201318 (2001)","journal-title":"Journal of Graphics Tools"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Lamarche, F.: TopoPlan: a topological path planner for real time human navigation under floor and ceiling constraints. Computer Graphics Forum\u00a028 (03 2009)","DOI":"10.1111\/j.1467-8659.2009.01405.x"},{"issue":"10","key":"22_CR17","doi-asserted-by":"publisher","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. Communications of ACM\u00a022(10), 560\u2013570 (1979)","journal-title":"Communications of ACM"},{"key":"22_CR18","volume-title":"An introduction to solid modeling","author":"M. M\u00e4ntyl\u00e4","year":"1987","unstructured":"M\u00e4ntyl\u00e4, M.: An introduction to solid modeling. Computer Science Press, Inc., New York (1987)"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Mekni, M.: Hierarchical path planning for situated agents in informed virtual geographic environments. In: Proceedings of the 3rd International ICST Conference on Simulation Tools and Techniques, SIMUTools 2010, pp. 1\u201310 (2010)","DOI":"10.4108\/ICST.SIMUTOOLS2010.8811"},{"key":"22_CR20","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1145\/160985.161156","volume-title":"Proceedings of the Ninth Annual Symposium on Computational Geometry, SCG 1993","author":"J.S.B. Mitchell","year":"1993","unstructured":"Mitchell, J.S.B.: Shortest paths among obstacles in the plane. In: Proceedings of the Ninth Annual Symposium on Computational Geometry, SCG 1993, pp. 308\u2013317. ACM, New York (1993)"},{"key":"22_CR21","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1145\/73393.73410","volume-title":"Proceedings of the fourth Annual Symposium on Computational Geometry, SCG 1988","author":"M.H. Overmars","year":"1988","unstructured":"Overmars, M.H., Welzl, E.: New methods for computing visibility graphs. In: Proceedings of the fourth Annual Symposium on Computational Geometry, SCG 1988, pp. 164\u2013171. ACM Press, New York (1988)"},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"Rong, G., Tan, T.-s., Cao, T.-t.: Computing two-dimensional delaunay triangulation using graphics hardware. In: Proceedings of the Symposium on Interactive 3D Graphics and Games, I3D (2008)","DOI":"10.1145\/1342250.1342264"},{"key":"22_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BFb0014497","volume-title":"Applied Computational Geometry. Towards Geometric Engineering","author":"J.R. Shewchuk","year":"1996","unstructured":"Shewchuk, J.R.: Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator. In: Lin, M.C., Manocha, D. (eds.) FCRC 1996 and WACG 1996. LNCS, vol.\u00a01148, pp. 203\u2013222. Springer, Heidelberg (1996); from the First ACM Workshop on Applied Computational Geometry"},{"issue":"5","key":"22_CR24","doi-asserted-by":"publisher","first-page":"982","DOI":"10.1145\/185675.185795","volume":"41","author":"J.A. Storer","year":"1994","unstructured":"Storer, J.A., Reif, J.H.: Shortest paths in the plane with polygonal obstacles. J. ACM\u00a041(5), 982\u20131012 (1994)","journal-title":"J. ACM"},{"key":"22_CR25","doi-asserted-by":"crossref","unstructured":"Subramanian, S., Klein, P., Klein, P., Rao, S., Rao, S., Rauch, M., Rauch, M.: Faster shortest-path algorithms for planar graphs. Journal of Computer and System Sciences, 27\u201337 (1994)","DOI":"10.1145\/195058.195092"},{"key":"22_CR26","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1109\/TVCG.2008.27","volume":"14","author":"A. Sud","year":"2008","unstructured":"Sud, A., Andersen, E., Curtis, S., Lin, M.C., Manocha, D.: Real-time path planning in dynamic virtual environments using multiagent navigation graphs. IEEE Transactions on Visualization and Computer Graphics\u00a014, 526\u2013538 (2008)","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"key":"22_CR27","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/1064092.1064104","volume-title":"Proceedings of the Twenty-First Annual Symposium on Computational Geometry, SCG 2005","author":"R. Wein","year":"2005","unstructured":"Wein, R., van den Berg, J.P., Halperin, D.: The visibility\u2013voronoi complex and its applications. In: Proceedings of the Twenty-First Annual Symposium on Computational Geometry, SCG 2005, pp. 63\u201372. ACM, New York (2005)"}],"container-title":["Lecture Notes in Computer Science","Motion in Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16958-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,27]],"date-time":"2025-02-27T14:20:30Z","timestamp":1740666030000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16958-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642169571","9783642169588"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16958-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}