2342 search results - page 92 / 469 » Sublinear geometric algorithms |
136
click to vote
DIALM
2008
ACM
15 years 2 months ago
2008
ACM
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 ...
MICCAI
2004
Springer
16 years 1 months ago
2004
Springer
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....
121
click to vote
SODA
1992
ACM
15 years 1 months ago
1992
ACM
We present several applications in computational geometry of Megiddo's parametric searching technique. These applications include: (1) Finding the minimum Hausdorff distance ...
140
Voted
SIAMIS
2010
14 years 11 months ago
2010
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...
144
click to vote
DIS
2007
Springer
15 years 4 months ago
2007
Springer
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...