跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+479新增论文
+361其中 AI 相关
+63已有论文修订
+93新增 AI 导读

arXiv 最近完成扫描:2026-11-16 01:34 · 全站最近入库:2026-11-16 13:44各信源进度 →

统计口径与数据新鲜度

统计 2026-11-15 16:01 — 2026-11-16 16:01(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-16 01:34最近发现新增版本:2026-11-16 13:44库内论文最新更新时间:2026-11-14 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

23,827 已收录论文19,941 AI 相关6,921 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-16 01:33(北京时间)
版本更新 · v2arXiv:2605.01919

Refining and Repairing Signed Distance Data With Global Consistency

Letao Chen, Sanju Mupparaju, Christopher Batty, Silvia Sellán, Oded Stein

原文摘要

We propose a method to interpolate exact Signed Distance Function (SDF) data from a discrete set of samples. Unlike prior work, our approach ensures that the new SDF data values are fully consistent with the input and each other, such that the augmented data still corresponds to a geometrically realizable surface. We express the theoretical properties of exact SDFs as hard geometric constraints, and construct an efficient greedy algorithm for consistent SDF interpolation that is made even faster with powerful parallelized GPU preprocessing. We exemplify the usefulness of our method by evaluating it on three practical applications: global SDF refinement, in which the SDF data is upsampled without knowledge of the ground truth; mesh reconstruction, where our method can reconstruct highly detailed surfaces using global information from coarse input SDFs; and repair of pseudo-SDFs, which result from many pipelines such as CSG Boolean operations and must be turned into valid SDFs for downstream processing tasks. Our refined SDFs are guaranteed to be consistent with the input, where previous methods have no such guarantee.

cs.GR

新论文 · v1arXiv:2611.01414

Extensible Programmatic Specification of Finite Element Methods

Theadora Fields Collin, Oded Stein, Gilbert Bernstein, Saman Amarasinghe

原文摘要

Finite element methods (FEMs) are a powerful and ubiquitous tool for solving engineering problems. Experimenting with different finite elements can improve the quality and efficiency of solutions. In some cases, the wrong (but nonetheless most common) choice of finite element will produce solutions which converge to the wrong answer regardless of mesh resolution. However, in practice, the choice of finite element is not explored due to the complexity of re-deriving and re-implementing finite element methods. Trying a new finite element is challenging because practitioners must manually deduce formulas to use these elements and implement them within a potentially complex system. We address this problem by introducing ElementForge, a finite element system that is parametric over the literate mathematical specification of a finite element in a domain-specific language (DSL). The ElementForge compiler reasons about tensor spaces, tensors, and tensor bases from first principles to derive implementations of finite elements. The ElementForge compiler is able to automatically derive implementations of finite elements previously only derived by hand. Further, ElementForge minimally couples several key mathematical concepts, mainly tensor fields, mesh topologies, sparse tensors, and assembled finite element operators, to produce a complete finite element system that is parametric over the choice of element. Consequently, the elements derived by the compiler can be applied parametrically to new meshes, PDEs, and boundary conditions. We evaluate our system by implementing several simulations with different finite elements, demonstrating that our system can explore tradeoffs in generality, accuracy, speed, and representational complexity. For example, we are able to implement the Morley, Bell, Argyris, and Hermite like elements with less than 50 lines of code and use them all in a single simulation.

cs.MS · cs.GR · cs.PL