.png){kind=icon}
Return
A new algorithm for finding faces in wireframes
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cad.2009.11.008.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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
Keywords:
Wireframe
Face identification
Line-drawing interpretation
Visual perception
Journal
C
IF:
3.1
Papers:
3.1K
Citations:
6.4K
Organization
Cited Papers
ShareSaveShareSave
ShareSaveShareSaveShareSaveHow Will the Improvements of Electricity Supply Quality in Poor Regions Reduce the Regional Economic Gaps? A Case Study of China.png)
Energies
OAAI
EnergiesIF0
OAAIShareSaveShareSave
View more