.png){kind=icon}
.png){kind=icon}
Return
Gift-wrapping based preimage computation algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2008.10.003.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 Z(3). 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 S circle minus S boolean OR ((0,0,1)). It allows to go from one vertex to another by gift-wrapping until the whole region of interest has been explored. (c) 2008 Elsevier Ltd. All rights reserved.
Keywords:
Digital geometry
Convex hull
Gift-wrapping
Visibility cone
Chords set
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W