DocumentCode :
3027315
Title :
Searching for the Centers of Spheres and Ellipsoids
Author :
Bhuiyan, Md Hasanuzzaman ; Ahmed, Syed Ishtiaque
Author_Institution :
Dept. of Comput. Sci. & Eng., Ahsanullah Univ. of Sci. & Technol., Dhaka, Bangladesh
fYear :
2009
fDate :
28-29 Dec. 2009
Firstpage :
461
Lastpage :
463
Abstract :
Biedl first posed the problem of finding the center of a circle, starting from a point on the boundary and using a limited number of operations. They presented an open problem for searching the center of an ellipse in their paper. Later, Burr solved that problem. However, in both of their works, they considered the searching space to be two dimensional. As a result, their strategies do well on a plane but in reality the searching space is three dimensional in most of the cases. In those cases we need an efficient strategy to find out the center of a sphere or in some cases, the center of an ellipsoid. In this paper, we have proposed different strategies for finding the centers of spheres and ellipsoids.
Keywords :
computational geometry; computational geometry; ellipsoids; online searching space; sphere; Computer science; Ellipsoids; Geometry; Orbital robotics; Radio transmitters; Robots; Telecommunication computing; Telecommunication control; Transceivers; computational geometry; ellipsoid.; online searching; sphere;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Advances in Computing, Control, & Telecommunication Technologies, 2009. ACT '09. International Conference on
Conference_Location :
Trivandrum, Kerala
Print_ISBN :
978-1-4244-5321-4
Electronic_ISBN :
978-0-7695-3915-7
Type :
conf
DOI :
10.1109/ACT.2009.119
Filename :
5376564
Link To Document :
بازگشت