Traverse Computations - Theory & Concepts

Traverse Computations

$Learning Objectives$

Understand the differences between open and closed traverses.
Calculate latitudes, departures, and linear error of closure.
Apply different traverse balancing methods (Compass, Transit).

Traverse computations form the backbone of property surveys, route planning, and construction control. This lesson covers the computational methods to resolve traverse legs into coordinate components, calculate errors, and distribute corrections.

$Traverse$

A series of consecutive lines whose lengths and directions are determined from field measurements. Used to establish control points and locate details.

Types of Traverses

$Classifications$

Open Traverse: Does not return to the starting point or close upon a point of known position.
- Use: Route surveys (roads, pipelines).
- Check: No geometric check available unless tied to control points.
Closed Traverse:
- Loop Traverse: Begins and ends at the same point.
- Link Traverse: Begins and ends at points of known position.
- Use: Property boundaries, construction control.
- Check: Sum of angles and coordinates must close.

$Interactive Traverse Visualization$

Adjust the traverse distance and azimuth below to immediately calculate and visualize the resulting latitude and departure components.

Latitudes and Departures Simulator

Calculate latitude and departure from a given distance and azimuth.

Distance (m)150.0

Azimuth (°)60.0

Results

\text{Lat} = D \cos(\theta) = 75.00 \text{ m}

\text{Dep} = D \sin(\theta) = 129.90 \text{ m}

Methods of Traversing

$Field Methods$

Interior Angle Traverse: Measuring the angles inside a closed polygon. The sum of the angles is checked against $(n-2) \times 180^\circ$ .
Deflection Angle Traverse: Measuring the angle by which the next line deflects from the prolongation of the previous line (Right or Left). Common in route surveys (open traverses).
Azimuth Traverse: Measuring the azimuth of each line directly using a compass or by backsighting and turning the angle. It allows for quick calculation of latitudes and departures without intermediate bearing conversions.

Latitudes and Departures

$Coordinate Projections$

To plot a traverse or compute coordinates, each course is resolved into two orthogonal components known as latitude and departure.

North Latitude: Positive ( $+$ )
South Latitude: Negative ( $-$ )
East Departure: Positive ( $+$ )
West Departure: Negative ( $-$ )

Latitude

The projection of a traverse line on the North-South meridian.

L = D \cos \alpha

Variables

Symbol	Description	Unit
$L$	Latitude	m
$D$	Length of the traverse line	m
$\alpha$	Azimuth or bearing angle of the line	deg

Departure

The projection of a traverse line on the East-West line.

D_{ep} = D \sin \alpha

Variables

Symbol	Description	Unit
$D_{ep}$	Departure	m
$D$	Length of the traverse line	m
$\alpha$	Azimuth or bearing angle of the line	deg

Error of Closure

$Understanding Closure Errors$

In a theoretically perfect closed loop traverse, the algebraic sum of latitudes ( $\Sigma L$ ) and departures ( $\Sigma D_{ep}$ ) should be zero. Due to unavoidable field errors, they are usually not zero. The difference represents the closure error.

Linear Error of Closure (LEC)

The straight-line distance from the starting point to the computed end point.

LEC = \sqrt{(\Sigma L)^2 + (\Sigma D_{ep})^2}

Variables

Symbol	Description	Unit
$LEC$	Linear Error of Closure	m
$\Sigma L$	Sum of latitudes	m
$\Sigma D_{ep}$	Sum of departures	m

Relative Error of Closure (REC)

A measure of precision expressed as a fraction, typically normalized to a numerator of 1 (e.g., 1:5000).

REC = \frac{LEC}{\Sigma D} = \frac{1}{\Sigma D / LEC}

Variables

Symbol	Description	Unit
$REC$	Relative Error of Closure	unitless
$LEC$	Linear Error of Closure	m
$\Sigma D$	Total length (perimeter) of the traverse	m

$Interactive Traverse Tool$

Visualize a traverse and automatically calculate closure errors and area.

Traverse & Area Tool

Traverse Lines

Length (m)

Azimuth (°)

Length (m)

Azimuth (°)

Length (m)

Azimuth (°)

Length (m)

Azimuth (°)

Plot

Closure Error: 0.0000 m

Precision: 1:3,109,888,511,975,475

Area: 15000.00 m²

* Y-axis is inverted for SVG rendering (North is up)

Balancing a Traverse

$Adjustment Objectives$

Balancing involves adjusting the latitudes and departures so their algebraic sums become zero (for loop traverses) or match the known difference (for link traverses). Various mathematical methods are used based on the precision of the underlying field measurements.

1. Compass Rule (Bowditch Rule)

$Compass Rule Assumptions$

Assumption: Errors in distance and angle are equal.
Application: Used for most standard surveys where a tape and compass or transit are used.

Compass Rule Latitude Correction

Distributes latitude correction proportionally to the length of the individual side.

c_L = -\Sigma L \left(\frac{d}{\Sigma D}\right)

Variables

Symbol	Description	Unit
$c_L$	Correction for latitude	m
$\Sigma L$	Total error in latitudes	m
$d$	Length of the specific course	m
$\Sigma D$	Total perimeter of the traverse	m

