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

作者： Paris, Richard University of Louisville

学位级别：M.S.

In computer graphics 3D mesh generation is an important topic, it is required for a vast number of applications. While there are currently solutions available for the generation of meshes, there is not one that suits our application well that is written in C#, for this reason a C# implementation of the halfedge data structure as well as a C# implementation of the mesh generation algorithms is needed. This document will discuss in detail the method by which the algorithms are implemented, the improvements that are made on the half-edge data structure, and the new features that have been added to the new application. Further this document will evaluate the performance improvement made by the improvements mentioned.

关键词： half-edge data structure Mesh generation Tube networks

来源：评论

学校读者我要写书评

暂无评论

General, robust, and efficient polyhedron intersection in the Interface Reconstruction Library

引用

JOURNAL OF COMPUTATIONAL PHYSICS 2022年 449卷

作者： Chiodi, Robert Desjardins, Olivier Cornell Univ Sibley Sch Mech & Aerosp Engn Ithaca NY 14853 USA

Intersecting a polyhedron with a half-space or another polyhedron is required in various fields, including computer graphics, computer-aided design, and many methods used in computational physics. Often, the polyhedra involved are complicated non-convex objects, and intersecting them constitutes a significant computational cost. To address this, we present a general, geometrically robust, and efficient polyhedron intersection algorithm based on the half-edge data structure and implemented in the open-source Interface Reconstruction Library. We then employ this algorithm in a novel graph-based approach to distribute the volume of a polyhedron over a computational mesh. To demonstrate their performance, the two methods are tested on randomly generated configurations. Compared to the open-source packages VOFTools and R3D, the polyhedron intersection algorithm shows superior speed over the range of convex and non-convex polyhedra tested. The volume distribution method also proves to be discretely conservative, even for meshes containing degenerate faces. (C) 2021 Elsevier Inc. All rights reserved.

关键词： Volume truncation Volume integration Volume distribution half-edge data structure Non-convex polyhedra Interface Reconstruction Library

来源：评论

学校读者我要写书评

暂无评论

Mesh Simplification Algorithm Based on the Quadratic Error Metric and Triangle Collapse

引用

IEEE ACCESS 2020年 8卷 196341-196350页

作者： Zhou, Guangyou Yuan, Shangda Luo, Sumei Fudan Univ Sch Econ Shanghai 200433 Peoples R China Shanghai Univ Finance & Econ Sch Finance Shanghai 200433 Peoples R China

Triangular mesh is a commonly used method for representing 3D models. With the continuous development of 3D modeling and scanning technologies, the complexity of the mesh is increasing. The greater the density of the mesh is, the higher the representation quality of the model. However, a higher mesh density also results in greater storage and time costs. Mesh simplification is a basic research topic in the fields of computer graphics and virtual reality. This paper implements a mesh simplification algorithm based on triangle collapse. The algorithm uses a half-edge data structure to record the mesh information, obtains the folding point by minimizing the sum of squares of the spatial distances from the folding point to all adjacent surfaces, and then calculates the folding cost and folding order. The algorithm iteratively folds the triangular faces with the smallest folding costs to achieve mesh simplification. By processing a large number of models, it is proven that the algorithm in this paper can retain the original model features during the simplification process.

关键词： Solid modeling Clustering algorithms Surface treatment Finite element analysis Classification algorithms Three-dimensional displays Computational modeling Triangular mesh mesh simplification triangle collapse half-edge data structure

来源：评论

学校读者我要写书评

暂无评论

Research on the Technology of Three-dimensional Surface Topological Reconstruction of Underground Rock Salt Cavern Based on Sonar Detection data

Research on the Technology of Three-dimensional Surface Topo...

引用

International Conference on Advanced Materials in Microwaves and Optics (AMMO 2011)

作者： Chen Jianzhong Sheng Yehua Wang Yongzhi Nanjing Normal Univ Key Lab Virtual Geog Environm MOE Nanjing Jiangsu Peoples R China

ISBN: (纸本)9783037852736

After analyzing the characteristics of rock salt and the feasibility and importance of using underground rock salt cavern as energy stockpiles, this paper explains in detail about the principle of sonar detection technology in cavern measuring and its data organization. This paper studies the technology of three-dimensional surface topological reconstruction of underground rock salt cavern based on sonar detection data with half-edge data structure and boundary representation models. Meanwhile, by conducting validity check for constructed surface model and repair of possible defects, the paper finds correct and effective three-dimensional surface models of underground rock salt cavern, and provides effective data base for the stability analysis, creep analysis and other numerical simulations of underground rock salt cavern. This method, with important economic and social significance, can provide a scientific basis and technological support for the construction of caverns, especially for the safe and rational use of underground rock salt cavern.

