Measures for Surface Comparison on Unstructured Grids with Different Density

  • Natalia Dyshkant
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6607)


We consider the problem of surface comparison given as spatial point clouds that can be explicitly projected onto a plane. This problem can be reduced to comparison of mesh functions of two variables given on different grids. A general case when both grids are unstructured and have different density is of interest. A measure to compare such functions that allow to estimate difference on areas with nodes from both grids and an algorithm to compute it are proposed. Estimation for computational complexity of the algorithm is presented. Computing experiments on real data (3d face models) were carried out.


discrete surface model metrics for surface comparison unstructured grid Delaunay triangulation minimum spanning tree 3d face image 


  1. 1.
    Artec Group — 3D Scanning Technologies,
  2. 2.
    Kolesov, A., Pavlova, O.: Surfer Package  — Processing and Visualization of 2d Functions (in Russian). Computer Press (1999)Google Scholar
  3. 3.
    Dyshkant, N.: Disparity Measure Construction for Comparison of 3D Objects’ Surfaces. In: Proceedings of the  2nd International Workshop on Image Mining, Theory and Applications (IMTA-2-2009), pp. 43–52. INSTICC Press, Lisbon (2009)Google Scholar
  4. 4.
    Dzaraev, C., Persin, L., Porochin, A.: Using of 3d Scanners for Diagnostics of Dentoalveolar Anomalies (in Russian). In: Theoretical and Practical Forum ”Dental-Review”, Moscow (2010)Google Scholar
  5. 5.
    Gruen, A., Akca, D.: Squares 3D Surface and Curve Matching. ISPRS Journal of Photogrammetry and Remote Sensing 59, 151–174 (2005)CrossRefGoogle Scholar
  6. 6.
    Cignoni, P., Roccini, C., Scopigno, R.: Metro: measuring error on simplified surfaces. In: Computer Graphics Forum, vol. 17, pp. 167–174. Blackwell Publishers, Malden (1998)Google Scholar
  7. 7.
    Fan, T., Medioni, G., Nevatia, R.: Recognizing 3D objects using surface descriptions. IEEE PAMI 11(11), 1140–1157 (1989)CrossRefGoogle Scholar
  8. 8.
    Schenk, T.: Digital Photogrammetry. Terra-Science, Laurelville (1999)Google Scholar
  9. 9.
    Skvortsov, A.: A survey of algorithms for constructing a Delaunay triangulation (in Russian). In: Numerical Methods and Programming, vol. 3. RCC MSU Press (2002)Google Scholar
  10. 10.
    Mestetskiy, L.: Continuous Morphology of Binary Images: Figures, Skeletons and Circulars (in Russian). PHYSMATLIT Press, Moscow (2009)Google Scholar
  11. 11.
    Mestetskiy, L., Tsarik, E.: Delaunay triangulation: recursion without space division of vertices (in Russian). In: 14th International Conference on Computer Graphics and Vision GraphiCon 2004, pp. 267–270. CMC MSU Press, Moscow (2004)Google Scholar
  12. 12.
    Preparata, F., Shamos, M.: Computational Geometry: An Introduction. Springer, Heidelberg (1985)CrossRefzbMATHGoogle Scholar
  13. 13.
    Mestetskiy, L., Tsarik, E.: Merging od Unseparated Delaunay Triangulations. In: Complex Systems: Processing, Modelling and Optimization Od Information, vol. 2, pp. 216–231. Tver State University, Tver (2004)Google Scholar
  14. 14.
    Dyshkant, N., Mestetskiy, L.: Comparison of One-Sheet Surfaces Acquired by 3D Scanning (in Russian). In: 18th International Conference on Computer Graphics and Vision GraphiCon 2008, pp. 270–277. CMC MSU Press, Moscow (2008)Google Scholar
  15. 15.
    Cheriton, D., Tarjan, R.: Finding minimum spanning trees. SIAM J. Comput. 5(4), 724–742 (1976)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Natalia Dyshkant
    • 1
  1. 1.Faculty of Computational Mathematics and Cybernetics, Leninskie gory, CMC MSULomonosov Moscow State UniversityMoscowRussian Federation

Personalised recommendations