Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations

ISSN： 0196-6774

Source： Journal of Algorithms, Vol.23, Iss.1, 1997-04, pp. : 51-73

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Geodesic Shooting for Computational Anatomy

By Miller Michael Trouvé Alain Younes Laurent

Journal of Mathematical Imaging and Vision, Vol. 24, Iss. 2, 2006-03 ,pp. : 209-228

Springer Publishing Company

Access to resources Recommend Favorite

Dynamic programming approaches to solve the shortest path problem with forbidden paths

By Di Puglia Pugliese Luigi Guerriero Francesca

Optimization Methods and Software, Vol. 28, Iss. 2, 2013-04 ,pp. : 221-255

Taylor & Francis Ltd

Access to resources Recommend Favorite

Geodesic paths of circles in the plane

By Salvai Marcos

Revista Matem??tica Complutense, Vol. 24, Iss. 1, 2011-01 ,pp. : 211-218

Springer Publishing Company

Access to resources Recommend Favorite

Minimum Range Balanced Cuts via Dynamic Subset Sums

By Eppstein D.

Journal of Algorithms, Vol. 23, Iss. 2, 1997-05 ,pp. : 375-385

Academic Press

Access to resources Recommend Favorite

Algorithms for shortest paths and d-cycle problems

By Bespamyatnikh S. Kelarev A.

Journal of Discrete Algorithms, Vol. 1, Iss. 1, 2003-02 ,pp. : 1-9

Elsevier

Access to resources Recommend Favorite