Skip to main content

Similarity Measure Computation of Convex Polyhedra Revisited

  • Chapter
  • First Online:
Digital and Image Geometry

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2243))

Abstract

We study the computation of rotation-invariant similarity measures of convex polyhedra, based on Minkowski’s theory of mixed volumes. To compute the similarity measure, a (mixed) volume functional has to be minimized over a number of critical orientations of these polyhedra. These critical orientations are those relative con.gurations where faces and edges of the two polyhedra are as much as possible parallel. Two types of critical orientations exist for two polyhedra A and B. Type-1 critical orientations are those relative orientations where a face of B is parallel to a face of A, and an edge of B is parallel to a face of A, or vice versa. Type-2 critical orientations correspond to the case that three edges of A are parallel to three faces of B, or vice versa. It has been conjectured that to perform minimization of the volume functional, it is suficient to consider Type-1 critical orientations only. Here we present experimental proof showing this conjecture to be false.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bekker, H., and Roerdink, J. B. T. M. Calculating critical orientations of polyhedra for similarity measure evaluation. In Proc. 2nd Annual IASTED International Conference on Computer Graphics and Imaging, Palm Springs, California USA, Oct. 25–27(1999), pp. 106–111.

    Google Scholar 

  2. Heijmans, H. J. A. M., and Tuzikov, A. Similarity and symmetry measures for convex shapes using Minkowski addition. IEEE Trans. Patt. Anal. Mach. Intell. 20, 9 (1998), 980–993.

    Article  Google Scholar 

  3. Press, W. H., Flannery, B. P., Teukolsky, S. A., and Vetterling, W. T. Numerical Recipes, the Art of Scientific Computing. Cambr. Univ. Press, New York, 1986.

    Google Scholar 

  4. Schneider, R. Convex Bodies. The Brunn-Minkowski Theory. Cambridge University Press, 1993.

    Google Scholar 

  5. Tuzikov, A. V., Roerdink, J. B. T. M., and Heijmans, H. J. A. M. Similarity measures for convex polyhedra based on Minkowski addition. Pattern Recognition 33, 6 (2000), 979–995.

    Article  Google Scholar 

  6. Tuzikov, A. V., and Sheynin, S. A. Minkowski sum volume minimization for convex polyhedra. In Mathematical Morphology and its Applications to Image and Signal Processing, J. Goutsias, L. Vincent, and D. S. Bloomberg, Eds. Kluwer Acad. Publ., Dordrecht, 2000, pp. 33–40.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Roerdink, J.B.T.M., Bekker, H. (2001). Similarity Measure Computation of Convex Polyhedra Revisited. In: Bertrand, G., Imiya, A., Klette, R. (eds) Digital and Image Geometry. Lecture Notes in Computer Science, vol 2243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45576-0_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-45576-0_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43079-7

  • Online ISBN: 978-3-540-45576-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics