期刊
COMPUTER-AIDED DESIGN
卷 42, 期 4, 页码 279-309出版社
ELSEVIER SCI LTD
DOI: 10.1016/j.cad.2009.11.008
关键词
Wireframe; Face identification; Line-drawing interpretation; Visual perception
资金
- Japan Society for the Promotion of Science [P03717]
- Ramon y Cajal Scholarship Programme
- Spanish Ministry of Science and Education
- European Union [DP12007-66755-C02-01]
The problem of identifying the topology implied by wireframe drawings of polyhedral objects requires the identification of face loops, loops of edges which correspond to a face in the object the drawing portrays. In this paper, we survey the advantages and limitations of known approaches, and present and discuss test results which illustrate the successes and failures of a currently popular approach based on Dijkstra's Algorithm. We conclude that the root cause of many failure cases is that the underlying algorithm assumes that the cost of traversing an edge is fixed. We propose a new polynomial-order algorithm for finding faces in wireframes. This algorithm could be adapted to any graph-theoretical least-cost circuit problem where the cost of traversing an edge is not fixed but context-dependent. (C) 2010 Published by Elsevier Ltd
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据