Search

A grid unfolding without refinement method for a new sub-class of polycubes, called Manhattan Towers with a H-convex base, is proposed. Such polycubes can be seen both as a Manhattan Tower and as an orthostack. A direct extension of this algorithm to Up-and-Down Orthoterrains is also presented. [ABSTRACT FROM AUTHOR]

The bisector function is an important tool for analyzing and filtering Euclidean skeletons. In this paper, we are proposing a new way to compute 2D and 3D discrete bisector function based on annuli. From a continuous point of view, a point that belongs to the medial axis is the center of a maximal ball that hits the background in more than one point. The maximal angle between those points is expected to be high for most of the object points and corresponds to the bisector angle. This logic is not really applicable in the discrete space since we may miss some background points that can lead to small bisector angles. In this work we use annuli to find the background points in order to compute the bisector angle. Our approach offers the possibility to change the thickness of the annulus at a given point and is thus flexible when computing skeletons. Our work can be extended to nD and we propose the nD algorithm. [ABSTRACT FROM AUTHOR]

In this paper we present a simple method to create general 3D digital surfaces of revolution based on a 2D implicit curve of revolution (therefore not limited to a circle) and a hand-drawn generatrix. Our method can handle any sequence of Euclidean 2D points, which represents a curve, as generatrix. One can choose the topology of the surface that may have 1-tunnels, 0-tunnels or no tunnels with applications in 3D printing for instance. An online tool that illustrates the method is proposed. [ABSTRACT FROM AUTHOR]