返回
Gift-wrapping based preimage computation algorithm
DOI:10.1016/j.patcog.2008.10.003.png)
摘要
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.
Keyword:
Digital geometry
Convex hull
Gift-wrapping
Visibility cone
Chords set
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.4W
被引数:
6.1W
机构
引用论文
Sharpening the Scythe of Technological Change: Socio-Technical Challenges of Autonomous and Adaptive Cyber-Physical Systems
Designs
IF0

