A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
Abstract. Often in neurosurgical planning a dual spin echo acquisition is performed that yields proton density (PD) and T2-weighted images to evaluate edema near a tumor or lesion....
Maxime Descoteaux, D. Louis Collins, Kaleem Siddiq...
We present several applications in computational geometry of Megiddo's parametric searching technique. These applications include: (1) Finding the minimum Hausdorff distance ...
Abstract. In this work, we present an approach to jointly segment a rigid object in a two-dimensional (2D) image and estimate its three-dimensional (3D) pose, using the knowledge o...
Samuel Dambreville, Romeil Sandhu, Anthony J. Yezz...
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...