arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1909.12252cs.PLcs.CG
收藏

具有相等饱和和逆变换的结构化CAD模型综合

Synthesizing Structured CAD Models with Equality Saturation and Inverse Transformations

Chandrakana Nandi, Max Willsey, Adam Anderson, James R. Wilcox, Eva Darulova, Dan Grossman, Zachary Tatlock

摘要:

最近的程序合成技术帮助用户定制CAD模型(例如,用于3D打印),将低级三角形网格反编译为构造性实体几何(CSG)表达式。如果没有循环或函数,编辑CSG可能需要许多协调的更改,并且现有的网格反编译器使用可能混淆高级结构的语法。本文提出了第二个反编译阶段,强大的“收缩”非结构化CSG表达式到更多的可编辑程序与地图和折叠操作。我们提出Szalinski,一个工具,使用平等饱和与语义保持CAD重写有效地搜索较小的等效程序。Szalinski依赖于逆变换,这是求解器推测性地将等价物添加到E图的一种新方法。我们定性评估Szalinski的案例研究,显示它如何与现有的网格反编译器组成,并证明Szalinski可以在几秒钟内缩小大型模型。

英文摘要:

Recent program synthesis techniques help users customize CAD models(e.g., for 3D printing) by decompiling low-level triangle meshes to Constructive Solid Geometry (CSG) expressions. Without loops or functions, editing CSG can require many coordinated changes, and existing mesh decompilers use heuristics that can obfuscate high-level structure. This paper proposes a second decompilation stage to robustly "shrink" unstructured CSG expressions into more editable programs with map and fold operators. We present Szalinski, a tool that uses Equality Saturation with semantics-preserving CAD rewrites to efficiently search for smaller equivalent programs. Szalinski relies on inverse transformations, a novel way for solvers to speculatively add equivalences to an E-graph. We qualitatively evaluate Szalinski in case studies, show how it composes with an existing mesh decompiler, and demonstrate that Szalinski can shrink large models in seconds.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