{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:57:14Z","timestamp":1760709434701,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319684444"},{"type":"electronic","value":"9783319684451"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-68445-1_91","type":"book-chapter","created":{"date-parts":[[2017,10,23]],"date-time":"2017-10-23T20:40:36Z","timestamp":1508791236000},"page":"791-800","source":"Crossref","is-referenced-by-count":7,"title":["Automatic Differentiation of Non-holonomic Fast Marching for Computing Most Threatening Trajectories Under Sensors Surveillance"],"prefix":"10.1007","author":[{"given":"Jean-Marie","family":"Mirebeau","sequence":"first","affiliation":[]},{"given":"Johann","family":"Dreo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,24]]},"reference":[{"key":"91_CR1","unstructured":"Barbaresco, F., Monnier, B.: Minimal geodesics bundles by active contours: radar application for computation of most threathening trajectories areas & corridors. In: 10th European Signal Processing Conference, Tampere, pp. 1\u20134 (2000)"},{"key":"91_CR2","doi-asserted-by":"crossref","unstructured":"Barbaresco, F.: Computation of most threatening radar trajectories areas and corridors based on fast-marching & Level Sets. In: IEEE Symposium on Computational Intelligence for Security and Defense Applications (CISDA), Paris, pp. 51\u201358 (2011)","DOI":"10.1109\/CISDA.2011.5945944"},{"key":"91_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-8176-4755-1","volume-title":"Optimal Control and Viscosity Solutions of Hamilton-Jacobi-Bellman Equations","author":"M Bardi","year":"1997","unstructured":"Bardi, M., Capuzzo-Dolcetta, I.: Optimal Control and Viscosity Solutions of Hamilton-Jacobi-Bellman Equations. Bikhauser, Bosto (1997)"},{"key":"91_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/978-3-319-18461-6_49","volume-title":"Scale Space and Variational Methods in Computer Vision","author":"EJ Bekkers","year":"2015","unstructured":"Bekkers, E.J., Duits, R., Mashtakov, A., Sanguinetti, G.R.: Data-driven sub-riemannian geodesics in SE(2). In: Aujol, J.-F., Nikolova, M., Papadakis, N. (eds.) SSVM 2015. LNCS, vol. 9087, pp. 613\u2013625. Springer, Cham (2015). doi: 10.1007\/978-3-319-18461-6_49"},{"issue":"3","key":"91_CR5","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/s00211-010-0305-8","volume":"116","author":"F Benmansour","year":"2010","unstructured":"Benmansour, F., Carlier, G., Peyr\u00e9, G., Santambrogio, F.: Derivatives with respect to metrics and applications: subgradient marching algorithm. Numer. Math. 116(3), 357\u2013381 (2010)","journal-title":"Numer. Math."},{"issue":"2","key":"91_CR6","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/s11263-010-0331-0","volume":"92","author":"F Benmansour","year":"2011","unstructured":"Benmansour, F., Cohen, L.: Tubular structure segmentation based on minimal path method and anisotropic enhancement. Int. J. Comput. Vis. 92(2), 192\u2013210 (2011)","journal-title":"Int. J. Comput. Vis."},{"key":"91_CR7","doi-asserted-by":"crossref","unstructured":"Chen, D., Mirebeau, J.-M., Cohen, L.D.: A new finsler minimal path model with curvature penalization for image segmentation and closed contour detection. In: Proceedings of CVPR 2016, Las Vegas, USA (2016)","DOI":"10.1109\/CVPR.2016.45"},{"key":"91_CR8","doi-asserted-by":"crossref","first-page":"497","DOI":"10.2307\/2372560","volume":"79","author":"LE Dubins","year":"1957","unstructured":"Dubins, L.E.: On curves of minimal length with a constraint on average curvature, and with prescribed initial and terminal positions and tangents. Amer. J. Math. 79, 497\u2013516 (1957)","journal-title":"Amer. J. Math."},{"key":"91_CR9","unstructured":"Duits, R., Meesters, S.P.L., Mirebeau, J.-M., Portegies, J.M.: Optimal Paths for Variants of the 2D and 3D Reeds-Shepp. Car with Applications in Image Analysis (Preprint available on arXiv)"},{"key":"91_CR10","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898717761","volume-title":"Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation","author":"A Griewank","year":"2008","unstructured":"Griewank, A., Walther, A.: Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation. Society for Industrial and Applied Mathematics, Philadelphia (2008)"},{"issue":"4","key":"91_CR11","doi-asserted-by":"crossref","first-page":"1573","DOI":"10.1137\/120861667","volume":"52","author":"J-M Mirebeau","year":"2014","unstructured":"Mirebeau, J.-M.: Anisotropic Fast-Marching on cartesian grids using Lattice Basis Reduction. SIAM J. Numer. Anal. 52(4), 1573\u20131599 (2014)","journal-title":"SIAM J. Numer. Anal."},{"key":"91_CR12","unstructured":"Mirebeau, J.-M.: Anisotropic fast-marching on cartesian grids using Voronois first reduction of quadratic forms (preprint available on HAL)"},{"key":"91_CR13","unstructured":"Mirebeau, J.-M.: Fast Marching methods for Curvature Penalized Shortest Paths (preprint available on HAL)"},{"issue":"3","key":"91_CR14","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1137\/0729053","volume":"29","author":"E Rouy","year":"1992","unstructured":"Rouy, E., Tourin, A.: A viscosity solutions approach to shape-from-shading. SIAM J. Numer. Anal. 29(3), 867\u2013884 (1992)","journal-title":"SIAM J. Numer. Anal."},{"issue":"20","key":"91_CR15","doi-asserted-by":"crossref","first-page":"11069","DOI":"10.1073\/pnas.201222998","volume":"98","author":"J Sethian","year":"2001","unstructured":"Sethian, J., Vladimirsky, A.: Ordered upwind methods for static Hamilton-Jacobi equations. Proc. Natl. Acad. Sci. 98(20), 11069\u201311074 (2001)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"91_CR16","doi-asserted-by":"crossref","unstructured":"Sch\u00fcrmann, A.: Computational geometry of positive definite quadratic forms, University Lecture Series (2009)","DOI":"10.1090\/ulect\/048"},{"key":"91_CR17","doi-asserted-by":"crossref","unstructured":"Strode, C.; Optimising multistatic sensor locations using path planning and game theory. In: IEEE Symposium on Computational Intelligence for Security and Defense Applications (CISDA), Paris, pp. 9\u201316 (2011)","DOI":"10.1109\/CISDA.2011.5945938"}],"container-title":["Lecture Notes in Computer Science","Geometric Science of Information"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68445-1_91","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T21:59:59Z","timestamp":1570226399000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68445-1_91"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319684444","9783319684451"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68445-1_91","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}