FRONTIER: fully enabling geometric constraints for feature-based modeling and assembly

J. Oung, Meera Sitharam, Brandon Moro, A. Arbree
{"title":"FRONTIER: fully enabling geometric constraints for feature-based modeling and assembly","authors":"J. Oung, Meera Sitharam, Brandon Moro, A. Arbree","doi":"10.1145/376957.376995","DOIUrl":null,"url":null,"abstract":"In the full paper [1], we discuss the functionality and implementation challenges of the Frontier geometric constraint engine, designed to address the main reasons for the underutilization of geometric constraints in today's 3D design and assembly systems. Here, we motivate the full paper by outlining the advantages of Frontier.\nFrontier fully enables both (a) the use of complex, cyclic, spatial constraint structures as well as (b) feature-based design. To deal with Issue (a), Frontier relies on the efficient generation of a close-to-optimal decomposition and recombination (DR) plan for completely general variational constraint systems (see Figure 1). A serious bouleneck in constraint solving is the exponential time dependence on the size of the largest system that is simultaneously solved by the algebraic-numeric solver. In most naturally occurring cases, Frontier's DR-plan is guaranteed in minimize this size (to within a small constant factor). To deal with Issue (b), Frontier's DR-plan admits the independent and local manipulation of features and sub-assemblies in one or more underlying feature hierarchies that are input (Figures 1 and 2). A DR-plan satisfying the above requirements is generated by the new Frontsier vertex Algorithm (FA): the DR problem and its significance as well as FA and its performance with respect to several relevant and newly formalized abstract measures are described in [2, 3].\nFrontier employs a crucial representation of the DR-plan's subsystems or clusters, their hierarchy and their interaction This representation merges network flow information, as well as other geometric and combinatorial information in a natural manner. Some of this information is obtained from an efficient flow-based algorithm for detecting small rigid sub-systems presented in [4]. The clarity of this representation is crucial in the concrete realization of FA's formal performance. More significantly, this representation allows Frontier to take advantage of its DR-plan in surprising and unsuspected ways listed below.\n","PeriodicalId":286112,"journal":{"name":"International Conference on Smart Media and Applications","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Smart Media and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/376957.376995","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

Abstract

In the full paper [1], we discuss the functionality and implementation challenges of the Frontier geometric constraint engine, designed to address the main reasons for the underutilization of geometric constraints in today's 3D design and assembly systems. Here, we motivate the full paper by outlining the advantages of Frontier. Frontier fully enables both (a) the use of complex, cyclic, spatial constraint structures as well as (b) feature-based design. To deal with Issue (a), Frontier relies on the efficient generation of a close-to-optimal decomposition and recombination (DR) plan for completely general variational constraint systems (see Figure 1). A serious bouleneck in constraint solving is the exponential time dependence on the size of the largest system that is simultaneously solved by the algebraic-numeric solver. In most naturally occurring cases, Frontier's DR-plan is guaranteed in minimize this size (to within a small constant factor). To deal with Issue (b), Frontier's DR-plan admits the independent and local manipulation of features and sub-assemblies in one or more underlying feature hierarchies that are input (Figures 1 and 2). A DR-plan satisfying the above requirements is generated by the new Frontsier vertex Algorithm (FA): the DR problem and its significance as well as FA and its performance with respect to several relevant and newly formalized abstract measures are described in [2, 3]. Frontier employs a crucial representation of the DR-plan's subsystems or clusters, their hierarchy and their interaction This representation merges network flow information, as well as other geometric and combinatorial information in a natural manner. Some of this information is obtained from an efficient flow-based algorithm for detecting small rigid sub-systems presented in [4]. The clarity of this representation is crucial in the concrete realization of FA's formal performance. More significantly, this representation allows Frontier to take advantage of its DR-plan in surprising and unsuspected ways listed below.
FRONTIER:完全启用基于特征的建模和装配的几何约束
在全文[1]中,我们讨论了Frontier几何约束引擎的功能和实现挑战,旨在解决当今3D设计和装配系统中几何约束利用不足的主要原因。在这里,我们通过概述Frontier的优势来激励整篇论文。Frontier完全支持(a)使用复杂的、循环的、空间约束结构,以及(b)基于特征的设计。为了处理问题(a), Frontier依赖于为完全一般变分约束系统高效生成接近最优的分解和重组(DR)计划(见图1)。约束求解中的一个严重瓶颈是,代数-数值求解器同时求解的最大系统的大小与时间的指数依赖性。在大多数自然发生的情况下,Frontier的DR-plan保证最小化这个尺寸(在一个小的常数因子内)。为了处理问题(b), Frontier的DR-plan允许对输入的一个或多个底层特征层次中的特征和子组件进行独立和局部的操作(图1和图2)。新的Frontsier顶点算法(FA)生成了满足上述要求的DR-plan: DR问题及其重要性,以及FA及其在几个相关的新形式化的抽象度量方面的性能在[2,3]中进行了描述。Frontier采用了DR-plan的子系统或集群、它们的层次结构和相互作用的关键表示,这种表示以自然的方式合并了网络流信息,以及其他几何和组合信息。其中一些信息是从[4]中提出的用于检测小型刚性子系统的高效基于流的算法中获得的。这种表述的清晰性对于FA形式表现的具体实现至关重要。更重要的是,这种表现方式让Frontier能够以以下所列的出人意料的方式利用DR-plan。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信