• DocumentCode
    259014
  • Title

    Amplification Matrix Iteration Algorithm to Generate: The Hilbert-Peano Curve

  • Author

    Zheng-Wen Peng ; Xin Lu

  • Author_Institution
    Dept. of Math. & Comput. Sci., Nanchang Normal Univ., Nanchang, China
  • fYear
    2014
  • fDate
    26-27 July 2014
  • Firstpage
    131
  • Lastpage
    135
  • Abstract
    The methods to construct the Hilbert-Peano curve are recursive and non-recursive, methods of L-grammar system, different methods have different characteristics. In this document, from the prospective of non-recursive to analyze the characteristics of Hilbert-Peano curve, adopt the amplification curve characteristic matrix iteration algorithm constructs the Hilbert-Peano curve, compares the algorithm with the non-recursive algorithm in time-space-consuming. Prove that this algorithm has more advantages on large scale than L - system of non-recursive algorithm.
  • Keywords
    Hilbert spaces; computational geometry; iterative methods; matrix algebra; Hilbert-Peano curve; L-grammar system; amplification curve characteristic matrix iteration algorithm; time-space-consuming; Algorithm design and analysis; Filling; Fractals; Graphics; Next generation networking; Transmission line matrix methods; Hilbert-Peano; curve; fractal; iteration matrix;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Applications and Communications (SCAC), 2014 IEEE Symposium on
  • Conference_Location
    Weihai
  • Type

    conf

  • DOI
    10.1109/SCAC.2014.34
  • Filename
    6913182