๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Fast randomized algorithm for center-detection

โœ Scribed by Kuo-Liang Chung; Yong-Huai Huang; Jyun-Pin Wang; Ting-Chin Chang; Hong-Yuan Mark Liao

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
851 KB
Volume
43
Category
Article
ISSN
0031-3203

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An Efficient Randomized Algorithm for De
An Efficient Randomized Algorithm for Detecting Circles
โœ Teh-Chuan Chen; Kuo-Liang Chung ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 444 KB

Detecting circles from a digital image is very important in shape recognition. In this paper, an efficient randomized algorithm (RCD) for detecting circles is presented, which is not based on the Hough transform (HT). Instead of using an accumulator for saving the information of the related paramete

A New Randomized Algorithm for Detecting
A New Randomized Algorithm for Detecting Lines
โœ Teh-Chuan Chen; Kuo-Liang Chung ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 510 KB

ine detection is very important in image processing. In this paper, a new randomized algorithm for detecting lines is presented. The proposed algorithm is quite different from the previous parameter-based methods which vote on the parameter space. Our proposed novel algorithm does not need extra sto

Fast, approximate algorithm for detectio
Fast, approximate algorithm for detection of solvent-inaccessible atoms
โœ Weiser, J๏ฟฝrg; Shenkin, Peter S.; Still, W. Clark ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 207 KB

Up to about half of the atoms in biopolymers are inaccessible to solvents. If such atoms can be rapidly identified, time can be saved in the subsequent computation of atomic surface areas. A quick, approximate method, ลฝ . termed buried atom elimination BAE , was developed for the detection of such a

A fast algorithm for the alpha-connected
A fast algorithm for the alpha-connected two-center decision problem
โœ Po-Hsueh Huang; Yin Te Tsai; Chuan Yi Tang ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 90 KB

This paper considers the problem of determining whether a set of points can be covered by two discs with centers p and q and common radius r, such that the ratio d(p, q)/r is bounded below by a specified constant, ฮฑ. An O(n 2 log 2 n) algorithm for solving this problem is also presented.

A fast impingement detection algorithm f
A fast impingement detection algorithm for computer-aided orthopedic surgery
โœ Qingmao Hu; Ulrich Langlotz; Jeff Lawrence; Frank Langlotz; Lutz-Peter Nolte ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 272 KB

## Objective: For simulation of computer-aided orthopedic interventions, the detection of impingement between parts of the patient's anatomy and/or implants is often of key importance. the impingement (collision) detection methods used in the existing literature seem to be unsuitable for two reason