Photoacoustic Image Based Intro-Operative Surgical Guidance System in a da Vinci Surgical Robot Platform
In nerve sparing radical prostatectomy, the surgical guidance system used to track surgical tools helps
surgeons to avoid the intra-operation trauma of nerves and alleviate the post-operative ...
Description Basic ProblemFind a collision-free path from the initial configuration to the goal configuration in the C-space. The Hard part of path planning is to represent the obstacle in the C-space.
Probabilistic RoadMap (PRM) PlanningThe method proceeds in two phases: a learning phase and a q...
Robot Kinematics2D RotationRotation matrix from frame B to frame A:$${}^AR_B=\begin{bmatrix}\cos\theta&-\sin\theta\\sin\theta&\cos\theta\end{bmatrix}, ,, {}^AR_B\in SO(2)$$$SO(2)$ is 2D Special Orthogonal Group, which has these properties:
$det(R)=+1$
$R\cdot R^T=I$
2D Rigid MotionA poi...
Binary Search Tree (BST)The properties of BST
For each node, the values of its left descendent nodes are less than that of the current node.
For each node, the values of its right descendent nodes are more than that of the current node.
LeetCode 78. SubsetsLeetCode 78. https://leetcode.com/problems/subsets/
Code123456789101112131415161718class Solution {public: vector<vector<int>> subsets(vector<int>& nums) { vector<vector<int>> res; vector<int> out; subse...
LeetCode 200. Number of IslandsGiven an m x n 2D binary grid grid which represents a map of ‘1’s (land) and ‘0’s (water), return the number of islands.
An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid...
297. Serialize and Deserialize Binary TreeSerialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link to be reconstructed later in the same or another computer en...
Construct Binary Tree from Preorder and Inorder TraversalLeetCode 105. https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/
Hintpreorder -> [root] [left subtree] [right subtree] inorder -> [left subtree] [root] [right subtree]
In Preorder Traversal, the...
