Shape Representation Using Trihedral Mesh Projections

  • Lluís Ros
  • Kokichi Sugihara
  • Federico Thomas
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2301)

Abstract

This paper explores the possibility of approximating a surface by a trihedral polygonal mesh plus some triangles at strategic places. The presented approximation has several attractive properties. It turns out that the Z-coordinates of the vertices are completely governed by the Z-coordinates assigned to four selected ones. This allows describing the spatial polygonal mesh with just its 2D projection plus the heights of four vertices. As a consequence, these projections essentially capture the “spatial meaning” of the given surface, in the sense that, whatever spatial interpretations are drawn from them, they all exhibit the same shape, up to some trivial ambiguities.

Keywords

Tangent Plane Terminal Node Polygonal Mesh Spatial Shape Height Propagation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    C. Boor. Cutting corners always works. Computer Aided Geometric Design, 4:125–131, 1987.MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    D. Fox and K. I. Joy. On polyhedral approximations to a sphere. In IEEE Int. Conf. on Visualization, pages 426–432, 1998.Google Scholar
  3. 3.
    P. Heckbert and M. Garland. Survey of polygonal surface simplification algorithms. In Multiresolution Surface Modeling Course SIGGRAPH’97, May 1997. Available at http://www.cs.cmu.edu/~ph.
  4. 4.
    P. Jiménez and C. Torras. An efficient algorithm for searching implicit AND/OR graphs with cycles. Artificial Intelligence, 124:1–30, 2000.MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    L. Ros. A Kinematic-Geometric Approach to Spatial Interpretation of Line Drawings. PhD thesis, Polytechnic University of Catalonia, May 2000. Available at http://www-iri.upc.es/people/ros.
  6. 6.
    L. Ros and F. Thomas. Overcoming superstrictness in line drawing interpretation. IEEE Trans. on Pattern Analysis and Machine Intelligence. Accepted for publication. Preliminary scheduled for Vol 24, No. 4, April 2002.Google Scholar
  7. 7.
    W. Seibold and G. Wyvill. Towards an understanding of surfaces through polygonization. In IEEE Int. Conf. on Visualization, pages 416–425, 1998.Google Scholar
  8. 8.
    K. Sugihara. An algebraic approach to shape-from-image problems. Artificial Intelligence, 23:59–95, 1984.MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    K. Sugihara. Machine Interpretation of Line Drawings. The MIT Press, 1986.Google Scholar
  10. 10.
    K. Sugihara. Resolvable representation of polyhedra. Discrete and Computational Geometry, 21(2):243–255, 1999.MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    W. Whiteley. Some matroids on hypergraphs with applications to scene analysis and geometry. Discrete and Computational Geometry, 4:75–95, 1988.MathSciNetGoogle Scholar
  12. 12.
    W. Whiteley. How to design or describe a polyhedron. Journal of Intelligent and Robotic Systems, 11:135–160, 1994.MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Lluís Ros
    • 1
  • Kokichi Sugihara
    • 2
  • Federico Thomas
    • 1
  1. 1.CSIC-UPCInstitut de Robòtica i Informàtica IndustrialBarcelonaSpain
  2. 2.Dept. of Mathematical Engineering and Information PhysicsUniversity of TokyoBunkyo-ku, TokyoJapan

Personalised recommendations