Show simple item record

contributor authorCharlie C. Wang
contributor authorKai Tang
date accessioned2017-05-09T00:15:33Z
date available2017-05-09T00:15:33Z
date copyrightDecember, 2005
date issued2005
identifier issn1530-9827
identifier otherJCISB6-25960#291_1.pdf
identifier urihttp://yetl.yabesh.ir/yetl/handle/yetl/131454
description abstractWe investigate how to define a triangulated ruled surface interpolating two polygonal directrices that will meet a variety of optimization objectives which originate from many CAD/CAM and geometric modeling applications. This optimal triangulation problem is formulated as a combinatorial search problem whose search space however has the size tightly factorial to the numbers of points on the two directrices. To tackle this bound, we introduce a novel computational tool called multilayer directed graph and establish an equivalence between the optimal triangulation and the single-source shortest path problem on the graph. Well known graph search algorithms such as the Dijkstra’s are then employed to solve the single-source shortest path problem, which effectively solves the optimal triangulation problem in O(mn) time, where n and m are the numbers of vertices on the two directrices respectively. Numerous experimental examples are provided to demonstrate the usefulness of the proposed optimal triangulation problem in a variety of engineering applications.
publisherThe American Society of Mechanical Engineers (ASME)
titleOptimal Boundary Triangulations of an Interpolating Ruled Surface
typeJournal Paper
journal volume5
journal issue4
journal titleJournal of Computing and Information Science in Engineering
identifier doi10.1115/1.2052850
journal fristpage291
journal lastpage301
identifier eissn1530-9827
treeJournal of Computing and Information Science in Engineering:;2005:;volume( 005 ):;issue: 004
contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record