Surface simplification using intrinsic error metrics

HTD Liu, M Gillespie, B Chislett, N Sharp… - ACM Transactions on …, 2023 - par.nsf.gov
This paper describes a method for fast simplification of surface meshes. Whereas past
methods focus on visual appearance, our goal is to solve equations on the surface. Hence …

[HTML][HTML] Mesh neural networks for SE (3)-equivariant hemodynamics estimation on the artery wall

J Suk, P de Haan, P Lippe, C Brune… - Computers in Biology and …, 2024 - Elsevier
Computational fluid dynamics (CFD) is a valuable asset for patient-specific cardiovascular-
disease diagnosis and prognosis, but its high computational demands hamper its adoption …

geoTangle: Interactive Design of Geodesic Tangle Patterns on Surfaces

G Nazzaro, E Puppo, F Pellacini - ACM Transactions on Graphics (TOG), 2021 - dl.acm.org
Tangles are complex patterns, which are often used to decorate the surface of real-world
artisanal objects. They consist of arrangements of simple shapes organized into nested …

Differentiable surface triangulation

MJ Rakotosaona, N Aigerman, NJ Mitra… - ACM Transactions on …, 2021 - dl.acm.org
Triangle meshes remain the most popular data representation for surface geometry. This
ubiquitous representation is essentially a hybrid one that decouples continuous vertex …

A new stress-driven composite porous structure design method based on triply periodic minimal surfaces

B Liu, M Liu, H Cheng, W Cao, P Lu - Thin-Walled Structures, 2022 - Elsevier
Replacing the solid infills with porous structure infill is a reliable method in the field of 3D-
printed model lightweight. Triply periodic minimal surfaces (TPMSs) provide a smooth and …

Learning the geodesic embedding with graph neural networks

B Pang, Z Zheng, G Wang, PS Wang - ACM Transactions on Graphics …, 2023 - dl.acm.org
We present GEGNN, a learning-based method for computing the approximate geodesic
distance between two arbitrary points on discrete polyhedra surfaces with constant time …

Obtaining the optimal shortest path between two points on a quasi-developable Bézier-type surface using the Geodesic-based Q-learning algorithm

V Bulut, A Onan, B Senyayla - Engineering Applications of Artificial …, 2024 - Elsevier
One of the most important problems is the computation of the shortest path between two
points, because the search for the shortest path is very important in various fields, such as …

A heat method for generalized signed distance

N Feng, K Crane - ACM Transactions on Graphics (TOG), 2024 - dl.acm.org
We introduce a method for approximating the signed distance function (SDF) of geometry
corrupted by holes, noise, or self-intersections. The method implicitly defines a completed …

Compatible intrinsic triangulations

K Takayama - ACM Transactions on Graphics (TOG), 2022 - dl.acm.org
Finding distortion-minimizing homeomorphisms between surfaces of arbitrary genus is a
fundamental task in computer graphics and geometry processing. We propose a simple …

[PDF][PDF] Winding Numbers on Discrete Surfaces.

N Feng, M Gillespie, K Crane - ACM Trans. Graph., 2023 - nzfeng.github.io
Basic Problem. Any collection of unbroken (ie, closed), oriented loops can be decomposed
into subsets that do and do not bound regions of a surface"(Figure 1). Informally, we wish to …