Fetching the paper…
Reading the bibliography…
Approximate convex decomposition aims to decompose a 3D shape into a set of almost convex components, whose convex hulls can then be used to represent the input shape.
LIII. On lines and planes of closest fit to systems of points in space
Karl Pearson. 1901 · 1901
Earlier work this paper cites.
Convex decompositions of polyhedra. In Proceedings of the thirteenth annual ACM symposium on Theory of computing . 70–79
Bernard M Chazelle. 1981 · 1981
Earlier work this paper cites.
Some NP-hard polygon decomposition problems
Joseph O’Rourke and Kenneth Supowit. 1983 · 1983
Earlier work this paper cites.
Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm
Bernard Chazelle. 1984 · 1984
Earlier work this paper cites.
A fast procedure for computing the distance between complex objects in three-dimensional space
Elmer G Gilbert, Daniel W Johnson, and S Sathiya Keerthi. 1988 · 1988
Earlier work this paper cites.
Convex decomposition of polyhedra and robustness
Chanderjit L Bajaj and Tamal K Dey. 1992 · 1992
Earlier work this paper cites.
Tetrahedral mesh generation in polyhedral regions based on convex polyhedron decompositions
Barry Joe. 1994 · 1994
Earlier work this paper cites.
Splitting a complex of convex polytopes in any dimension. In Proceedings of the twelfth annual symposium on Computational geometry . 88–97
Chandrajit L Bajaj and Valerio Pascucci. 1996 · 1996
Earlier work this paper cites.
Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator. In Workshop on Applied Computational Geometry . Springer, 203–222
Jonathan Richard Shewchuk. 1996 · 1996
Earlier work this paper cites.
Strategies for polyhedral surface decomposition: An experimental study
Bernard Chazelle, David P Dobkin, Nadia Shouraboura, and Ayellet Tal. 1997 · 1997
Earlier work this paper cites.
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Sunil Arya, David M Mount, Nathan S Netanyahu, Ruth Silverman, and Angela Y Wu. 1998 · 1998
Earlier work this paper cites.
Erased arrangements of lines and convex decompositions of polyhedra
John E Hershberger and Jack S Snoeyink. 1998 · 1998
Earlier work this paper cites.
V-Clip: Fast and robust polyhedral collision detection
Brian Mirtich. 1998 · 1998
Earlier work this paper cites.
A fast and robust GJK implementation for collision detection of convex objects
Gino van den Bergen. 1999 · 1999
Earlier work this paper cites.
Adaptive medial-axis approximation for sphere-tree construction
Gareth Bradshaw and Carol O’Sullivan. 2004 · 2004
Earlier work this paper cites.
Approximate convex decomposition. In Proceedings of the twentieth annual symposium on Computational geometry . 457–458
Jyh-Ming Lien and Nancy M Amato. 2004 · 2004
Earlier work this paper cites.
Bandit based monte-carlo planning. In European conference on machine learning . Springer, 282–293
Levente Kocsis and Csaba Szepesvári. 2006 · 2006
Earlier work this paper cites.
Simultaneous shape decomposition and skeletonization. In Proceedings of the 2006 ACM symposium on Solid and physical modeling . 219–228
Jyh-Ming Lien, John Keyser, and Nancy M Amato. 2006 · 2006
Earlier work this paper cites.
Approximate convex decomposition of polyhedra. In Proceedings of the 2007 ACM symposium on Solid and physical modeling . 121–131
Jyh-Ming Lien and Nancy M Amato. 2007 · 2007
Earlier work this paper cites.
A finite element method on convex polyhedra. In Computer Graphics Forum , Vol. 26. Wiley Online Library, 355–364
Martin Wicke, Mario Botsch, and Markus Gross. 2007 · 2007
Cited alongside, same era.
Hierarchical convex approximation of 3D shapes for fast region selection. In Computer graphics forum , Vol. 27. Wiley Online Library, 1323–1332
Marco Attene, Michela Mortara, Michela Spagnuolo, and Bianca Falcidieno. 2008 · 2008
Cited alongside, same era.
Approximate convex decomposition of polyhedra and its applications
Jyh-Ming Lien and Nancy M Amato. 2008 · 2008
Cited alongside, same era.
Convex hull covering of polygonal scenes for accurate collision detection in games.. In Graphics Interface . 203–210
Rong Liu, Hao Zhang, and James Busby. 2008 · 2008
Cited alongside, same era.
CGAL: The computational geometry algorithms library. In Proceedings of the 17th ACM SIGSPATIAL international conference on advances in geographic information systems . 538–539
Andreas Fabri and Sylvain Pion. 2009 · 2009
Bounding proxies for shape approximation
Stéphane Calderon and Tamy Boubekeur. 2017 · 2017
Later among the works it cites.
Point location
Jack Snoeyink. 2017 · 2017
Later among the works it cites.
Learning shape abstractions by assembling volumetric primitives. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition . 2635–2643
Shubham Tulsiani, Hao Su, Leonidas J Guibas, Alexei A Efros, and Jitendra Malik. 2017 · 2017
Later among the works it cites.
3d-prnn: Generating shape primitives with recurrent neural networks. In Proceedings of the IEEE International Conference on Computer Vision . 900–909
Chuhang Zou, Ersin Yumer, Jimei Yang, Duygu Ceylan, and Derek Hoiem. 2017 · 2017
Later among the works it cites.
Soft actor-critic algorithms and applications
Tuomas Haarnoja, Aurick Zhou, Kristian Hartikainen, George Tucker, Sehoon Ha, Jie Tan, Vikash Kumar, Henry Zhu, Abhishek Gupta, Pieter Abbeel, et al · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
A simple and efficient approach for 3D mesh approximate convex decomposition. In 2009 16th IEEE international conference on image processing (ICIP) . IEEE, 3501–3504
Khaled Mamou and Faouzi Ghorbel. 2009 · 2009
Cited alongside, same era.
Convex shape decomposition. In 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition . IEEE, 97–104
Hairong Liu, Wenyu Liu, and Longin Jan Latecki. 2010 · 2010
Cited alongside, same era.
Bounded biharmonic weights for real-time deformation
Alec Jacobson, Ilya Baran, Jovan Popovic, and Olga Sorkine. 2011 · 2011
Cited alongside, same era.
Minimum near-convex decomposition for robust shape representation. In 2011 International Conference on Computer Vision . IEEE, 303–310
Zhou Ren, Junsong Yuan, Chunyuan Li, and Wenyu Liu. 2011 · 2011
Cited alongside, same era.
Automatic cage generation by improved obbs for mesh deformation
Chuhua Xian, Hongwei Lin, and Shuming Gao. 2012 · 2012
Cited alongside, same era.
Fast approximate convex decomposition using relative concavity
Mukulika Ghosh, Nancy M Amato, Yanyan Lu, and Jyh-Ming Lien. 2013 · 2013
Cited alongside, same era.
Real time dynamic fracture with volumetric approximate convex decompositions
Matthias Müller, Nuttapong Chentanez, and Tae-Yong Kim. 2013 · 2013
Cited alongside, same era.
Robust watertight manifold surface generation method for shapenet models
Jingwei Huang, Hao Su, and Leonidas Guibas. 2018 · 2018
Later among the works it cites.
Approximate convex decomposition and transfer for animated meshes
Daniel Thul, L’ubor Ladickỳ, Sohyeon Jeong, and Marc Pollefeys. 2018 · 2018
Later among the works it cites.
Supervised fitting of geometric primitives to 3d point clouds. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition . 2652–2660
Lingxiao Li, Minhyuk Sung, Anastasia Dubrovina, Li Yi, and Leonidas J Guibas. 2019 · 2019
Later among the works it cites.
Structurenet: Hierarchical graph networks for 3d shape generation
Kaichun Mo, Paul Guerrero, Li Yi, Hao Su, Peter Wonka, Niloy Mitra, and Leonidas J Guibas. 2019 · 2019
Later among the works it cites.
Superquadrics revisited: Learning 3d shape parsing beyond cuboids. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition . 10344–10353
Despoina Paschalidou, Ali Osman Ulusoy, and Andreas Geiger. 2019 · 2019
Later among the works it cites.
Learning adaptive hierarchical cuboid abstractions of 3d shape collections
Chun-Yu Sun, Qian-Fang Zou, Xin Tong, and Yang Liu. 2019 · 2019
Later among the works it cites.
Bsp-net: Generating compact meshes via binary space partitioning. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition . 45–54
Zhiqin Chen, Andrea Tagliasacchi, and Hao Zhang. 2020 · 2020
Later among the works it cites.
Cvxnet: Learnable convex decomposition. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition . 31–44
Boyang Deng, Kyle Genova, Soroosh Yazdani, Sofien Bouaziz, Geoffrey Hinton, and Andrea Tagliasacchi. 2020 · 2020
Later among the works it cites.
Learning generative models of shape handles. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition . 402–411
Matheus Gadelha, Giorgio Gori, Duygu Ceylan, Radomir Mech, Nathan Carr, Tamy Boubekeur, Rui Wang, and Subhransu Maji. 2020 · 2020
Later among the works it cites.
Learning unsupervised hierarchical part decomposition of 3d objects from a single rgb image. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition . 1060–1070
Despoina Paschalidou, Luc Van Gool, and Andreas Geiger. 2020 · 2020
Later among the works it cites.
Deep parametric shape predictions using distance fields. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition . 561–570
Dmitriy Smirnov, Matthew Fisher, Vladimir G Kim, Richard Zhang, and Justin Solomon. 2020 · 2020
Later among the works it cites.
Sapien: A simulated part-based interactive environment. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition . 11097–11107
Fanbo Xiang, Yuzhe Qin, Kaichun Mo, Yikuan Xia, Hao Zhu, Fangchen Liu, Minghua Liu, Hanxiao Jiang, Yifu Yuan, He Wang, et al · 2020
Later among the works it cites.
DeepMetaHandles: Learning Deformation Meta-Handles of 3D Meshes with Biharmonic Coordinates. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition . 12–21
Minghua Liu, Minhyuk Sung, Radomir Mech, and Hao Su. 2021 · 2021
Later among the works it cites.
ManiSkill: Learning-from-Demonstrations Benchmark for Generalizable Manipulation Skills
Tongzhou Mu, Zhan Ling, Fanbo Xiang, Derek Yang, Xuanlin Li, Stone Tao, Zhiao Huang, Zhiwei Jia, and Hao Su. 2021 · 2021
Later among the works it cites.