.png){kind=icon}
返回
A C-tree decomposition algorithm for 2D and 3D geometric constraint solving
.png){kind=icon}
OA
AI
DOI：10.1016/j.cad.2005.03.002.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we propose a method which can be used to decompose a 2D or 3D constraint problem into a C-tree. With this decomposition, a geometric constraint problem can be reduced into basic merge patterns, which are the smallest problems we need to solve in order to solve the original problem in certain sense. Based on the C-tree decomposition algorithm, we implemented a software package MMP/Geometer. Experimental results show that MMP/Geometer finds the smallest decomposition for all the testing examples efficiently. (c) 2005 Elsevier Ltd. All rights reserved.
Keyword:
geometric constraint solving
parametric CAD
general construction sequence
basic merge pattern
decomposition tree
graph algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
3.1
论文数:
3.1K
被引数:
6.4K
机构
暂无机构信息
引用论文
.png){kind=icon}
Anti-epithelial (anti-A549) antibodies: their nature, specificity and relevance to transplantation
PREAI
分享收藏分享收藏分享收藏分享收藏
查看更多内容