ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2411.01488
27
0

ITS: Implicit Thin Shell for Polygonal Meshes

3 November 2024
Huibiao Wen
Lei Wang
Yunxiao Zhang
Shuangmin Chen
Shiqing Xin
Chongyang Deng
Ying He
Wenping Wang
Changhe Tu
ArXivPDFHTML
Abstract

In computer graphics, simplifying a polygonal mesh surface~M\mathcal{M}M into a geometric proxy that maintains close conformity to~M\mathcal{M}M is crucial, as it can significantly reduce computational demands in various applications. In this paper, we introduce the Implicit Thin Shell~(ITS), a concept designed to implicitly represent the sandwich-walled space surrounding~M\mathcal{M}M, defined as~{x∈R3∣ϵ1≤f(x)≤ϵ2,ϵ1<0,ϵ2>0}\{\textbf{x}\in\mathbb{R}^3|\epsilon_1\leq f(\textbf{x}) \leq \epsilon_2, \epsilon_1< 0, \epsilon_2>0\}{x∈R3∣ϵ1​≤f(x)≤ϵ2​,ϵ1​<0,ϵ2​>0}. Here, fff is an approximation of the signed distance function~(SDF) of~M\mathcal{M}M, and we aim to minimize the thickness~ϵ2−ϵ1\epsilon_2-\epsilon_1ϵ2​−ϵ1​. To achieve a balance between mathematical simplicity and expressive capability in~fff, we employ a tri-variate tensor-product B-spline to represent~fff. This representation is coupled with adaptive knot grids that adapt to the inherent shape variations of~M\mathcal{M}M, while restricting~fff's basis functions to the first degree. In this manner, the analytical form of~fff can be rapidly determined by solving a sparse linear system. Moreover, the process of identifying the extreme values of~fff among the infinitely many points on~M\mathcal{M}M can be simplified to seeking extremes among a finite set of candidate points. By exhausting the candidate points, we find the extreme values~ϵ1<0\epsilon_1<0ϵ1​<0 and ϵ2>0\epsilon_2>0ϵ2​>0 that minimize the thickness. The constructed ITS is guaranteed to wrap~M\mathcal{M}M rigorously, without any intersections between the bounding surfaces and~M\mathcal{M}M. ITS offers numerous potential applications thanks to its rigorousness, tightness, expressiveness, and computational efficiency. We demonstrate the efficacy of ITS in rapid inside-outside tests and in mesh simplification through the control of global error.

View on arXiv
Comments on this paper