We present a novel means of algorithmically describing a growth process that is an extension of Lindenmayer’s Map L-systems. This growth process relies upon a set of rewrite rule...
We introduce a new representation for video which facilitates a number of common editing tasks. The representation has some of the power of a full reconstruction of 3D surface mod...
Alex Rav-Acha, Pushmeet Kohli, Carsten Rother, And...
Many algorithms in computer graphics improve their efficiency by using Hierarchical Space Subdivision Schemes (HS3), such as octrees, kD-trees or BSP trees. Such HS3 usually provi...
Tamy Boubekeur, Wolfgang Heidrich, Xavier Granier,...
We present a new method for decomposing a 3D voxel shape into disjoint segments using the shape's simplified surface-skeleton. The surface skeleton of a shape consists of 2D ...
Depth-map merging is one typical technique category for multi-view stereo (MVS) reconstruction. To guarantee accuracy, existing algorithms usually require either sub-pixel level s...