Scribd Logo
Upload

Welcome to Scribd!

  • A Simplified Algorithm For Straightness Error: P B Dhanish, Lecturer, Calicut Regional Engineering College

    Uploaded by

    anandnik
    30 views23 pages
    This document presents a simplified algorithm for determining straightness error. It begins by defining straightness error as the maximum distance between measurement points and an ideal line. It notes that commonly used ideal lines like the horizontal or endpoint lines do not minimize straightness error. The algorithm aims to find the ideal "minimum zone" line that minimizes the difference between maximum and minimum errors of the measurement points. The algorithm involves plotting points, drawing initial minimum zone lines, checking if all points fall within the zone, and discarding outlier points until all are within the zone to determine the optimal line that minimizes straightness error.

    Original Description:

    Original Title

    Straightness

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document presents a simplified algorithm for determining straightness error. It begins by defining straightness error as the maximum distance between measurement points and an ideal line. It notes that commonly used ideal lines like the horizontal or endpoint lines do not minimize straightness error. The algorithm aims to find the ideal "minimum zone" line that minimizes the difference between maximum and minimum errors of the measurement points. The algorithm involves plotting points, drawing initial minimum zone lines, checking if all points fall within the zone, and discarding outlier points until all are within the zone to determine the optimal line that minimizes straightness error.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as ppt, pdf, or txt
    30 views23 pages

    A Simplified Algorithm For Straightness Error: P B Dhanish, Lecturer, Calicut Regional Engineering College

    Uploaded by

    anandnik
    This document presents a simplified algorithm for determining straightness error. It begins by defining straightness error as the maximum distance between measurement points and an ideal line. It notes that commonly used ideal lines like the horizontal or endpoint lines do not minimize straightness error. The algorithm aims to find the ideal "minimum zone" line that minimizes the difference between maximum and minimum errors of the measurement points. The algorithm involves plotting points, drawing initial minimum zone lines, checking if all points fall within the zone, and discarding outlier points until all are within the zone to determine the optimal line that minimizes straightness error.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as ppt, pdf, or txt
    of 23

    A simplified algorithm for straightness error

    P B Dhanish, Lecturer, Calicut Regional Engineering College

    What is straightness error?


    The total maximum distance between the individual points and an ideal line

    How to determine the ideal line?

    Straightness error with respect to the horizontal line


    6 5 4 3 2 1 0 0 100 200 300 400 500 600

    Ideal line

    Straightness error with respect to the end-point line


    6 5 4 3 2 1 0 0 100 200 300 400 500 600

    Straightness error with respect to the least squares line


    6 5 4 3 2 1 0 0 100 200 300 400 500 600

    Whats wrong with these lines?


    These ideal lines do not give the minimum value of straightness error The straightness error is about 20% higher compared to the minimum value

    How can we obtain the Minimum Zone Straightness Error?


    Several methods have been attempted

    Murthy & Abdin, 1980


    Monte Carlo technique Simplex search technique Does not guarantee minimum

    Dhanish & Shunmugam, 1992


    A general algorithm for form error Now simplified for the case of straightness error Too complicated?

    Orady, Li & Chen, 2000


    Non-linear optimization A modified simplex search, does not guarantee minimum

    Why another method?


    Several methods available, but Too complicated? Do not guarantee minimum
    No criterion for optimality Local minima adversely affects search

    DEFINITION OF THE PROBLEM


    yi - the actual surface xi - distance from the origin

    Find ideal line pi = y0 + l0xi such that the straightness error is a minimum

    Straightness error h = emax emin


    where ei = pi yi emax is max of ei emin is min of ei

    To find y0 and l0 such that h is a minimum

    The algorithm

    Step 1: Plot the points to scale


    6 5 4 3 2 1 0 0 100 200 300 400 500 600

    Step 2: Choose 3 points Draw the minimum zone lines


    6 5 4 3 2 1 0 0 100 200 300 400 500 600

    Step 3: Check if all points in zone?


    If NO, find point of supreme error
    6 5 4 3 2 1 0 0 100 200 300 400 500 600

    Step 4:Discard point such that errors are alternating


    6 5 4 3 2 1 0 0 100 200 300 400 500 600

    Step 5: Repeat till all points are within zone


    6 5 4 3 2 1 0 0 100 200 300 400 500 600

    A simple algorithm has been presented

    You might also like