Compass Rule Departure Correction

Distributes departure correction proportionally to the length of the individual side.

c_D = -\Sigma D_{ep} \left(\frac{d}{\Sigma D}\right)

Variables

Symbol	Description	Unit
$c_D$	Correction for departure	m
$\Sigma D_{ep}$	Total error in departures	m
$d$	Length of the specific course	m
$\Sigma D$	Total perimeter of the traverse	m

2. Transit Rule

$Transit Rule Assumptions$

Assumption: Angular errors are less than linear errors. It assumes the direction of lines is more certain than their lengths. The theoretical basis is that coordinate magnitudes dictate the error.
Application: Used when angles are measured more precisely than distances (e.g., precise theodolite with stadia distance).

Transit Rule Latitude Correction

Distributes latitude correction proportionally to the absolute magnitude of the latitude.

c_L = -\Sigma L \left(\frac{|L|}{\Sigma |L|}\right)

Variables

Symbol	Description	Unit
$c_L$	Correction for latitude	m
$\Sigma L$	Total error in latitudes	m
$\|L\|$	Absolute value of the latitude of the specific course	m
$\Sigma \|L\|$	Sum of the absolute values of all latitudes	m

Transit Rule Departure Correction

Distributes departure correction proportionally to the absolute magnitude of the departure.

c_D = -\Sigma D_{ep} \left(\frac{|D_{ep}|}{\Sigma |D_{ep}|}\right)

Variables

Symbol	Description	Unit
$c_D$	Correction for departure	m
$\Sigma D_{ep}$	Total error in departures	m
$\|D_{ep}\|$	Absolute value of the departure of the specific course	m
$\Sigma \|D_{ep}\|$	Sum of the absolute values of all departures	m

3. Crandall's Method

$Crandall's Method Assumptions$

Assumption: All angular errors are completely eliminated (assumed perfect) before adjusting linear distances. It distributes the closure error entirely to the distance measurements based on a least-squares principle.
Mathematical Concept: The sum of the squares of the distance corrections, weighted inversely by their expected precision, is minimized ( $\Sigma (v^2/w) \to \text{min}$ , where $v$ is the residual and $w$ is the weight).
Application: Used when angular measurements are exceptionally more precise than distance measurements.

4. Least Squares Method

$Least Squares Adjustments$

Assumption: The sum of the squares of the weighted residuals is minimized.
Application: The most mathematically rigorous method for adjusting any traverse or survey network. Best suited for complex networks with redundant measurements. Easily handled by modern surveying software.

Traverse Closure and Balancing

Classify traverse control, compute coordinate closure, select a justified balancing method, and verify the adjusted endpoint.

A loop closes to the same start point; a link has known coordinates at both endpoints. An open traverse without an independent known endpoint has no geometric closure check and must not be balanced from an assumed closure. For an interior-angle loop, check the sum against (n−2)·180° and apply only a project-approved angular adjustment before deriving directions; this lesson gives no universal tolerance or angle-distribution rule. For a link, coordinate misclosure is measured against the known endpoint differences. Judge linear closure by the governing survey tolerance; the lesson provides no numeric acceptance limit.

Traverse observations → Confirm endpoint control coordinates; Confirm endpoint control coordinates → Returns to starting point?; Returns to starting point? — Yes → Classify as loop traverse; Returns to starting point? — No → Both endpoint coordinates known?; Both endpoint coordinates known? — Yes → Classify as link traverse; Both endpoint coordinates known? — No → Hold: open traverse unchecked; Classify as loop traverse → Interior-angle loop?; Classify as link traverse → Use observed azimuths / deflections; Interior-angle loop? — No → Use observed azimuths / deflections; Interior-angle loop? — Yes → Check Σθ against (n−2)·180°; Check Σθ against (n−2)·180° → Within project angle tolerance?; Within project angle tolerance? — Yes → Adjust per project rule; derive directions; Within project angle tolerance? — No → Review notes; reobserve if needed; Review notes; reobserve if needed → Confirm endpoint control coordinates; Adjust per project rule; derive directions → Compute latitude and departure; Use observed azimuths / deflections → Compute latitude and departure; Compute latitude and departure → Set loop or link closure target; Set loop or link closure target → Compute LEC and relative closure; Compute LEC and relative closure → Within specified closure tolerance?; Within specified closure tolerance? — No → Check control, notes and arithmetic; Within specified closure tolerance? — Yes → Complex / redundant network or weights known?; Check control, notes and arithmetic → Confirm endpoint control coordinates; Complex / redundant network or weights known? — Yes → Least squares with defensible weights; Complex / redundant network or weights known? — No → Equal angular / linear precision?; Equal angular / linear precision? — Yes → Compass Rule: corrections ∝ course length; Equal angular / linear precision? — No → Angles more precise than distances?; Angles more precise than distances? — Yes → Angles treated as error-free?; Angles more precise than distances? — No → Hold: establish precision model; Angles treated as error-free? — Yes → Crandall: adjust distances only; Angles treated as error-free? — No → Transit Rule: weight by |L| and |Dep|; Least squares with defensible weights → Apply selected adjustment; recompute coordinates; Compass Rule: corrections ∝ course length → Apply selected adjustment; recompute coordinates; Crandall: adjust distances only → Apply selected adjustment; recompute coordinates; Transit Rule: weight by |L| and |Dep| → Apply selected adjustment; recompute coordinates; Apply selected adjustment; recompute coordinates → Adjusted endpoint matches target?; Adjusted endpoint matches target? — Yes → Report adjusted coordinates and method; Adjusted endpoint matches target? — No → Hold: closure not verified

