Gallery

: Comparison between two convolution kernels (constant convolution kernel and Gaussian Kernel)

: Normal vector estimation based on a convolution kernel on elementary normal vector based on a convolution kernel on elementary normal vector

: Marching-cubes surface of lobster.vol at isovalue 40

: Extraction of implicit polynomial surface “3*x^2-2*y^2+z^3+5y^2*(z-1)*(z+1)”

: Extraction of surface “(x^2+y^2+2z^2-1)*(z^2x-0.1)” defined by some implicit polynomial

: Extraction of implicit polynomial surface “Miau”

: Extraction of surface “durchblick” defined by some implicit polynomial

: Extraction of surface “crixxi” defined by some implicit polynomial

: Boundary and frontiers in a labelled image

: Marching-cube surface or triangulation of digital surface “cat10.vol”

: Breadth-first traversal onto the “lobster” digital surface

: Saturated decomposition of a digital curve inti digital circular arcs.

: Distance map from a knot withing a wood beam

: DGtal used in a software of 3D branch measurements

: Extraction of connected Signed Khalimsky Cell from DGtalSet

: Tracking 2D surfel boundary from single surfel Cell of 3D Khalimsky Space

: Displaying Khalimsky Signed Cells in 3D

: Displaying Khalimsky Cells in 3D

: Extraction and selection of boundary level sets

: 2D contour extraction in the Khalimsky cellular model.

: Visualisation of 3D object border with ClippingPlane objects

: Display of 18-6 adjacency from two 18-6 objects

: 3D Domain visualization with three digital sets

: 3D Domain visualization with some elements (domain displayed in “Paving” mode)

: 3D Domain visualization with some elements (domain displayed in “Grid” mode)

: 3D Domain visualization with two digital sets

: 3D homotopic shape thinning in the (6,26)-adjacency.

: Distance Transformation using the Euclidean distance using a random set of seeds.

: Distance Transformation in 3D using the Manhattan distance (l_1).

: Distance Transformation using the Euclidean distance

: 3D Distance transformation using the chessboard (l_infinity) distance.

: 3D volume visualization

: Example of the decomposition of a simple 4-connected curve into maximal Discrete Straight Segments (greedy algorithm).

: Decomposition of a contour into standard Discrete Straight Segments using a greedy process.

: Visualisation of some iso contours

: Contour visualization with original source image

: Distance Transformation using the Euclidean distance using a random set of seeds.

: Distance Transformation in 2D using the Manhattan distance (l_1).

: Distance Transformation using the Chessboard (l_infinity) distance.

: 2D homotopic shape thinning in the (8,4)-adjacency

: 2D homotopic shape thinning in (4,8)-topology

: Examples of colormaps available in the DGtalBoard system.

: Implicit function representation on a classical ImageContainer.

: Implicit domain representation using a Pointerless QuadTree (a.k.a. HashTree in n-D).

: Filling of a 2D domain with (8,8)-adjacency.

: Filling of a 2D domain with (8,4)-adjacency.

: Filling of a 2D domain with (4,8)-adjacency.

: Filling of a 2D domain with (4,4)-adjacency.

: Border tracking and labelling using the 4-adjacency.

: Border tracking and labelling using the 8-adjacency.

Comments are closed.