Polycube Simplification for Coarse Layouts of Surfaces and Volumes

Representing digital objects with structured meshes that embed a coarse block decomposition is a relevant problem in applications like computer animation, physically‐based simulation and Computer Aided Design (CAD). One of the key ingredients to produce coarse block structures is to achieve a good a...

Full description

Saved in:
Bibliographic Details
Published in:Computer graphics forum Vol. 35; no. 5; pp. 11 - 20
Main Authors: Cherchi, Gianmarco, Livesu, Marco, Scateni, Riccardo
Format: Journal Article
Language:English
Published: Oxford Blackwell Publishing Ltd 01.08.2016
Subjects:
Analysis
and systems
CAD
Categories and Subject Descriptors (according to ACM CCS)
Computer aided design
Computer animation
Corners
Finite element method
I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling-Geometric algorithms
I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling—Geometric algorithms, languages, and systems
Integers
languages
Meshing
Optimization
Pipelines
Singularities
Splines
Studies
ISSN:0167-7055, 1467-8659
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Representing digital objects with structured meshes that embed a coarse block decomposition is a relevant problem in applications like computer animation, physically‐based simulation and Computer Aided Design (CAD). One of the key ingredients to produce coarse block structures is to achieve a good alignment between the mesh singularities (i.e., the corners of each block). In this paper we improve on the polycube‐based meshing pipeline to produce both surface and volumetric coarse block‐structured meshes of general shapes. To this aim we add a new step in the pipeline. Our goal is to optimize the positions of the polycube corners to produce as coarse as possible base complexes. We rely on re‐mapping the positions of the corners on an integer grid and then using integer numerical programming to reach the optimal. To the best of our knowledge this is the first attempt to solve the singularity misalignment problem directly in polycube space. Previous methods for polycube generation did not specifically address this issue. Our corner optimization strategy is efficient and requires a negligible extra running time for the meshing pipeline. In the paper we show that our optimized polycubes produce coarser block structured surface and volumetric meshes if compared with previous approaches. They also induce higher quality hexahedral meshes and are better suited for spline fitting because they reduce the number of splines necessary to cover the domain, thus improving both the efficiency and the overall level of smoothness throughout the volume.
Bibliography:istex:10A00CBEF77BD47D712336429953BD1AB830E872
ArticleID:CGF12959
ark:/67375/WNG-F2BSJTW8-Q
Supporting Information
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0167-7055
1467-8659
DOI:10.1111/cgf.12959