• DocumentCode
    3037260
  • Title

    An extension of Kim´s algorithm for Apollonius tenth problem

  • Author

    Hai-Yin Xu ; Xiongbing Fang

  • Author_Institution
    Sch. of Comput. Sci. & Technol., Huazhong Univ. of Sci. & Technol., Wuhan, China
  • Volume
    3
  • fYear
    2012
  • fDate
    25-27 May 2012
  • Firstpage
    114
  • Lastpage
    118
  • Abstract
    The Kim´s method is a computationally efficient and easy-to-code algorithm for the Apollonius tenth problem. However, the method does not analyze the positional relationship of three arbitrary circles and the desired Apollonius circles may be nonexistent. In this paper, we first classify common tangent lines of two circles according to the positional relationship of the two circles and judge the case the Apollonius circle does not exist. We further indicate which type of common tangent lines need to be computed and propose a geometric approach to calculate them. After that the common tangent lines are transformed into circles by inverse Möbius transformation and then the desired Apollonius circles are generated by using radius post-adjustment rule to dispose the circles. Experimental results show that our method can efficiently deal with arbitrary case of the Apollonius tenth problem.
  • Keywords
    computational geometry; Apollonius circles; Apollonius tenth problem; Kim algorithm; arbitrary circles; easy-to-code algorithm; geometric approach; inverse Möbius transformation; radius post-adjustment rule; tangent lines; Algorithm design and analysis; Computer science; Design automation; Educational institutions; Gold; Switches; Vectors; Apollonius circle; Möbius transformation; Skinning; Voronoi diagram;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Science and Automation Engineering (CSAE), 2012 IEEE International Conference on
  • Conference_Location
    Zhangjiajie
  • Print_ISBN
    978-1-4673-0088-9
  • Type

    conf

  • DOI
    10.1109/CSAE.2012.6272920
  • Filename
    6272920