C# Class Accord.Math.Geometry.DiscreteCurveEvolution

Discrete Curve Evolution.

The Discrete Curve Evolution (DCE) algorithm can be used to simplify contour curves. It can preserve the outline of a shape by preserving its most visually critical points.

The implementation available in the framework has been contributed by Diego Catalano, from the Catalano Framework for Java. The original work has been developed by Dr. Longin Jan Latecki, and has been redistributed under the LGPL with explicit permission from the original author, as long as the following references are acknowledged in derived applications:

L.J. Latecki and R. Lakaemper; Convexity rule for shape decomposition based on discrete contour evolution. Computer Vision and Image Understanding 73 (3), 441-454, 1999.

References: L.J. Latecki and R. Lakaemper; Convexity rule for shape decomposition based on discrete contour evolution. Computer Vision and Image Understanding 73 (3), 441-454, 1999.

Inheritance: IShapeOptimizer

Show file Open project: accord-net/framework

Public Methods

Method	Description
DiscreteCurveEvolution ( ) : System	Initializes a new instance of the DiscreteCurveEvolution class.
DiscreteCurveEvolution ( int vertices ) : System	Initializes a new instance of the DiscreteCurveEvolution class.
OptimizeShape ( List shape ) : List	Optimize specified shape.

Private Methods

Method	Description
winkel ( List z ) : double[]

Method Details

DiscreteCurveEvolution() public method

Initializes a new instance of the DiscreteCurveEvolution class.

public DiscreteCurveEvolution ( ) : System
return	System

DiscreteCurveEvolution() public method

Initializes a new instance of the DiscreteCurveEvolution class.

public DiscreteCurveEvolution ( int vertices ) : System
vertices	int	Number of vertices.
return	System

OptimizeShape() public method

Optimize specified shape.

public OptimizeShape ( List shape ) : List
shape	List	Shape to be optimized.
return	List