Linear Evaluation of Actual Points Program (LEAPP)

Authors

  • R. E. Zartman
  • C. Kroeker
  • E. B. Fish

Keywords:

linear evaluation, hough transform

Abstract

How one intuits a series of points that form one or more lines is a physiological and mathematical problem. To quantify the mathematical portion of this phenomenon, a Linear Evaluation of Actual Points Program (LEAPP) algorithm was written inc++. This program uses the Hough transform to convert Cartesian (x, y) coordi­ nates into Hough space (r, q). Line intersections in Cartesian space are represented by points of intersection or accumulations in Hough space. These intersections are stored in a temporary vote space matrix of size (n = 100, m = 180). Then values span the data set in incremental length units to the maximum Euclidean distance. The m values in the vote space matrix are the compass angles in degrees from 0˚ (North) to 180° (South). Based on the accumulation of this n by m matrix, physiographic lineations can be represented.

Downloads

Published

2016-05-10

How to Cite

Zartman, R. E., Kroeker, C., & Fish, E. B. (2016). Linear Evaluation of Actual Points Program (LEAPP). Texas Journal of Agriculture and Natural Resources, 13, 45–50. Retrieved from https://txjanr.agintexas.org/index.php/txjanr/article/view/181

Issue

Section

Research Articles