Sciweavers

174 search results - page 6 / 35
» Algorithms for center and Tverberg points
Sort
View
COMGEO
2010
ACM
13 years 7 months ago
Approximation algorithm for the kinetic robust K-center problem
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the k-center problem. We are given a discrete p...
Sorelle A. Friedler, David M. Mount
IBPRIA
2005
Springer
14 years 27 days ago
An Algorithm for the Detection of Multiple Concentric Circles
This paper presents a method for the detection of multiple concentric circles which is based on the Hough Transform (HT). In order to reduce time and memory space the concentric ci...
Margarida Silveira
CORR
2011
Springer
184views Education» more  CORR 2011»
13 years 2 months ago
Finding Shortest Path for Developed Cognitive Map Using Medial Axis
— this paper presents an enhancement of the medial axis algorithm to be used for finding the optimal shortest path for developed cognitive map. The cognitive map has been develop...
Hazim A. Farhan, Hussein H. Owaied, Suhaib I. Al-G...
APIN
1998
132views more  APIN 1998»
13 years 7 months ago
Evolution-Based Methods for Selecting Point Data for Object Localization: Applications to Computer-Assisted Surgery
Object localization has applications in many areas of engineering and science. The goal is to spatially locate an arbitrarily-shaped object. In many applications, it is desirable ...
Shumeet Baluja, David Simon
FSTTCS
2006
Springer
13 years 11 months ago
Computing a Center-Transversal Line
A center-transversal line for two finite point sets in R3 is a line with the property that any closed halfspace that contains it also contains at least one third of each point set...
Pankaj K. Agarwal, Sergio Cabello, Joan Antoni Sel...