Gift-wrapping based preimage computation algorithm

详细信息    查看全文

• 作者：Yan Gerard ; David Coeurjolly ; Fabien Feschet
• 关键词：Digital geometry ; Convex hull ; Gift-wrapping ; Visibility cone ; Chords set
• 刊名：Pattern Recognition
• 出版年：2009
• 出版时间：October 2009
• 年：2009
• 卷：42
• 期：10
• 页码：2255-2264
• 全文大小：783 K

文摘

Based on a classical convex hull algorithm called gift-wrapping, the purpose of the paper is to provide a new algorithm for computing the vertices of a polytope called preimage—roughly the set of naive digital planes containing a finite subset S of . The vertices of the upper hemisphere, the ones of the lower hemisphere and at last the equatorial vertices are computed independently. The principle of the algorithm is based on duality and especially on the fact that the vertices of the preimage correspond to faces of the input set S or of its chords set SS{(0,0,1)}. It allows to go from one vertex to another by gift-wrapping until the whole region of interest has been explored.