0

Full Content is available to subscribers

Subscribe/Learn More  >

Quasi-Optimal Mesh Segmentation Via Region Growing/Merging

[+] Author Affiliations
Tomohiro Mizoguchi, Hiroaki Date, Satoshi Kanai, Takeshi Kishinami

Hokkaido University, Sapporo, Hokkaido, Japan

Paper No. DETC2007-35171, pp. 547-556; 10 pages
doi:10.1115/DETC2007-35171
From:
  • ASME 2007 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference
  • Volume 6: 33rd Design Automation Conference, Parts A and B
  • Las Vegas, Nevada, USA, September 4–7, 2007
  • Conference Sponsors: Design Engineering Division and Computers and Information in Engineering Division
  • ISBN: 0-7918-4807-8 | eISBN: 0-7918-3806-4
  • Copyright © 2007 by ASME

abstract

Recently meshes of engineering objects are easily acquired by 3D laser or high energy X-ray CT scanning systems, and these meshes are widely used in product developments. To effectively use scanned meshes in engineering applications, such as inspection, CAD model reconstruction, and convergent-type CAE, we need to segment meshes and extract desirable regions and their approximating surfaces as preprocessing. Engineering objects are commonly represented as a set of analytic surfaces, such as planes, cylinders, spheres, cones, and tori. Therefore, the mesh surface of engineering objects needs to be approximated as a set of analytic surfaces. Moreover, a mesh surface should be approximated with a minimum number of analytic surfaces and their approximating error should be minimized as a result of segmentation. We call the segmentation that satisfies these two conditions the optimal segmentation as proposed in [1]. However, optimal segmentation algorithms need a long calculation time. Today’s high energy X-ray CT scanning systems generate large meshes with millions of triangles from objects including hundreds of regions. Thus, computationally expensive algorithms, such as [1], cannot be directly applied to these large and complex meshes from the aspect of efficiency. In this paper we propose an efficient new quasi-optimal mesh segmentation algorithm via region growing and region merging. First, our algorithm robustly and accurately estimates mesh principal curvatures using the local surface fitting by two-pass algorithm. Second, it uses the curvatures to appropriately create seed regions, and then it quickly grows each seed region and extracts grown regions and their approximating analytic surfaces from a whole mesh. Finally, our region merging algorithm efficiently merges extracted regions in order to minimize the number of regions while keeping the user specified tolerances of the surface fitting, and it results in quasi-optimal segmentation. We demonstrate the performance of our algorithm with scanned meshes acquired from real engineering objects by 3D laser and X-ray CT scanning systems.

Copyright © 2007 by ASME

Figures

Tables

Interactive Graphics

Video

Country-Specific Mortality and Growth Failure in Infancy and Yound Children and Association With Material Stature

Use interactive graphics and maps to view and sort country-specific infant and early dhildhood mortality and growth failure data and their association with maternal

NOTE:
Citing articles are presented as examples only. In non-demo SCM6 implementation, integration with CrossRef’s "Cited By" API will populate this tab (http://www.crossref.org/citedby.html).

Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In