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

namespace  HuginLines

Defines

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

Functions

BImage HuginLines::edgeMap2linePts (BImage &input)
float HuginLines::ccdist (int dx, int dy)
float HuginLines::eudist (int dx, int dy)
static double HuginLines::CtoAcc (vector< Point2D > &pts, int start, int count, double &C, double &A)
static double HuginLines::CtoAeu (vector< Point2D > &pts, int start, int count, double &C, double &A)
float HuginLines::scurv (Point2D &l, Point2D &m, Point2D &r)
void HuginLines::vcurv (Point2D &l, Point2D &m, Point2D &r, float &vx, float &vy)
static int HuginLines::lineFilter (vector< Point2D > &pts, int lmin, double flpix, double xcen, double ycen)
int HuginLines::linePts2lineList (BImage &img, int minsize, double flpix, Lines &lines)


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.


Define Documentation

#define N8_bg   255

Definition at line 44 of file FindN8Lines.cpp.

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

#define N8_end   1

Definition at line 45 of file FindN8Lines.cpp.

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

#define N8_mid   96

Definition at line 46 of file FindN8Lines.cpp.

Referenced by HuginLines::edgeMap2linePts().


Generated on 25 Nov 2014 for Hugintrunk by  doxygen 1.4.7