Výsledky vyhledávání - "Cherchi, Gianmarco"

Report

Autor: Cherchi, Gianmarco, Pellacini, Fabio, Attene, Marco, Livesu, Marco

Boolean operations are among the most used paradigms to create and edit digital shapes. Despite being conceptually simple, the computation of mesh Booleans is notoriously challenging. Main issues come from numerical approximations that make the detec

Externí odkaz: http://arxiv.org/abs/2205.14151

Zobrazit plný text záznamu

Report

Hex-Mesh Generation and Processing: a Survey

Autor: Pietroni, Nico, Campen, Marcel, Sheffer, Alla, Cherchi, Gianmarco, Bommes, David, Gao, Xifeng, Scateni, Riccardo, Ledoux, Franck, Remacle, Jean-Francois, Livesu, Marco

In this article, we provide a detailed survey of techniques for hexahedral mesh generation. We cover the whole spectrum of alternative approaches to mesh generation, as well as post processing algorithms for connectivity editing and mesh optimization

Externí odkaz: http://arxiv.org/abs/2202.12670

Zobrazit plný text záznamu

Report

Optimal Dual Schemes for Adaptive Grid Based Hexmeshing

Autor: Livesu, Marco, Pitzalis, Luca, Cherchi, Gianmarco

Hexahedral meshes are an ubiquitous domain for the numerical resolution of partial differential equations. Computing a pure hexahedral mesh from an adaptively refined grid is a prominent approach to automatic hexmeshing, and requires the ability to r

Externí odkaz: http://arxiv.org/abs/2103.07745

Zobrazit plný text záznamu

Report

Deterministic Linear Time Constrained Triangulation using Simplified Earcut

Autor: Livesu, Marco, Cherchi, Gianmarco, Scateni, Riccardo, Attene, Marco

Triangulation algorithms that conform to a set of non-intersecting input segments typically proceed in an incremental fashion, by inserting points first, and then segments. Inserting a segment amounts to: (1) deleting all the triangles it intersects;

Externí odkaz: http://arxiv.org/abs/2009.04294

Zobrazit plný text záznamu