ℓ 1 -Based Construction of Polycube Maps from Complex Shapes
From MaRDI portal
Publication:5176492
DOI10.1145/2602141zbMath1322.68223OpenAlexW2075891377MaRDI QIDQ5176492
Zeyun Shi, Jin Huang, Tengfei Jiang, Yiying Tong, Mathieu Desbrun, Hu-Jun Bao
Publication date: 26 February 2015
Published in: ACM Transactions on Graphics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2602141
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items (8)
Intrinsic mixed-integer polycubes for hexahedral meshing ⋮ IGA-suitable planar parameterization with patch structure simplification of closed-form polysquare ⋮ Constructing volumetric parameterization based on directed graph simplification of \(\ell_1\) polycube structure from complex shapes ⋮ Robust atlas generation via angle-based segmentation ⋮ Centroidal Voronoi tessellation based polycube construction for adaptive all-hexahedral mesh generation ⋮ Computing locally injective mappings by advanced MIPS ⋮ Hexahedral mesh re-parameterization from aligned base-complex ⋮ Surface segmentation for polycube construction based on generalized centroidal Voronoi tessellation
Uses Software
Cites Work
- NETGEN: An advancing front 2D/3D-mesh generator based on abstract rules
- Huber approximation for the non-linear \(l_{1}\) problem
- Numerical solution of saddle point problems
- An Algorithm for $l_1 $-Norm Minimization with Application to Nonlinear $l_1 $-Approximation
- An Efficient Newton Barrier Method for Minimizing a Sum of Euclidean Norms
- Trust-region interior-point method for large sparsel1optimization
- Robust Statistics
This page was built for publication: ℓ 1 -Based Construction of Polycube Maps from Complex Shapes