Defining cost functions and profitability measures for digraphs associated with raster DEMs

  • Pascal Matsakis
  • Julien Gadiou
  • Jacky Desachy
Poster Session A: Color & Texture, Enhancement, Image Analysis & Pattern Recognition, Segmentation
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1310)


With a raster Digital Elevation Model, it is usual to associate a directed graph. Firstly, the problem of defining cost functions for such digraphs is discussed in a general and formal framework, and a particularly simple and natural way to tackle this problem is proposed. Secondly, the notion of profitability, which is commonly linked with the notion of cost, is put forward. Thus, profitability measures are introduced. In particular, the profitability of a point according to a region is defined. Finally, it is shown that profitability measures and cost functions provide complementary information.


DEMs directed graphs cost functions problems of optimal paths 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Ahu93]
    Ahuja, R.K., T.L. Magnanti, and J.B. Orlin, Network flows, Prentice Hall, 1993.Google Scholar
  2. [Be158]
    Bellman, R., “On a toutin problem”, Quaterly of Applied Math., 16(1), pp.87–90, 1958.Google Scholar
  3. [Bor84]
    Borgefors, G., “Distance transformations in arbitrary dimensions”, CVGIP 27, pp.321–345, 1984.Google Scholar
  4. [Bor86]
    Borgefors, G.,“Distance transformations in digital images”, CVGIP 34, pp.344–371, 1986.Google Scholar
  5. [Dub95]
    Dubois, N., F. Semet, “Estimation and determination of shortest path length in a road network with obstacles”, European Journal of Operational Research 83, pp.105–116, 1995.Google Scholar
  6. [Gon84]
    Gondran, M., and M. Minoux, Graphs and Algorithms, Wiley, Chichester, 1984.Google Scholar
  7. [Kre94]
    van Kreveld, M., “On Quality Paths on Polyhedral Terrains”, IGIS'94, LNCS 884, Springer-Verlag, pp. 113–122, 1994.Google Scholar
  8. [Mit91]
    Mitchell, J.S.B., C.H. Papadimitriou, “The weighted region problem: finding shortest paths through a weighted planar subdivision”, Journal of ACM 38(11), pp. 18–73, 1991.Google Scholar
  9. [Pri94]
    Prins, C., Algorithmes de graphes, Eyrolles, 1994.Google Scholar
  10. [Ros66]
    Rosenfeld, A., and J.L. Pfaltz, “Sequential operations in digital picture processing”, Journal of ACM 13(4), pp.471–494, 1966.Google Scholar
  11. [Zha93]
    Zhan, C., S. Menon, and P. Gao, “A Directional Path Distance Model for Raster Distance Mapping”, COSIT'93, LNCS 716, Springer-Verlag, pp.434–443, 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Pascal Matsakis
    • 1
    • 2
  • Julien Gadiou
    • 1
  • Jacky Desachy
    • 1
  1. 1.Université Paul Sabatier - IRITToulouse CedexFrance
  2. 2.CRIL Ingenierie - Groupe CoritecToulouseFrance

Personalised recommendations