Proceedings Article10.1109/PG.2007.43
Model Composition from Interchangeable Components
V. Kreavoy,Dan Julius,Alla Sheffer +2 more
- 29 Oct 2007
- pp 129-138
128
TL;DR: This work develops a method for computing a compatible segmentation of input models into meaningful, interchangeable components and demonstrates that the shuffling paradigm allows for easy and fast creation of a rich geometric content.
read more
Abstract: Following the increasing demand to make the creation and manipulation of 3D geometry simpler and more accessible, we introduce a modeling approach that allows even novice users to create sophisticated models in minutes. Our approach is based on the observation that in many modeling settings users create models which belong to a small set of model classes, such as humans or quadrupeds. The models within each class typically share a common component structure. Following this observation, we introduce a modeling system which utilizes this common component structure allowing users to create new models by shuffling interchangeable components between existing models. To enable shuffling, we develop a method for computing a compatible segmentation of input models into meaningful, interchangeable components. Using this segmentation our system lets users create new models with a few mouse clicks, in a fraction of the time required by previous composition techniques. We demonstrate that the shuffling paradigm allows for easy and fast creation of a rich geometric content.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Learning 3D mesh segmentation and labeling
Evangelos Kalogerakis,Aaron Hertzmann,Karan Singh +2 more
- 26 Jul 2010
TL;DR: This paper presents a data-driven approach to simultaneous segmentation and labeling of parts in 3D meshes, formulated as a Conditional Random Field model, with terms assessing the consistency of faces with labels, and terms between labels of neighboring faces.
Pix3D: Dataset and Methods for Single-Image 3D Shape Modeling
Xingyuan Sun,Jiajun Wu,Xiuming Zhang,Zhoutong Zhang,Chengkai Zhang,Tianfan Xue,Joshua B. Tenenbaum,William T. Freeman +7 more
- 12 Apr 2018
TL;DR: A novel model is designed that simultaneously performs 3D reconstruction and pose estimation; this multi-task learning approach achieves state-of-the-art performance on both tasks.
A probabilistic model for component-based shape synthesis
Evangelos Kalogerakis,Siddhartha Chaudhuri,Daphne Koller,Vladlen Koltun +3 more
- 01 Jul 2012
TL;DR: A new generative model of component-based shape structure is presented, which represents probabilistic relationships between properties of shape components, and relates them to learned underlying causes of structural variability within the domain.
Probabilistic reasoning for assembly-based 3D modeling
Siddhartha Chaudhuri,Evangelos Kalogerakis,Leonidas J. Guibas,Vladlen Koltun +3 more
- 25 Jul 2011
TL;DR: The probabilistic model is used to present components that are semantically and stylistically compatible with the 3D model that is being assembled, and experiments indicate that the probabilism model increases the relevance of presented components.
295
Co-Segmentation of 3D Shapes via Subspace Clustering
Ruizhen Hu,Lubin Fan,Ligang Liu +2 more
TL;DR: To fuse multiple features, this work proposes a new formulation of optimization with a consistent penalty, which facilitates both the identification of most similar patches and selection of master features for two similar patches.
190
References
Closed-form solution of absolute orientation using unit quaternions
TL;DR: A closed-form solution to the least-squares problem for three or more paints is presented, simplified by use of unit quaternions to represent rotation.
•Book
Stochastic Local Search: Foundations & Applications
Holger H. Hoos,Thomas Sttzle +1 more
- 17 Sep 2004
TL;DR: This prologue explains the background to SLS, and some examples of applications can be found in SAT and Constraint Satisfaction, as well as some of the algorithms used to solve these problems.
1.6K
Parts of recognition
TL;DR: In this article, the visual system decomposes shapes into parts, and uses a rule defining part boundaries rather than part shapes, exploiting a uniformity of nature, which allows an explanation of visual illusions.
1.3K
Variational shape approximation
David Cohen-Steiner,Pierre Alliez,Mathieu Desbrun +2 more
- 01 Aug 2004
TL;DR: A novel and versatile framework for geometric approximation of surfaces is presented, casting shape approximation as a variational geometric partitioning problem and using the concept of geometric proxies to drive the distortion error down through repeated clustering of faces into best-fitting regions.
Generalized multidimensional scaling: A framework for isometry-invariant partial surface matching
TL;DR: The generalized multidimensional scaling algorithm is introduced, a computationally efficient continuous optimization algorithm for finding the least distortion embedding of one surface into another that allows for both full and partial surface matching.
Related Papers (5)
Evangelos Kalogerakis,Aaron Hertzmann,Karan Singh +2 more
- 26 Jul 2010
Xiaobai Chen,Aleksey Golovinskiy,Thomas Funkhouser +2 more
- 27 Jul 2009