检索结果-内蒙古大学图书馆

Isosurface-based marching cube algorithm for smooth geometric topology optimization within adaptive octree SBFE approach

引用

ENGINEERING ANALYSIS WITH BOUNDARY ELEMENTS 2024年 168卷

作者： Su, Rut Boonlertnirun, Piyawat Tangaramvong, Sawekchai Song, Chongmin Chulalongkorn Univ Ctr Excellence Appl Mech & Struct Dept Civil Engn Bangkok 10330 Thailand Univ New South Wales Ctr Infrastructure Engn & Safety Sch Civil & Environm Engn Sydney NSW 2052 Australia

In the era of Industry 4.0, the prominence of 3D printing as a pivotal manufacturing technology has greatly expanded, particularly within the domain of additive manufacturing (AM). Among the thriving research applications tailored for integration with AM, topology optimization (TO) has emerged as a resounding success. Given the prerequisite of TO for high-resolution meshing to ensure visual clarity in result depiction, researchers have been consistently driven to develop advanced techniques to refine optimal designs, thus elevating the challenge and popularity within this research realm. This paper presents a novel approach integrating an adaptive image-based octree mesh scaled boundary finite element (SBFE) framework with an evolutionary methodology that can effectively address the persistent challenges inherent to TO. A novel hierarchical SBFE mesh analysis not only facilitates efficient and precise TO but also substantially reduces computational resource demands. Furthermore, the pre-conditioned conjugated gradient (PCG) method is adopted to process practical- scale problems, minimizing computer memory resources. Additionally, the proposed work incorporates a post-processing technique utilizing the isosurface function based on a marching cube algorithm, thereby smoothing the boundaries of optimal results. Consequently, this research extends the horizons of design possibilities, particularly in the creation of intricate 3D structures, which can be seamlessly realized through additive manufacturing and 3D printing.

关键词： Topology optimization Scaled boundary finite element method Pre-conditioned conjugate gradient Image-based processing marching cube algorithm Bi-directional evolutionary structural optimization

来源：评论

学校读者我要写书评

暂无评论

Construction of polyhedral finite element meshes based upon marching cube algorithm

引用

ADVANCES IN ENGINEERING SOFTWARE 2019年第0期128卷 98-112页

作者： Kim, Sangjun Sohn, Dongwoo Im, Seyoung Korea Adv Inst Sci & Technol Dept Mech Engn 291 Daehak Ro Daejeon 34141 South Korea Korea Maritime & Ocean Univ Div Mech Engn Coll Engn 727 Taejong Ro Busan 49112 South Korea

Hexahedral meshes that exhibit the superiority in terms of solution accuracy and convergence rate are preferred to other types of meshes in the finite element analysis. However, the construction of the hexahedral meshes for complex geometries is still considered troublesome due to their poor geometric adaptability. This paper presents an efficient grid-based scheme to automatically generate polyhedral meshes including the hexahedral elements, and thus to provide hexahedral-dominant meshes for three-dimensional geometry with complex shapes. On the basis of the marching cube algorithm with a background grid composed of a regular arrangement of cubes, surface topologies for the background cubes are defined to represent the three-dimensional boundaries of a given domain. Then, in order to generate a three-dimensional finite element mesh, the surface topologies of the marching cube algorithm are systematically expanded to polyhedral volume topologies. Meanwhile, a topology ambiguity problem inherent in the marching cube algorithm is effectively resolved to generate an appropriate polyhedral mesh even for an arbitrary complex geometry. Several examples including biostructure modeling demonstrate that the proposed mesh generation scheme can easily discretize complex three-dimensional domains with hexahedral-dominant meshes, which are composed of the polyhedral elements near the domain boundaries and the hexahedral elements that come from the background cubes inside the domains. Furthermore, to show the applicability and effectiveness of polyhedral meshes in the finite element analysis, some structural analyses are performed using the smoothed finite element method that can be straightforwardly adapted to polyhedral elements of arbitrary shape.

