Convex Decomposition And Efficient Shape Representation Using Deformable Convex Polytopes
Decomposition of shapes into (approximate) convex parts is essential for applications such as part-based shape representation, shape matching, and collision detection. In this paper, we propose a novel convex decomposition using a parametric implicit shape model called Disjunctive Normal Shape Model (DNSM). The DNSM is formed as a union of polytopes which themselves are formed by intersections of halfspaces. The key idea is by deforming the polytopes, which naturally remain convex during the evolution, the polytopes capture convex parts without the need to compute convexity. The major contributions of this paper include a robust convex decomposition which also results in an efficient part-based shape representation, and a novel shape convexity measure. The experimental results show the potential of the proposed method.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Learning Convex Decomposition via Feature Fields
This work proposes a new formulation to the long-standing problem of convex decomposition through learning feature fields, enabling the first feed-forward model for open-world convex decomposition. Our method produces hi…
Self-Supervised LearningSparse Representation for 3D Shape Estimation: A Convex Relaxation Approach
We investigate the problem of estimating the 3D shape of an object defined by a set of 3D landmarks, given their 2D correspondences in a single image. A successful approach to alleviating the reconstruction ambiguity is …
3D Human Pose EstimationCvxNet: Learnable Convex Decomposition
Any solid object can be decomposed into a collection of convex polytopes (in short, convexes). When a small number of convexes are used, such a decomposition can be thought of as a piece-wise approximation of the geometr…
3D ReconstructionImage to 3DRetrievalSuperadditivity and Convex Optimization for Globally Optimal Cell Segmentation using Deformable Shape Models
Cell nuclei segmentation is challenging due to shape variation and closely clustered or partially overlapping objects. Most previous methods are not globally optimal, limited to elliptical models, or are computationally …
Cell SegmentationComputational EfficiencyImage SegmentationSegmentationPhysConvex: Physics-Informed 3D Dynamic Convex Radiance Fields for Reconstruction and Simulation
Reconstructing and simulating dynamic 3D scenes with both visual realism and physical consistency remains a fundamental challenge. Existing neural representations, such as NeRFs and 3DGS, excel in appearance reconstructi…