Traverse observations: terminator. Begin with field-measured course lengths and directions or angles.
Confirm endpoint control coordinates: process. Verify start and end point identities and the known coordinate control used for closure.
Returns to starting point?: decision. A traverse that returns to the same point is a loop traverse.
Classify as loop traverse: process. The coordinate closure target is zero net latitude and zero net departure.
Both endpoint coordinates known?: decision. Distinct known start and end coordinates provide the closure target for a link traverse.
Classify as link traverse: process. Compare computed coordinate differences with the known end-minus-start northing and easting differences.
Hold: open traverse unchecked: terminator. An open traverse without a tie to known control has no geometric closure check. Obtain independent control or report it as unchecked; do not apply a closure adjustment.
Interior-angle loop?: decision. Only a closed polygon observed by interior angles uses the (n−2)·180° angular-sum check described in this lesson.
Check Σθ against (n−2)·180°: process. Compute the interior-angle sum misclosure for the closed polygon.
Within project angle tolerance?: decision. Use the governing project criterion; this lesson supplies no numeric angular tolerance.
Review notes; reobserve if needed: process. Resolve an unacceptable angular misclosure before computing course directions and coordinate closure.
Adjust per project rule; derive directions: process. Apply only an approved angular adjustment, then use verified angles to determine course directions.
Use observed azimuths / deflections: process. Use measured course azimuths or deflection-angle directions.
Compute latitude and departure: process. For azimuth α from north, use L = D cos α and Dep = D sin α. Apply quadrant signs for bearings: North/East are positive and South/West are negative.
Set loop or link closure target: process. For a loop, target (ΣL, ΣDep) = (0, 0). For a link, target (ΔN, ΔE) = (Nend−Nstart, Eend−Estart).
Compute LEC and relative closure: process. For a loop, use (ΣL, ΣDep); for a link, subtract known (ΔN, ΔE). Compute LEC = √(misclosureN² + misclosureE²) and REC = LEC / total traverse length.
Within specified closure tolerance?: decision. Compare with the survey or project acceptance criterion before balancing; no universal threshold is supplied in this lesson.
Check control, notes and arithmetic: process. Investigate verified blunders, control coordinates, units, and field observations; reobserve when needed.
Complex / redundant network or weights known?: decision. Least squares is suited to complex networks with redundant observations and can use defensible observation weights.
Least squares with defensible weights: process. Minimize the weighted residuals using measurement precision information.
Equal angular / linear precision?: decision. The Compass (Bowditch) Rule assumes equal angular and linear measurement errors.
Compass Rule: corrections ∝ course length: process. Distribute latitude and departure corrections in proportion to each course length.
Angles more precise than distances?: decision. The Transit Rule applies when angular errors are smaller than linear distance errors.
Angles treated as error-free?: decision. Crandall's method assumes angular errors are completely eliminated before adjusting distances.
Crandall: adjust distances only: process. Hold accepted directions fixed and distribute closure through the distance observations.
Transit Rule: weight by |L| and |Dep|: process. Distribute latitude corrections by absolute latitude and departure corrections by absolute departure.
Hold: establish precision model: terminator. If the stated rule assumptions do not fit, establish defensible observation weights or obtain more control before balancing.
Apply selected adjustment; recompute coordinates: process. Apply the chosen rule to its applicable observations or course components, then recompute adjusted coordinates.
Adjusted endpoint matches target?: decision. Check zero net latitude/departure for a loop or agreement with the known link endpoint, allowing only documented rounding.
Hold: closure not verified: terminator. Review correction sums, method assumptions, weights, arithmetic, and rounding; repeat the adjustment before reporting coordinates.
Report adjusted coordinates and method: terminator. Document closure, relative precision, adjustment rule, corrected coordinates, and control endpoints.

Key Takeaways

Latitude and Departure: Calculated as $D \cos \alpha$ (North-South) and $D \sin \alpha$ (East-West) respectively.
Linear Error of Closure (LEC): Indicates the actual distance between the start and computed end point, computed as $\sqrt{(\Sigma L)^2 + (\Sigma D_{ep})^2}$ .
Compass Rule: Distributes corrections proportional to the side lengths; used when distance and angle precisions are equal.
Transit Rule: Distributes corrections proportional to latitude and departure magnitudes; used when angles are more precise than distances.
Modern Balancing: Least Squares methods provide the most statistically rigorous adjustments for complex surveying networks.

Previous TopicMeasurement of Angles and Directions - Theory & Concepts

Quiz Me

Next TopicArea Computations - Theory & Concepts

Prev Next

Quiz Me