Show simple item record

contributor authorHuang, Pu
contributor authorWang, Charlie C. L.
contributor authorChen, Yong
date accessioned2017-05-09T00:57:09Z
date available2017-05-09T00:57:09Z
date issued2013
identifier issn1530-9827
identifier otherjcis_13_2_021009.pdf
identifier urihttp://yetl.yabesh.ir/yetl/handle/yetl/151223
description abstractWe present a robust and efficient approach to directly slicing implicit solids. Different from prior slicing techniques that reconstruct contours on the slicing plane by tracing the topology of intersected line segments, which is actually not robust, we generate contours by a topology guaranteed contour extraction on binary images sampled from given solids and a subsequent contour simplification algorithm which has the topology preserved and the geometric error controlled. The resultant contours are free of selfintersection, topologically faithful to the given rregular solids and with shape error bounded. Therefore, correct objects can be fabricated from them by rapid prototyping. Moreover, since we do not need to generate the tessellated Brep of given solids, the memory cost our approach is low—only the binary image and the finest contours on one particular slicing plane need to be stored incore. Our method is general and can be applied to any implicit representations of solids.
publisherThe American Society of Mechanical Engineers (ASME)
titleIntersection Free and Topologically Faithful Slicing of Implicit Solid
typeJournal Paper
journal volume13
journal issue2
journal titleJournal of Computing and Information Science in Engineering
identifier doi10.1115/1.4024067
journal fristpage21009
journal lastpage21009
identifier eissn1530-9827
treeJournal of Computing and Information Science in Engineering:;2013:;volume( 013 ):;issue: 002
contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record