Show simple item record

contributor authorPinghai Yang
contributor authorKang Li
contributor authorXiaoping Qian
date accessioned2017-05-09T00:42:49Z
date available2017-05-09T00:42:49Z
date copyrightSeptember, 2011
date issued2011
identifier issn1530-9827
identifier otherJCISB6-26036#031003_1.pdf
identifier urihttp://yetl.yabesh.ir/yetl/handle/yetl/145605
description abstractGrowing use of massive scan data in various engineering applications has necessitated research on point-set surfaces. A point-set surface is a continuous surface, defined directly with a set of discrete points. This paper presents a new approach that extends our earlier work on slicing point-set surfaces into planar contours for rapid prototyping usage. This extended approach can decompose a point-set surface into slices with guaranteed topology. Such topological guarantee stems from the use of Morse theory based topological analysis of the slicing operation. The Morse function for slicing is a height function restricted to the point-set surface, an implicitly defined moving least-squares (MLS) surface. We introduce a Lagrangian multiplier formulation for critical point identification from the restricted surface. Integral lines are constructed to form Morse-Smale complex and the enhanced Reeb graph. This graph is then used to provide seed points for forming slicing contours, with the guarantee that the sliced model has the same topology as the input point-set surface. The extension of this approach to degenerate functions on point-set surface is also discussed.
publisherThe American Society of Mechanical Engineers (ASME)
titleTopologically Enhanced Slicing of MLS Surfaces
typeJournal Paper
journal volume11
journal issue3
journal titleJournal of Computing and Information Science in Engineering
identifier doi10.1115/1.3615683
journal fristpage31003
identifier eissn1530-9827
keywordsAlgorithms
keywordsFunctions
keywordsTopology
keywordsConstruction
keywordsIntersections
keywordsRapid prototyping AND Engineering systems and industry applications
treeJournal of Computing and Information Science in Engineering:;2011:;volume( 011 ):;issue: 003
contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record