.png){kind=icon}
.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
geometric constraint solving
parametric CAD
spatial basic configuration
locus intersection
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
3.1
Papers:
3.1K
Citations:
6.4K
Organization
No organization information available