Reconstruction of Convex Polytope Compositions from 3D Point-clouds
Reconstructing a composition (union) of convex polytopes that perfectly fits the corresponding input point-cloud is a hard optimization problem with interesting applications in reverse engineering and rigid body dynamics simulations. We propose a pipeline that first extracts a set of planes, then partitions the input point-cloud into weakly convex clusters and finally generates a set of convex polytopes as the intersection of fitted planes for each partition. Finding the best-fitting convex polytopes is formulated as a combinatorial optimization problem over the set of fitted planes and is solved using an Evolutionary Algorithm. For convex clustering, we employ two different methods and detail their strengths and weaknesses in a thorough evaluation based on multiple input data-sets.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringCombinatorial OptimizationSimilar Papers 제목 키워드 기반
Label-Efficient Learning on Point Clouds using Approximate Convex Decompositions
The problems of shape classification and part segmentation from 3D point clouds have garnered increasing attention in the last few years. Both of these problems, however, suffer from relatively small training sets, creat…
General ClassificationRepresentation LearningSegmentationSuperFlex: Deformable Superquadrics for Point Cloud Decomposition
Superquadrics have proven to provide a compact, geometrically meaningful representation for 3D objects. However, existing methods suffer from limited reconstruction accuracy, are restricted to rigid primitives, and lack …
Point CloudsPathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds
Autonomous robot navigation requires the rapid generation of obstacle-free regions for trajectory planning. However, existing corridor generators struggle to meet real-time, sensor-rate computational constraints. To reso…
Trajectory PlanningRobot NavigationPoint CloudsIntroducing the Expohedron for Efficient Pareto-optimal Fairness-Utility Amortizations in Repeated Rankings
We consider the problem of computing a sequence of rankings that maximizes consumer-side utility while minimizing producer-side individual unfairness of exposure. While prior work has addressed this problem using linear …
FairnessConsistency of archetypal analysis
Archetypal analysis is an unsupervised learning method that uses a convex polytope to summarize multivariate data. For fixed $k$, the method finds a convex polytope with $k$ vertices, called archetype points, such that t…