Simplified Algorithm for Triangular Mesh Surface Based on R</sup>*-tree

您当前的位置：

首页 >

文章列表页 >

Simplified Algorithm for Triangular Mesh Surface Based on R^{^*-tree}

更新时间：2025-07-09

- Simplified Algorithm for Triangular Mesh Surface Based on R^{^*-tree}
- Vol. 42, Issue 9, Pages: 1179-1183(2008)
- 作者机构：
 
 山东理工大学机械工程学院,山东,淄博,255091
- 作者简介：
- 基金信息：
- DOI：
 CLC： TP391.72
- Published：2008
- 稿件说明：
移动端阅览
Simplified Algorithm for Triangular Mesh Surface Based on R^{^*-tree[J]. 2008, 42(9): 1179-1183.}
DOI：

Simplified Algorithm for Triangular Mesh Surface Based on R^{^*-tree[J]. 2008, 42(9): 1179-1183.} DOI：

摘要

提出了一种三角网格曲面非均匀精简算法.该算法采用R

/sup>*-tree组织三角网格曲面的空间拓扑结构

实现了三角面片拓扑邻域的快速查询.结合三角网格曲面模型的曲率分布状况

对三角网格曲面进行聚类分簇处理

通过对分簇网格进行局部精简

实现了三角网格曲面模型的整体保形性精简.与同类精简算法的对比实验表明

该算法的数据适应性强

有效地保留了三角网格曲面的型面特征

精简后的网格模型与原网格模型的面片偏差降低了20%～45%

精简时间减少了10%～35%.

Abstract

A new simplified algorithm for triangular mesh surface is proposed

which organizes the topological structure of the triangular mesh surface based on R

-tree spacial index structure to inquire the topological neighborhoods of the triangular mesh surface. Then the triangular mesh surface is discreted into many clusters by the triangular mesh surface features

and the triangular mesh surface is ununiformly simplified throughout the clusters. The stronger adaptability is verified and the features of the triangular mesh surface is remained effectively. It is found that the deviation is reduced by 20%-45%

and the computing period is subtracted by 10%-35% compared with the existing algorithms.

关键词

Keywords

references

ROSSIGNAC J,BORREL P.Multi-resolution 3D approximation for rendering complex scenes [M]∥Falcidieno B, Kunii T L.Modeling in Computer Graphics.New York:Springer-Verlag,1993:455-465.

周昆,潘志庆,石教英,等.一种新的基于顶点聚类的网格简化算法 [J].自动化学报,1999,25(1):1-8.

ZHOU Kun,PAN Zhiqing,SHI Jiaoying.A new mesh simplification algorithm based on vertex clustering [J].Acta Automatica Sinica,1999,25(1):1-8.

ISENBURG M,LINDSTROM P,GUMHOLD S,et al. Large mesh simplification using processing sequences [C]∥Proceedings of IEEE Visualization. Piscataway, NJ, USA:IEEE,2003:465-472.

WU Jianhua, KOBBELT L. A stream algorithm for the decimation of massive meshes [C]∥Proceedings of Graphics Interface.Halifax, Canada:Nova Scotia,2003:185-192.

田怀文,王金诺.表面重建中的三角网格简化方法 [J].西南交通大学学报,2002,37(2):150-153.

TIAN Huaiwen,WANG Jinnuo.Simplification method for triangulation net in surface reconstruction [J].Journal of Southwest Jiaotong University,2002,37(2):150-153.

刘宇,朱仲英,施颂椒.空间k近邻查询的新策略[J].上海交通大学学报,2001,35(9):1298-1302.

LIU Yu,ZHU Zhongying,SHI Songshu.Novel strategy for spatial k-nn query [J].Journal of Shanghai Jiaotong University,2001,35(9):1298-1302.

BECKMANN N, KRIEGEL H P, SCHNEIDER R,et al.The R/sup*-tree:an efficient and robust access method for points and rectangles [C]∥Proceedings of Sigmod.New York, USA:ACM,1990:322-331.

Lo S H.Delaunay triangulation of non-convex planar domains [J].International Journal for Numerical Methods in Engineering,1989,28(11):2695-2707.

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Knowledge Graph Representation Learning Driven by Semantic Discrimination and Subgraph Integration

Electrothermal Coupling Research on the Evolutionary Law of Anti-Corona Performance for High-Altitude Air-Cooled Generators

Numerical Simulation of the Energy Conversion Process in Thermoacoustic Engines with Different Stack Materials

Influence of Structural Parameters on the Summer Operational Characteristics of a Three-Tower-in-One Indirect Air-Cooling System

I/O Performance Modeling and Prediction Method for Large-Scale Parallel Applications Using Machine Learning

Related Author

No data

Related Institution

No data

⁰