Gradually Varied Extensions

  • Li M. Chen
Chapter

Abstract

In this chapter, we generalize the concept of gradually varied functions to gradually varied mappings. In  Chap. 3, we mainly discussed the function from a discrete space to {1, 2, ⋯ , n} or {A 1, A 2, ⋯ , A n }. This chapter focuses on gradually varied functions from a discrete space to another discrete space. For instance, a digital surface is defined as a mapping f from an n-dimensional digital manifold D to an m-dimensional grid space Σ m . A discrete surface is said to be gradually varied if two points in D, p and q, are adjacent, implying that f(p) and f(q) are adjacent in Σ m . In this Chapter, a basic extension theorem will be proven and some counter examples will be presented.

Keywords

Manifold Pyramid 

References

  1. 1.
    Agnarsson G, Chen L (2006) On the extension of vertex maps to graph homomorphisms. Discrete Math 306(17):2021–2030MathSciNetMATHCrossRefGoogle Scholar
  2. 2.
    Aho A, Hopcroft JE, Ullman JD (1974) The design and analysis of computer algorithms. Addison-Wesley, ReadingMATHGoogle Scholar
  3. 3.
    Bishop E, Bridges D (1985) Constructive analysis. Springer, Berlin/New YorkMATHCrossRefGoogle Scholar
  4. 4.
    Chen L (1990) The necessary and sufficient condition and the efficient algorithms for gradually varied fill. Chinese Sci Bull 35:10. Abstracts of SIAM Conference on Geometric design, Tempe, AZ, 1989Google Scholar
  5. 5.
    Chen L (1990) Gradually varied surfaces and gradually varied functions, in Chinese; In English 2005 CITR-TR 156, University of Auckland (It has been cited by IEEE Trans in PAMI and other publications)Google Scholar
  6. 6.
    Chen L (1991) The properties and the algorithms for gradually varied fill. Chinese J Comput 14:3Google Scholar
  7. 7.
    Chen L (1991) Gradually varied surfaces on digital manifold. Abstracts of second international conference on industrial and applied mathematics, Washington, DCGoogle Scholar
  8. 8.
    Chen L (1992) Random gradually varied surface fitting. Chinese Sci Bull 37:16. Abstracts of second SIAM conference on geometric design, Tempe, AZ, 1991Google Scholar
  9. 9.
    Chen L (1994) Gradually varied surface and its optimal uniform approximation. IS&T SPIE symposium on electronic imaging, SPIE Proceedings, vol 2182, Sen JoseGoogle Scholar
  10. 10.
    Chen L (1997) Generalized discrete object tracking algorithms and implementations. Vision geometry VI, Proceedings SPIE, vol 3168, San DiegoGoogle Scholar
  11. 11.
    Chen L (1999) Note on the discrete Jordan curve theorem. Vision Geometry VIII, Proceedings SPIE, vol 3811, DenverGoogle Scholar
  12. 12.
    Chen L (2004) Discrete surfaces and manifolds: a theory of digital-discrete geometry and topology. SP ComputingGoogle Scholar
  13. 13.
    Chen L, Zhang J (1993) Digital manifolds: a Intuitive Definition and Some Properties. The Proceedings of the second ACM/SIGGRAPH symposium on solid modeling and applications, Montreal, pp. 459–460, 1993Google Scholar
  14. 14.
    Cormen TH, Leiserson CE, Rivest RL (1993) Introduction to algorithms. MIT, Cambridge, MAGoogle Scholar
  15. 15.
    Harary F (1972) Graph theory. Addison-Wesley, ReadingGoogle Scholar
  16. 16.
    Mathematical Society of Japan (1993) Differential geometry of curves and surfaces. In: Encyclopedic of dictionary of mathematics, 2nd edn. MIT, pp 412–412, Cambridge, MAGoogle Scholar
  17. 17.
    Rosenfeld A (1986) ‘Continuous’ functions on digital pictures. Pattern Recognit Lett 4:177–184MATHCrossRefGoogle Scholar
  18. 18.
    Valentine FA (1945) A Lipschitz Condition Preserving Extension for a Vector Function. Am J Math 67(1):83–93MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2013

Authors and Affiliations

  • Li M. Chen
    • 1
  1. 1.University of the District of ColumbiaWashingtonUSA

Personalised recommendations