Thingi10K: A Dataset of 10,000 3D-Printing Models
arXiv:1605.04797
Abstract
Empirically validating new 3D-printing related algorithms and implementations requires testing data representative of inputs encountered \emph{in the wild}. An ideal benchmarking dataset should not only draw from the same distribution of shapes people print in terms of class (e.g., toys, mechanisms, jewelry), representation type (e.g., triangle soup meshes) and complexity (e.g., number of facets), but should also capture problems and artifacts endemic to 3D printing models (e.g., self-intersections, non-manifoldness). We observe that the contextual and geometric characteristics of 3D printing models differ significantly from those used for computer graphics applications, not to mention standard models (e.g., Stanford bunny, Armadillo, Fertility). We present a new dataset of 10,000 models collected from an online 3D printing model-sharing database. Via analysis of both geometric (e.g., triangle aspect ratios, manifoldness) and contextual (e.g., licenses, tags, classes) characteristics, we demonstrate that this dataset represents a more concise summary of real-world models used for 3D printing compared to existing datasets. To facilitate future research endeavors, we also present an online query interface to select subsets of the dataset according to project-specific characteristics. The complete dataset and per-model statistical data are freely available to the public.
Cited by in corpus (37)
- Neural Dual Contouring
- Neural Marching Cubes
- Orienting Point Clouds with Dipole Propagation
- On the Effectiveness of Weight-Encoded Neural Implicit 3D Shapes
- Fit4CAD: A point cloud benchmark for fitting simple geometric primitives in CAD objects
- SimJEB: Simulated Jet Engine Bracket Dataset
- Geometrical discretisations for unfitted finite elements on explicit boundary representations
- Neural-IMLS: Self-supervised Implicit Moving Least-Squares Network for Surface Reconstruction
- SAPE: Spatially-Adaptive Progressive Encoding for Neural Optimization
- ShapeFindAR: Exploring In-Situ Spatial Search for Physical Artifact Retrieval using Mixed Reality
- Neural Implicit Surface Evolution
- P2M: A Fast Solver for Querying Distance from Point to Mesh Surface
- 3D Single-pixel imaging with active sampling patterns and learning based reconstruction
- Fusion 360 Gallery: A Dataset and Environment for Programmatic CAD Construction from Human Design Sequences
- Symmetric Volume Maps: Order-Invariant Volumetric Mesh Correspondence with Free Boundary
- Fast Evaluation of Smooth Distance Constraints on Co-Dimensional Geometry
- IntrA: 3D Intracranial Aneurysm Dataset for Deep Learning
- Shape As Points: A Differentiable Poisson Solver
- Deep Differentiable Grasp Planner for High-DOF Grippers
- Space-time unfitted finite elements on moving explicit geometry representations
- Learning Self-Prior for Mesh Inpainting Using Self-Supervised Graph Convolutional Networks
- Winding Clearness for Differentiable Point Cloud Optimization
- Toroidal density-equalizing map for genus-one surfaces
- A Revisit of Shape Editing Techniques: from the Geometric to the Neural Viewpoint
- Deterministic Linear Time Constrained Triangulation using Simplified Earcut
- Learning to Accelerate Decomposition for Multi-Directional 3D Printing
- Deep Hybrid Self-Prior for Full 3D Mesh Generation
- Learnable Triangulation for Deep Learning-based 3D Reconstruction of Objects of Arbitrary Topology from Single RGB Images
- SliceHub: Augmenting Shared 3D Model Repositories with Slicing Results for 3D Printing
- Multispectral CT Denoising via Simulation-Trained Deep Learning: Experimental Results at the ESRF BM18
- Neural Contours: Learning to Draw Lines from 3D Shapes
- B/Surf: Interactive Bézier Splines on Surfaces
- On Designing GPU Algorithms with Applications to Mesh Refinement
- Obtaining a Canonical Polygonal Schema from a Greedy Homotopy Basis with Minimal Mesh Refinement
- Octahedral Frames for Feature-Aligned Cross-Fields
- Theoretical and Empirical Analysis of a Fast Algorithm for Extracting Polygons from Signed Distance Bounds
- Robust Voxelization and Visualization by Improved Tetrahedral Mesh Generation