Solving spatial basic geometric constraint configurations with locus intersection

被引：16

作者：

Gao, XS

Hoffmann, CM ^{[1
]}

Yang, WQ

机构：

[1] Purdue Univ, Dept Comp Sci, W Lafayette, IN 47907 USA

[2] Acad Sinica, AMSS, Inst Syst Sci, Beijing 100080, Peoples R China

来源：

COMPUTER-AIDED DESIGN | 2004年 / 36卷 / 02期

关键词：

geometric constraint solving; parametric CAD; spatial basic configuration; locus intersection;

D O I：

10.1016/S0010-4485(03)00056-3

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

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.

引用

页码：111 / 122

页数：12

共 25 条

[1] USING GEOMETRIC REWRITE RULES FOR SOLVING GEOMETRIC PROBLEMS SYMBOLICALLY [J].