.png){kind=icon}
返回
Solving spatial basic geometric constraint configurations with locus intersection
.png){kind=icon}
PRE
AI
DOI：10.1016/S0010-4485(03)00056-3.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A basic idea of geometric constraint solving (GCS) is to decompose the constraint problem into smaller ones according to some basic configurations. In this paper, we find all spatial basic configurations involving points, lines, and planes containing up to six geometric primitives in an automated way. Many of these basic configurations still resist effective analytical solutions. We propose the locus intersection method (LIM) for GCS, a hybrid method based on geometric computation and numerical search that can be used to find all the solutions for a geometric constraint problem. We show that the LIM can be used to solve all the above basic configurations. (C) 2004 Elsevier Ltd. All rights reserved.
Keyword:
geometric constraint solving
parametric CAD
spatial basic configuration
locus intersection
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
3.1
论文数:
3.1K
被引数:
6.4K
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏
Solving geometric constraint systems. II. A symbolic approach and decision of rc-constructibility
PREAI
分享收藏
查看更多内容