返回
Solution space navigation for geometric constraint systems
DOI:10.1145/1138450.1138452.png)
摘要
En 中文
We study the well documented problem of systematically navigating the potentially exponentially many roots or realizations of well-constrained, variational geometric constraint systems. We give a scalable method called the Equation and Solution Manager (ESM) that can be used both for automatic searches and visual, user-driven searches for desired realizations. The method incrementally assembles the desired solution of the entire system and avoids combinatorial explosion by offering the user a visual walk-through of the solutions to recursively constructed subsystems and by permitting the user to make gradual, adaptive solution choices. We isolate requirements on companion methods that are essential and desirable for efficient, meaningful solution space navigation. Specifically, they permit (a) incorporation of many existing approaches to solution space steering or navigation into the ESM; and (b) integration of the ESM into a standard geometric constraint solver architecture. We address the latter challenge and explain how the integration is achieved. Additionally, we sketch the ESM implementation as part of an opensource, 2D and 3D geometric constraint solver, FRONTIER.
Keyword:
algorithms
design
performance
theory
root selection for geometric constraint systems
well constrained systems
underconstrained and overconstrained systems
constraint graphs
cyclical and 3D geometric constraint systems
variational geometric constraint solving
decomposition of geometric constraint systems
degree of freedom analysis
conceptual design
feature-based and assembly modeling
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.5
论文数:
4.7K
被引数:
3.6W
机构
暂无机构信息
引用论文
Mechanism of Zinc Coordination by Point-Mutated Structures of the Distal CCHC Binding Motif of the HIV-1 NCp7 Protein
Biochemistry
IF0

