期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
一种手写体汉字快速细化分割算法
1
作者 刘平 《重庆大学学报(自然科学版)》 EI CAS CSCD 1991年第4期78-85,共8页
提出了一种基于游程编码(run length encoding)的手写体汉字细化和分割快速算法。数据的输入与处理并行,汉字图象数据所占存贮空间仅为点阵方式的1/400。能将任何复杂汉字细化并分割为简单直线和弧线笔划。对汉字的结构特征抽取极为有... 提出了一种基于游程编码(run length encoding)的手写体汉字细化和分割快速算法。数据的输入与处理并行,汉字图象数据所占存贮空间仅为点阵方式的1/400。能将任何复杂汉字细化并分割为简单直线和弧线笔划。对汉字的结构特征抽取极为有利。此外,本文还提出一种新的边沿描述基段链码,其平均长度比Freeman链码短20%。 展开更多
关键词 汉字识别 细化分割算法 计算机
下载PDF
A Parallel Algorithm for Adaptive Local Refinement of Tetrahedral Meshes Using Bisection 被引量:31
2
作者 Lin-Bo Zhang 《Numerical Mathematics(Theory,Methods and Applications)》 SCIE 2009年第1期65-89,共25页
Local mesh refinement is one of the key steps in the implementations of adaptive finite element methods. This paper presents a parallel algorithm for distributed memory parallel computers for adaptive local refinement... Local mesh refinement is one of the key steps in the implementations of adaptive finite element methods. This paper presents a parallel algorithm for distributed memory parallel computers for adaptive local refinement of tetrahedral meshes using bisection. This algorithm is used in PHG, Parallel Hierarchical Grid Chttp://lsec. cc. ac. cn/phg/), a toolbox under active development for parallel adaptive finite element solutions of partial differential equations. The algorithm proposed is characterized by allowing simukaneous refinement of submeshes to arbitrary levels before synchronization between submeshes and without the need of a central coordinator process for managing new vertices. Using the concept of canonical refinement, a simple proof of the independence of the resulting mesh on the mesh partitioning is given, which is useful in better understanding the behaviour of the biseetioning refinement procedure. 展开更多
关键词 Adaptive refinement BISECTION tetrahedral mesh parallel algorithm MPI.
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部