Robust Edge-Preserved Surface Mesh Polycube Deformation
Hui Zhao, Na Lei, Xuan Li, Peng Zeng, Ke Xu, Xianfeng, Gu

TL;DR
This paper introduces a robust, efficient, and automatic algorithm for deforming arbitrary surface meshes into their polycube counterparts, preserving edges and applicable to various shapes with improved speed and robustness.
Contribution
It presents a novel edge-preserving, automatic polycube deformation algorithm that outperforms previous methods in speed, robustness, and simplicity.
Findings
Outperforms previous methods in speed and robustness
Works on meshes with or without boundaries
Successfully applied to hundreds of models of varying complexity
Abstract
The problem of polycube construction or deformation is an essential problem in computer graphics. In this paper, we present a robust, simple, efficient and automatic algorithm to deform the meshes of arbitrary shapes into their polycube ones. We derive a clear relationship between a mesh and its corresponding polycube shape. Our algorithm is edge-preserved, and works on surface meshes with or without boundaries. Our algorithm outperforms previous ones in speed, robustness, efficiency. Our method is simple to implement. To demonstrate the robustness and effectiveness of our method, we apply it to hundreds of models of varying complexity and topology. We demonstrat that our method compares favorably to other state-of-the-art polycube deformation methods.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · 3D Shape Modeling and Analysis · Computer Graphics and Visualization Techniques
