English
Related papers

Related papers: A Comprehensive Guide to Mesh Simplification using…

200 papers

We present a novel, domain-agnostic, model-independent, unsupervised, and universally applicable Machine Learning approach for dimensionality reduction based on the principles of algorithmic complexity. Specifically, but without loss of…

Data Structures and Algorithms · Computer Science 2025-05-06 Hector Zenil , Narsis A. Kiani , Alyssa Adams , Felipe S. Abrahão , Antonio Rueda-Toicen , Allan A. Zea , Luan Ozelim , Jesper Tegnér

Evolution of 3D graphics and graphical worlds has brought issues like content optimization, real-time processing, rendering, and shared storage limitation under consideration. Generally, different simplification approaches are used to make…

Graphics · Computer Science 2021-01-08 Sadia Tariq , Anis Ur Rahman , Tahir Azim , Rehman Gull Khan

High-order quadrilateral meshes offer superior accuracy and computational efficiency in numerical simulations. However, existing methods struggle to simultaneously preserve boundary/interface features, ensure high quality, and achieve…

Graphics · Computer Science 2026-03-25 Yongjia Weng , Lufeng Liu , Zhonggui Chen , Xuan Zhou , Juan Cao

This paper presents a method to generate valid high order meshes with optimized geometrical accuracy. The high order meshing procedure starts with a linear mesh, that is subsequently curved without taking care of the validity of the high…

Computational Physics · Physics 2016-03-23 Thomas Toulorge , Jonathan Lambrechts , Jean-François Remacle

Applications that require Internet access to remote 3D datasets are often limited by the storage costs of 3D models. Several compression methods are available to address these limits for objects represented by triangle meshes. Many CAD and…

Graphics · Computer Science 2007-05-23 Davis King , Jarek Rossignac , Andrzej Szymczak

We present a novel algorithm to compute multi-scale curvature fields on triangle meshes. Our algorithm is based on finding robust mean curvatures using the ball neighborhood, where the radius of a ball corresponds to the scale of the…

Graphics · Computer Science 2016-11-01 Patrick Seemann , Simon Fuhrmann , Stefan Guthe , Fabian Langguth , Michael Goesele

The use of multigrid and related preconditioners with the finite element method is often limited by the difficulty of applying the algorithm effectively to a problem, especially when the domain has a complex shape or adaptive refinement. We…

Numerical Analysis · Computer Science 2015-03-19 Peter R. Brune , Matthew G. Knepley , L. Ridgway Scott

Straight-forward conformation generation models, which generate 3-D structures directly from input molecular graphs, play an important role in various molecular tasks with machine learning, such as 3D-QSAR and virtual screening in drug…

Biomolecules · Quantitative Biology 2022-03-16 Shuwen Yang , Tianyu Wen , Ziyao Li , Guojie Song

Meshing is a critical, but user-intensive process necessary for stable and accurate simulations in computational fluid dynamics (CFD). Mesh generation is often a bottleneck in CFD pipelines. Adaptive meshing techniques allow the mesh to be…

Machine Learning · Computer Science 2022-12-06 Cooper Lorsung , Amir Barati Farimani

A new higher-order accurate method is proposed that combines the advantages of the classical $p$-version of the FEM on body-fitted meshes with embedded domain methods. A background mesh composed by higher-order Lagrange elements is used.…

Numerical Analysis · Computer Science 2016-04-04 Samir Omerović , Thomas-Peter Fries

An adaptive refinement strategy, based on an equilibrated flux a posteriori error estimator, is proposed in the context of defeaturing problems. Defeaturing consists of removing features from complex domains to simplify mesh generation and…

Numerical Analysis · Mathematics 2026-03-04 Annalisa Buffa , Denise Grappein , Rafael Vázquez

Edge-preserving smoothing (EPS) can be formulated as minimizing an objective function that consists of data and prior terms. This global EPS approach shows better smoothing performance than a local one that typically has a form of weighted…

Computer Vision and Pattern Recognition · Computer Science 2016-04-27 Youngjung Kim , Dongbo Min , Bumsub Ham , Kwanghoon Sohn

Many tasks in geometry processing are modeled as variational problems solved numerically using the finite element method. For solid shapes, this requires a volumetric discretization, such as a boundary conforming tetrahedral mesh.…

Graphics · Computer Science 2018-07-04 Silvia Sellán , Herng Yi Cheng , Yuming Ma , Mitchell Dembowski , Alec Jacobson

One challenge that remains open in 3D deep learning is how to efficiently represent 3D data to feed deep networks. Recent works have relied on volumetric or point cloud representations, but such approaches suffer from a number of issues…

Computer Vision and Pattern Recognition · Computer Science 2019-01-25 Jhony K. Pontes , Chen Kong , Sridha Sridharan , Simon Lucey , Anders Eriksson , Clinton Fookes

We present MeshODE, a scalable and robust framework for pairwise CAD model deformation without prespecified correspondences. Given a pair of shapes, our framework provides a novel shape feature-preserving mapping function that continuously…

Graphics · Computer Science 2020-05-26 Jingwei Huang , Chiyu Max Jiang , Baiqiang Leng , Bin Wang , Leonidas Guibas

An important step in shape optimization with partial differential equation constraints is to adapt the geometry during each optimization iteration. Common strategies are to employ mesh-deformation or re-meshing, where one or the other…

Numerical Analysis · Mathematics 2018-06-27 Jorgen S. Dokken , Simon W. Funke , August Johansson , Stephan Schmidt

Thinning is the removal of contour pixels/points of connected components in an image to produce their skeleton with retained connectivity and structural properties. The output requirements of a thinning procedure often vary with…

Computer Vision and Pattern Recognition · Computer Science 2017-11-20 Himanshu Jain , Archana Praveen Kumar

Modified Direct Method (MDM) is an iterative scheme based on Jacobi iterations for smoothing planar meshes [4]. The basic idea behind MDM is to make any triangular element be as close to an equilateral triangle as possible. Basedon the MDM,…

Computational Geometry · Computer Science 2013-09-02 Gang Mei , John C. Tipper , Nengxiong Xu

We study the problem of moving a vertex in an unstructured mesh of triangular, quadrilateral, or tetrahedral elements to optimize the shapes of adjacent elements. We show that many such problems can be solved in linear time using…

Computational Geometry · Computer Science 2010-01-21 Nina Amenta , Marshall Bern , David Eppstein

We compare different methods to reconstruct the three-dimensional (3D) CME morphology. The explored methods include geometric localisation, mask fitting, forward modeling, polarisation ratio and local correlation tracking plus…

Solar and Stellar Astrophysics · Physics 2015-06-22 Li Feng , Bernd Inhester , Mierla Marilena
‹ Prev 1 3 4 5 6 7 10 Next ›