A new algorithm for finding faces in wireframes
Metadatos
Mostrar el registro completo del ítemcomunitat-uji-handle:10234/9
comunitat-uji-handle2:10234/7035
comunitat-uji-handle3:10234/8617
comunitat-uji-handle4:
INVESTIGACIONEste recurso está restringido
http://dx.doi.org/10.1016/j.cad.2009.11.008 |
Metadatos
Título
A new algorithm for finding faces in wireframesFecha de publicación
2010Editor
ElsevierISSN
104485Cita bibliográfica
CAD Computer Aided Design, 42, 4, p. 279-309Tipo de documento
info:eu-repo/semantics/articlePalabras clave / Materias
Resumen
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 ... [+]
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. © 2010. [-]
Derechos de acceso
http://rightsstatements.org/vocab/CNE/1.0/
info:eu-repo/semantics/restrictedAccess
info:eu-repo/semantics/restrictedAccess
Aparece en las colecciones
- EMC_Articles [814]