关键词： Sonar detection technology underground rock salt cavern topological reconstruction half-edge data structure boundary representation models

来源：评论

学校读者我要写书评

暂无评论

Research on Manufacturing Process Planning based double Main Spindles of Chuck for Mill-turn Machine

Research on Manufacturing Process Planning based double Main...

引用

2012 3rd International Conference on Information Technology for Manufacturing Systems(ITMS 2012)

作者： Zhuang Yao Dong Yu Junfeng Tian Yi Hu Qing Li University of Chinese Academy of Sciences Shenyang Institute of Computing Technology Chinese Academy of Sciences

This paper provided the manufacturing process planning method of the double main spindles for the turn-mill machine based on model ***, the cross section information of the 3D grid data model was obtained by using the algorithms of extracting partitions plane ***, differentiated the cross section shape to recognize the milling and turning process according to extracting partitions plane ***, it computed the treated volume in order to obtain equal division plane by extracting partitions plane *** to readjusting the equal division plane defined the process machining *** boundary divided the complex process workpiece into main and sub spindle process for the double *** last, the machining experiment verifies the adaptability and accuracy of the process planning method.

关键词： mill-turn machine process planning turning process milling process half-edge data structure treated volume process machining boundary

来源：评论

学校读者我要写书评

暂无评论

Research on the Technology of Three-dimensional Surface Topological Reconstruction of Underground Rock Salt Cavern Based on Sonar Detection data

Research on the Technology of Three-dimensional Surface Topo...

引用

2011 International Conference on Advanced Materials in Microwaves and Optics（AMMO 2011）

作者： Chen Jianzhong Sheng Yehua Wang Yongzhi Key Lab of Virtual Geographic Environment MOE Nanjing Normal University Jintan Municipal Bureau of Land Resources

关键词： Sonar detection technology underground rock salt cavern topological reconstruction half-edge data structure boundary representation models

来源：评论

学校读者我要写书评

暂无评论

Research on the Technology of Three-dimensional Surface Topological Reconstruction of Underground Rock Salt Cavern Based on Sonar Detection data

Research on the Technology of Three-dimensional Surface Topo...

引用

2010 International Conference on Remote Sensing (ICRS 2010)

作者： Chen Jianzhong1,2, Sheng Yehua1, Wang Yongzhi1 1 Key Lab of Virtual Geographic Environment, MOE, Nanjing Normal University, Nanjing, China 2 Jintan Municipal Bureau of Land Resources, Changzhou, China

关键词： sonar detection technology underground rock salt cavern topological reconstruction half-edge data structure boundary representation models

来源：评论

学校读者我要写书评

暂无评论

Visualizing and animating the winged-edge data structure

引用

COMPUTERS & GRAPHICS-UK 2007年第6期31卷 877-886页

作者： Neperud, Bryan Lowther, John Shene, Ching-Kuang Michigan Technol Univ Dept Comp Sci Houghton MI 49931 USA

The winged- and half-edge data structures are commonly used representations for polyhedron models. Due to the complexity, students in an introductory course to computer graphics usually have difficulty in handling these data structures and developing applications. This paper describes the authors' effort in the development of a visualization and animation tool for teaching and learning these data structures. This tool also includes a simple pseudo-code-like language for algorithm design. Instructors may employ this tool for presentation and demonstration purposes. Students may use the simple language to develop and experiment with new algorithms before their actual implementation. The visualization and animation system may be used to explore and understand the relationship among mesh elements and algorithm execution. (C) 2007 Elsevier Ltd. All rights reserved.

关键词： winged-edge data structure half-edge data structure algorithm visualization and animation computer graphics education

来源：评论

学校读者我要写书评

暂无评论

data structures for optimizing linear spline approximations

引用

COMPUTERS & GRAPHICS-UK 2000年第3期24卷 353-361页

作者： Kreylos, O Hamann, B Univ Calif Davis Dept Comp Sci Ctr Image Proc & Integrated Computing Davis CA 95616 USA

We describe the algorithms and data structures used for optimizing linear spline approximations of bivariate functions. Our method creates a random initial triangulation of a given data set and then employs a simulated annealing algorithm to improve this initial approximation. In every iteration step, the current approximation is changed in a random but local way, and the distance measure between it and the data is re-calculated. Depending on the difference between the old and new distance measures, an iteration step is either accepted or rejected. We discuss the basic operations and data structures of our optimization technique. We present a variant of the half-edge data structure and associated algorithms. (C) 2000 Published by Elsevier Science Ltd. All rights reserved.

关键词： linear spline approximation simulated annealing half-edge data structure image approximation triangulations

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：