关键词： Polyhedral finite element Mesh generation marching cube algorithm Geometric adaptability Smoothed finite element method

来源：评论

学校读者我要写书评

暂无评论

AI-weigh Live Tracking of Fruits and Vegetables

AI-weigh Live Tracking of Fruits and Vegetables

引用

2023 IEEE Global Conference on Information Technologies and Communications, GCITC 2023

作者： Kumar, S. Dinesh Chowdary, Abburu Nayan Thejdeep, Dwaraka Vivek, C. Dinesh, D. Sai Venkatesh, Karnam Panimalar Engineering College Department of Artificial Intelligence and Data Science Chennai India Panimalar Engineering College Department of Electronics and Communication Engineering Chennai India

ISBN: (纸本)9798350308167

Weight prediction of vegetables by analyzing without using a weight machine instead of using 3D live capturing AI powered trained model by combining (Mask R-CNN) algorithm with marching cube algorithm, voxelization and computer vision technique to find weight. Leveraging advanced computer vision techniques, including the Mask R-CNN algorithm, marching cube algorithm, voxelization, and deep learning models, the study introduces a nonintrusive and efficient method for weight prediction based on 3D representations. The methodology begins with dataset creation, comprising images of vegetables alongside known weights. Mask R-CNN is used for exact object identification, segmentation and to delivering essential ROI information. To build detailed 3D representations of veggies, we use voxelization, which turns segmented 2D ROIs into 3D voxel grids. The marching cube algorithm is then used to convert voxel data into polygonal meshes, allowing for the estimation of surface area, which is an important aspect in measuring vegetable weight. We train a specific weight estimation model using a large dataset that incorporates calculated surface area as a feature. When presented with new vegetable photos, the system performs object identification, voxelization, mesh construction, and surface area estimate. The estimated surface area is utilized to generate an accurate approximation of the vegetable's weight. Continuous validation and modification guarantee that the system is accurate and resilient, taking into consideration real-world elements like vegetable density, wetness, and shape fluctuations. This study proposes a novel, non-intrusive approach for reliably forecasting vegetable weights, with possible uses in agricultural, retail, and food ***: This research describes a novel method for determining vegetable weight that does not rely on existing physical weight machines. Vegetables are typically weighed using such machines, which can be sluggish and inefficient,

关键词： 3D Stereo Cameras Density Values and computer vision technique marching cube algorithm Mask R-CNN voxelization

来源：评论

学校读者我要写书评

暂无评论

A "Group marching cube" (GMC) algorithm for Speeding up the marching cube algorithm

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2011年第6期E94D卷 1289-1298页

作者： Chen, Lih-Shyang Lay, Young-Jinn Huang, Je-Bin Chen, Yan-De Chang, Ku-Yaw Chen, Shao-Jer Natl Cheng Kung Univ Dept Elect Engn Tainan 70101 Taiwan Da Yeh Univ Dept Comp Sci & Informat Engn Changhua Cty Taiwan Buddhist Tzu Chi Gen Hosp Chiayi Cty Taiwan

Although the marching cube (MC) algorithm is very popular for displaying images of voxel-based objects, its slow surface extraction process is usually considered to be one of its major disadvantages. It was pointed out that for the original MC algorithm, we can limit vertex calculations to once per vertex to speed up the surface extraction process, however, it did not mention how this process could be done efficiently. Neither was the reuse of these MC vertices looked into seriously in the literature. In this paper, we propose a "Group marching cube" (GMC) algorithm, to reduce the time needed for the vertex identification process, which is part of the surface extraction process. Since most of the triangle-vertices of an iso-surface are shared by many MC triangles, the vertex identification process can avoid the duplication of the vertices in the vertex array of the resultant triangle data. The MC algorithm is usually done through a hash table mechanism proposed in the literature and used by many software systems. Our proposed GMC algorithm considers a group of voxels simultaneously for the application of the MC algorithm to explore interesting features of the original MC algorithm that have not been discussed in the literature. Based on our experiments, for an object with more than 1 million vertices, the GMC algorithm is 3 to more than 10 times faster than the algorithm using a hash table. Another significant advantage of GMC is its compatibility with other algorithms that accelerate the MC algorithm. Together, the overall performance of the original MC algorithm is promoted even further.

