An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions

ISSN： 0179-5376

Source： Discrete & Computational Geometry, Vol.39, Iss.1-3, 2008-03, pp. : 500-579

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

Related content

The Integer Hull of a Convex Rational Polytope

By Lasserre Jean B.

Discrete & Computational Geometry, Vol. 32, Iss. 1, 2004-05 ,pp. : 129-139

Springer Publishing Company

Access to resources Recommend Favorite

Shortest Paths in Distance-regular Graphs

By Bendito E. Carmona A. Encinas A.M.

European Journal of Combinatorics, Vol. 21, Iss. 2, 2000-02 ,pp. : 153-166

Elsevier

Access to resources Recommend Favorite

A Randomized Parallel Three-Dimensional Convex Hull Algorithm for Coarse-Grained Multicomputers

By Dehne F. Deng X. Dymond P. Fabri A. Khokhar A. A.

Theory of Computing Systems, Vol. 30, Iss. 6, 1997-12 ,pp. : 547-558

Springer Publishing Company

Access to resources Recommend Favorite

Almost convex valued perturbation to time optimal control sweeping processes

By Affane Doria Azzam-Laouir Dalila

ESAIM: Control, Optimisation and Calculus of Variations, Vol. 23, Iss. 1, 2016-12 ,pp. : 1-12

Edp Sciences

Access to resources Recommend Favorite

Shortest periodic billiard trajectories in convex bodies

By Ghomi Mohammad

Geometric & Functional Analysis GAFA, Vol. 14, Iss. 2, 2004-04 ,pp. : 295-302

Springer Publishing Company

Access to resources Recommend Favorite