MERGING

作品数:228被引量:253H指数:7
导出分析报告
相关领域:自动化与计算机技术更多>>
相关作者:唐翼张晓莉艾淑云胡伍生张帆更多>>
相关机构:东南大学武汉大学华中科技大学清华大学更多>>
相关期刊:更多>>
相关基金:国家自然科学基金国家重点基础研究发展计划国家高技术研究发展计划安徽省自然科学基金更多>>
-

检索结果分析

结果分析中...
选择条件:
  • 期刊=Journal of Computer Science & Technologyx
条 记 录,以下是1-4
视图:
排序:
A Geometric Approach for Multi-Degree Spline被引量:2
《Journal of Computer Science & Technology》2012年第4期841-850,共10页李新 黄章进 刘昭 
supported by the National Natural Science Foundation of China under Grant Nos.11031007, 60903148, 60803066;the Chinese Universities Scientific Fund, the Scientific Research Foundation for the Returned Overseas Chinese Scholars of State Education Ministry of China;the Startup Scientific Research Foundation of Chinese Academy of Sciences
Multi-degree spline (MD-spline for short) is a generalization of B-spline which comprises of polynomial segments of various degrees. The present paper provides a new definition for MD-spline curves in a geometric in...
关键词:SPLINE B-SPLINE multi-degree spline MERGING 
An Algorithm for LOD by Merging Near Coplanar Faces Based on Gauss Sphere
《Journal of Computer Science & Technology》2001年第5期450-457,共8页曹卫群 鲍虎军 彭群生 
the National Natural Science Foundation of China for Distinguished Young Scholars (No.69925204) and NSF grant (No.69823003).
LOD (Level of Detail) models are widely used recently to accelerate the rendering of 3D scenes. An algorithm that creates multiple levels of detail for 3D scene by merging near-coplanar faces is presented in this pape...
关键词:multiple level of detail mesh simplification gauss sphere coplanar merging 
An Algorithm for Finding D-Time Table
《Journal of Computer Science & Technology》1992年第1期62-67,共6页张钹 张铃 
In Ref.[1],we present a relation matrix description of temporal relation constraints.This pa- per is a sequel of [1].Given a set of temporal relation and time duration constraints,find a time-table which satisfies all...
关键词:constraints ASSIGNMENT satis MERGING finding initially directed BOUNDS STEPS UNTIL 
Macro-Dataflow Computational Model and Its Simulation
《Journal of Computer Science & Technology》1990年第3期289-295,共7页孙昱东 谢志良 
This paper discusses the relationship between parallelism granularity and system overhead of dataflow computer systems,and indicates that a trade-off between them should be determined to obtain optimal efficiency of t...
关键词:Computer Systems Programming MERGING Mathematical Techniques Graph Theory 
检索报告 对象比较 聚类工具 使用帮助 返回顶部