关键词： marching cube algorithm iso-surface detection surface rendering speed-up interactive applications

来源：评论

学校读者我要写书评

暂无评论

Direct 3D mask modeling for nonplanar workpieces in microabrasive jet machining

引用

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY 2012年第1-4期58卷 175-186页

作者： Kim, Ho-chan Lee, In Hwan Ko, Tae Jo Andong Natl Univ Dept Mech & Automot Engn Andong South Korea Chungbuk Natl Univ Sch Mech Engn Chungbuk South Korea Youngnam Univ Sch Mech Engn Youngnam South Korea

Recently, a new microengraving technology, microabrasive jet machining, has been studied as a machining technology for highly brittle materials. The technology implements the machining by using an abrasive jet and it uses mask structures to achieve microscale geometrical accuracy. The mask structure selectively blocks the abrasive jet at the portions of the surface that are not to be machined. Modeling and fabrication of the mask structure are thus key processes in microabrasive jet machining. Microstereolithography is believed to be a better means of mask fabrication for general planar and nonplanar workpieces. However, it is not easy to model a precise 3D mask structure from a given pattern image. Because of inconsistencies between the computer-aided design (CAD) model and the actual workpiece, mask structures modeled from workpiece CAD models often fall off. We therefore propose an automated modeling algorithm for the corresponding 3D nonplanar mask structure by using measured geometry directly. The algorithm takes the workpiece geometry as section images acquired from computer tomography and generates the CAD mask model directly from the section and mask images. Application software was developed to verify the algorithm and was tested by verification and actual cases.

关键词： Microabrasive jet machining Microstereolithography Direct mask modeling Voxel marching cube algorithm Z-map

来源：评论

学校读者我要写书评

暂无评论

A novel scheme to generate meshes with hexahedral elements and poly-pyramid elements: The carving technique

引用

COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING 2012年第Jan.1期201卷 208-227页

作者： Sohn, Dongwoo Cho, Young-Sam Im, Seyoung Wonkwang Univ Coll Engn Div Mech & Automot Engn Iksan Si 570749 Daejeon South Korea Korea Adv Inst Sci & Technol KAIST Dept Mech Engn Taejon 305701 South Korea

A novel scheme for three-dimensional mesh generation, termed the carving technique, is proposed with the aid of poly-pyramid elements. Soaking the geometry information of a given model into a regular reference mesh with brick elements, the reference mesh is trimmed by the surface of the model using the marching cube algorithm. The trimmed elements are reconstructed by the proposed elements, which here are termed the poly-pyramid elements. Therefore, the finite element mesh is automatically generated from the surface information. Shape functions of the poly-pyramid elements are constructed by moving least square (MLS) approximation. Numerical results are presented to examine the performance of the poly-pyramid elements and to demonstrate the effectiveness of the proposed scheme. (C) 2011 Elsevier B.V. All rights reserved.

关键词： Mesh generation Poly-pyramid elements Moving least square (MLS)-based finite elements marching cube algorithm

来源：评论

学校读者我要写书评

暂无评论

Computer-aided Porous Scaffold Design for Tissue Engineering Using Triply Periodic Minimal Surfaces

引用

INTERNATIONAL JOURNAL OF PRECISION ENGINEERING AND MANUFACTURING 2011年第1期12卷 61-71页

作者： Yoo, Dong-Jin Daejin Univ Dept Comp Aided Mech Design Engn Pocheon Si 487711 Kyeonggi Do South Korea

