FindN8Lines.cpp File Reference

implementation of find lines algorithm More...

#include <assert.h>
#include "FindN8Lines.h"
#include <vigra/copyimage.hxx>
#include <vigra/pixelneighborhood.hxx>

Include dependency graph for FindN8Lines.cpp:

Go to the source code of this file.

Namespaces
	HuginLines

Macros
#define	N8_bg   255
#define	N8_end   1
#define	N8_mid   96

Functions
vigra::BImage	HuginLines::edgeMap2linePts (vigra::BImage &input)
	marks line point More...
float	HuginLines::ccdist (int dx, int dy)
float	HuginLines::eudist (int dx, int dy)
float	HuginLines::scurv (vigra::Point2D &l, vigra::Point2D &m, vigra::Point2D &r)
void	HuginLines::vcurv (vigra::Point2D &l, vigra::Point2D &m, vigra::Point2D &r, float &vx, float &vy)
static int	HuginLines::lineFilter (std::vector< vigra::Point2D > &pts, int lmin, double flpix, double xcen, double ycen)
int	HuginLines::linePts2lineList (vigra::BImage &img, int minsize, double flPix, Lines &lines)
	converts a linePts image to a list of lines More...

Detailed Description

implementation of find lines algorithm

Author

Thomas K. Sharpless

finds straightish, non-crossing lines in an edge map, using 8-neighborhood operations.

Definition in file FindN8Lines.cpp.

Macro Definition Documentation

#define N8_bg   255

Definition at line 39 of file FindN8Lines.cpp.

Referenced by HuginLines::edgeMap2linePts(), and HuginLines::linePts2lineList().

#define N8_end   1

Definition at line 40 of file FindN8Lines.cpp.

Referenced by HuginLines::edgeMap2linePts(), and HuginLines::linePts2lineList().

#define N8_mid   96

Definition at line 41 of file FindN8Lines.cpp.

Referenced by HuginLines::edgeMap2linePts().