Survey of Robot 3D Path Planning Algorithms <s> Dijkstra's Algorithm. Named after Dijkstra <s> In this paper, we introduce a concise and concrete definition of an accurate colon centerline and provide an efficient automatic means to extract the centerline and its associated branches (caused by a forceful touching of colon and small bowel or a deep fold in twisted colon lumen). We further discuss its applications on fly-through path planning and endoscopic simulation, as well as its potential to solve the challenging touching and colon collapse problems in virtual colonoscopy. Experimental results demonstrated its centeredness, robustness, and efficiency. <s> BIB001 </s> Survey of Robot 3D Path Planning Algorithms <s> Dijkstra's Algorithm. Named after Dijkstra <s> This paper describes the methodology and the evaluation of a 3D skeletonization algorithm applied on brain vascular structure. This method is based on the application of the minimum cost-spanning tree using Dijkstra's algorithm and seems well appropriate to tubular objects. We briefly describe the different steps, from the segmentation to the skeleton analysis. Besides, we propose an original evaluation scheme of the method based on digital phantom and clinical data. The final aim of this work is to provide a symbolic description framework applied to cerebro-vascular structures. <s> BIB002
Authors in BIB002 proposed an improved Dijkstra's algorithm by adding a center constraint; it works well in tubular objects, which is first proposed by BIB001 . The work  showed that 3D GIS environment combined method may be a practical way to implement in real outside world, and experimental results are provided to prove that Dijkstra's algorithm acts well enough. But Dijkstra's algorithm relies much on the priority queue data structure type, which influences the total exploring time.