Recently, computer aided geometric design of triply periodic minimal surfaces (TPMS) has received considerable attention in the area of computer aided nano design on account of its ability to efficiently construct a large number of complex surfaces. In this paper, a TPMS is described with periodic surfaces composed of simple trigonometric functions, thus enabling easy generation of TPMS for use in various mechanical, chemical, and physical applications. We first describe a TPMS with mesh surface using conventional marching cube algorithm. We then propose various related algorithms for generating complete solid model for various applications, ranging from thickened solid, through voxel solid, to complex-shaped solid. The validity of this new technique is demonstrated for a variety of TPMSs, including the P. G, D, I-WP, F-RD, L, and I(2)-Y** surfaces. Finally, a new control approach for pore size distribution in tissue scaffold design is presented based on the pore-making element composed of TPMS and conformal refinement of all-hexahedral mesh in order to show the practical applicability of the newly suggested modeling approach.

关键词： Triply periodic minimal surfaces Computer aided nano design marching cube algorithm Thickened solid Complex-shaped solid Tissue engineering Scaffold

来源：评论

学校读者我要写书评

暂无评论

GPU Benchmarks Based On Strange Attractors

GPU Benchmarks Based On Strange Attractors

引用

International Joint Conferences on Computer, Information, and Systems Sciences, and Engineering (CISSE)

作者： Podoba, Tomas Giesl, Jiri Vicek, Karel Tomas Bata Univ Dept Appl Informat Zlin Czech Republic

ISBN: (纸本)9789048191123;9789048191116

The main purpose of presented GPU benchmark is to generate complex polygonal mesh structures based on strange attractors with fractal structure. Attractors have to be created as 4D objects using quaternion algebra. Polygonal mesh can have different numbers of polygons because of iterative application of this system. The major complexity of every mesh would provide efficient results using multiple methods such as ray-tracing, anti aliasing and anisotropic filtering to evaluate GPU performance. Our main goal is to develop new faster algorithm to generate 3D structures and apply its complexity for GPU benchmarking.

关键词： Benchmark fractal strange attractor quaternion marching cube algorithm

来源：评论

学校读者我要写书评

暂无评论

Visualization of 3D spatial data sets applied in radar imaging

Visualization of 3D spatial data sets applied in radar imagi...

引用

International Conference on Microwave and Millimeter Wave Technology

作者： Gao Ying Fei Yi Zheng Tao Peng Yu-xin NW Polytech Univ Coll Marine Xian 710072 Peoples R China

ISBN: (纸本)9781424418794

Radar imaging technology is a vigorous research field at present. The method of SAR imaging is often used in radar imaging. But it is a quite complex process. In this paper, visualization of 3D spatial data sets technology is applied in radar imaging. The principle of creating iso-surfaces in 3D regular data sets and the optimization to MC algorithm are introduced. The way of building programming circumstance for OpenGL to render iso-surfaces is presented in detail. Real data get from radar scanning is used to implement 3D re-building. The result is quite satisfactory because the configuration of spatial object and the reflective intensity to electromagnetic wave are reflected well.

关键词： data visualisation optimisation radar computing radar imaging rendering (computer graphics) 3D rebuilding 3D spatial data sets visualization OpenGL electromagnetic wave iso-surfaces rendering marching cube algorithm optimization radar scann

来源：评论

学校读者我要写书评

暂无评论

Simplified programming of robotic systems, applying 3D image processing

Simplified programming of robotic systems, applying 3D image...

引用

2nd IEEE International Conference on Industrial Informatics

作者： Stark, G Bernauer, D Flaschka, D Univ Appl Sci Dept Comp Sci Lab CIM & Robot D-86316 Augsburg Germany

ISBN: (纸本)0780385136

The main objective of the project is to support the application of robot-like systems related to small and medium enterprises. Three-dimensional image processing is used in order to support and automate programming. High-precision machining of complex components with a low number of pieces is the main type of application to be considered. An integrated programming and control system has been developed. The geometrical representation of the surface is evaluated by applying an optimized marching cube algorithm. Technology-oriented functions are implemented and can be extended by the user, in order to generate control programs, referring to a specific application technology.

关键词： robot image processing marching cube algorithm workpiece handling

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：