Radar Vectors
FAA Order Cancelled Issued Sep 21, 2012 AFS-400 441 pages Copy saved Nov 18, 2026

Order 8260.58 United States Standard for Performance Based Navigation (PBN) Instrument Procedure Design

This document is cancelled. Cancelled by 8260.58A. Check the official source before relying on it.

Official source ↗ Open PDF

Federal Aviation Administration (FAA)

U.S. DEPARTMENT OF TRANSPORTATION ORDER FEDERAL AVIATION ADMINISTRATION I

8260.58 National Policy

Effective Date:

09/21/2012

SUBJ: United States Standard for Performance Based Navigation (PBN) Instrument

Procedure Design

This order provides a consolidated United States Performance Based Navigation (PBN) procedure design criteria.

U.S. DEPARTMENT OF TRANSPORTATION ORDER FEDERAL AVIATION ADMINISTRATION I

The PBN concept specifies aircraft area navigation (RNAV) system performance requirements in terms of accuracy, integrity, availability, continuity and functionality needed for the proposed operations in the context of a particular Airspace Concept. The PBN concept represents a shift from sensor-based to performance-based navigation. Performance requirements are identified in navigation specifications, which also identify the choice of navigation sensors and equipment that may be used to meet the performance requirements. These navigation specifications are defined at a sufficient level of detail to facilitate global harmonization by providing specific implementation guidance. John M. Allen John M. Allen Director, Flight Standards Service

Distribution: Electronic Only Initiated By: AFS-400

THIS PAGE INTENTIONALLY LEFT BLANK

THIS PAGE INTENTIONALLY LEFT BLANK

09/21/2012 8260.58

Table of Contents

Paragraph No. Page No.

VOLUME 1. GENERAL GUIDANCE AND INFORMATION

Chapter 1 General Information

1.0 Purpose of This Order … 1-1 1.1 Audience … 1-1 1.2 Where Can I Find This Order? … 1-1 1.3 Cancellation … 1-1

Chapter 2 Basic Criteria Information

Chapter 2 Basic Criteria Information

2.0 General … 2-1 2.1 Data Resolution … 2-1 2.2 TERPS Standard for Geodetic Constructions … 2-8

Chapter 3 Administrative Information

3.0 Distribution … 3-1 3.1 Definitions and/or Acronyms … 3-1 3.2 Information Update … 3-11

Appendix A TERPS Standards Formulas for Geodetic Calculations

Appendix A TERPS Standards Formulas for Geodetic Calculations

1.0 Purpose … A-1 2.0 Introduction … A-2 2.1 Data Structures … A-4 3.0 Basic Calculations … A-6 3.1 Iterative Approach … A-6 3.2 Starting Solutions … A-7 3.3 Tolerances … A-10 3.4 Direct and Inverse Algorithms … A-11 3.5 Geodesic Oriented at Specified Angle … A-14 3.6 Determine If Points Lies on Geodesic … A-16 3.7 Determine If Points Lies on Arc … A-18 3.8 Calculate Length of Fixed Radius Arc … A-21 3.9 Find Distance from Defining Geodesic to Locus … A-25 3.10 Project Point on Locus from Point on Defining Geodesic … A-26 3.11 Determine If Point Lies on Locus … A-27 3.12 Compute Course of Locus … A-29 4.0 Intersections … A-31 4.1 Intersection of Two Geodesics … A-31 4.2 Intersection of Two Arcs … A-36

i

09/21/2012 8260.58

Table of Contents

Paragraph No. Page No.

VOLUME 1. GENERAL GUIDANCE AND INFORMATION

VOLUME 1. GENERAL GUIDANCE AND INFORMATION

(CONTINUED)

Appendix A TERPS Standards Formulas for Geodetic Calculations (Continued)

4.3 Intersections of Arc and Geodesic … A-39 4.4 Arc Tangent to Two Geodesics … A-44 4.5 Intersections of Geodesic and Locus … A-48 4.6 Intersections of Arc and Locus … A-52 4.7 Intersections of Two Loci … A-55 4.8 Arc Tangent to Two Loci … A-58 5.0 Projections … A-63 5.1 Project Point to Geodesic … A-63 5.2 Project Point to Locus … A-68 5.3 Tangent Projection from Point to Arc … A-71 5.4 Project Arc to Geodesic … A-74 6.0 Calculate Angular Arc Extent … A-78 6.1 Converting Geodetic Latitude/Longitude to ECEF Coordinates … A-79 6.2 Signed Azimuth Difference … A-79 6.3 Approximate Fixed Radius Arc Length … A-80 7.0 Sample Function Test Results … A-81

VOLUME 2. UNITED STATES STANDARD FOR

VOLUME 2. UNITED STATES STANDARD FOR

HELICOPTER AREA NAVIGATION (RNAV)

Reserved

VOLUME 3. RNAV AND RNP 1 DEPARTURE PROCEDURES

Chapter 1 General Criteria

1.0 Criteria Design Standards … 1-1 1.1 Fix Use … 1-1 1.2 Fix Definition … 1-1 1.3 Course Change at Fixes … 1-2 1.4 VA and VI Leg Length Standards … 1-3 1.5 Additional Leg Length Standards … 1-3 1.6 Segment Full Width Standards … 1-4 1.7 CF Leg Magnetic Variation Reference … 1-4 1.8 Naming Conventions, Computer Codes, Charting and Documentation Instructions … 1-4

Chapter 1 General Criteria

ii

09/21/2012 8260.58

Table of Contents

Paragraph No. Page No.

VOLUME 3. RNAV AND RNP 1 DEPARTURE PROCEDURES

(CONTINUED)

Chapter 2 Construction Calculations

2.0 Projected Altitude (Altproj) … 2-1 2.1 True Airspeed (VKTAS) … 2-1 2.2 Tailwind (VKTW) … 2-1 2.3 Turn Radius (R) … 2-1 2.4 Bank Angle … 2-2 2.5 Distance of Turn Anticipation (DTA) … 2-2 2.6 VA Segment Distance … 2-2 2.7 VA Segment Termination Altitude … 2-3 2.8 VA-DF Feasibility … 2-3 2.9 ROC, CG, and Climb Gradient Termination Altitude Calculation … 2-3

Chapter 3 Area Construction

Chapter 3 Area Construction

3.0 Segment Areas … 3-1 3.1 Course Change Limitations … 3-1 3.2 Fly-By Fix Turn Construction … 3-1 3.3 Fly-Over Fix Turn Construction … 3-2 3.4 ICA … 3-8 3.5 VA Legs … 3-9 3.6 VI Legs … 3-9 3.7 VA or VI Leg Construction … 3-9 3.8 VA-DF Leg Combinations … 3-9 3.9 Standard VI-CF Leg Combination Construction, 90 degrees … 3-15 3.10 Minimum VI-CF Leg Combination Construction, 90 degrees … 3-17 3.11 Departure Area Width Joining En Route Width or Airway … 3-22 3.12 Departure Altitude … 3-22 3.13 End of Departure … 3-22

Chapter 4 OEA Assessment

Chapter 4 OEA Assessment

4.0 Obstacle Evaluation … 4-1 4.1 Required Obstacle Clearance (ROC) … 4-1 4.2 Climb Gradient (CG) … 4-1 4.3 Climb in Holding Pattern … 4-1

iii

09/21/2012 8260.58

Table of Contents

Paragraph No. Page No.

VOLUME 3. RNAV AND RNP 1 DEPARTURE PROCEDURES

(CONTINUED)

Chapter 5 VA-DF Leg Length Analysis

Chapter 5 VA-DF Leg Length Analysis

5.0 Purpose … 5-1 5.1 Earliest TP … 5-1 5.2 Latest TP … 5-1 5.3 Calculations … 5-1

VOLUME 4. TERMINAL ARRIVAL AREA (TAA) DESIGN CRITERIA

Chapter 1 TAA and Approach Segment Construction

1.0 Minimum Safe/Sector Altitude (MSA) … 1-1 1.1 Initial, Intermediate, Final, and Missed Approach Segments … 1-1 1.2 Standard TAA Areas … 1-4 1.3 Altitude Selection Within TAA … 1-8 1.4 TAA Area Modifications … 1-12 1.5 Connection to En Route Structure … 1-15 1.6 Airspace Requirements … 1-16

Chapter 2 Documentation and Processing

Chapter 2 Documentation and Processing

2.0 Instructions for 8260-Series Forms … 2-1 2.1 Documenting the TAA … 2-1 2.2 Form 8260-9, SIAP Data Record … 2-2

VOLUME 5. STANDARD FOR REQUIRED NAVIGATION PERFORMANCE (RNP) APPROACH PROCEDURES WITH AUTHORIZATION REQUIRED (AR)

Chapter 1 Basic Criteria Information

Chapter 1 Basic Criteria Information

1.0 Design Concept … 1-1 1.1 Applicability … 1-2 1.2 Procedure Identification … 1-2 1.3 Published Minimums … 1-2

iv

09/21/2012 8260.58

Table of Contents

Paragraph No. Page No.

VOLUME 5. STANDARD FOR REQUIRED NAVIGATION PERFORMANCE (RNP) APPROACH PROCEDURES WITH AUTHORIZATION REQUIRED (AR)

(CONTINUED)

Chapter 1 Basic Criteria Information (Continued)

Chapter 1 Basic Criteria Information (Continued)

1.4 Calculating True Airspeed, Turn Radius, and Bank Angle … 1-3 1.5 DTA Application … 1-3 1.6 Calculation of Visibility Minimums … 1-3

Chapter 2 Terminal Segments

2.0 General … 2-1 2.1 Configuration … 2-1 2.2 RNP Segment Width … 2-2 2.3 RNP Segment Length … 2-2 2.4 RNP Segment Descent Gradient … 2-3 2.5 RNP Segment ROC … 2-3 2.6 TF Leg Segment … 2-4 2.7 RF Leg Segment … 2-6 2.8 Changing Segment Width (RNP Values) … 2-6 2.9 Effects of Cold Temperature in the Intermediate Segment … 2-8

Chapter 3 Final Approach Segment (FAS)

Chapter 3 Final Approach Segment (FAS)

3.0 General … 3-1 3.1 Reserved … 3-1 3.2 GPA and TCH Requirements … 3-1 3.3 Turns in the FAS … 3-2 3.4 Determining PFAF Location … 3-3 3.5 Final Segment OEA … 3-7 3.6 Visual Segment Evaluation … 3-12

v

09/21/2012 8260.58

Table of Contents

Paragraph No. Page No.

VOLUME 5. STANDARD FOR REQUIRED NAVIGATION PERFORMANCE (RNP) APPROACH PROCEDURES WITH AUTHORIZATION REQUIRED (AR)

(CONTINUED)

Chapter 4 Missed Approach Segment

Chapter 4 Missed Approach Segment

4.0 General … 4-1 4.1 MAS Leg Types … 4-2 4.2 MAS RNP Level … 4-2 4.3 MA Segment OCS Evaluation … 4-4

Chapter 5 Vertical Error Budget (VEB) ROC Equation Explanation

5.0 General Explanation … 5-1 5.1 VEB Variables … 5-1 5.2 Bias Error Computation … 5-2 5.3 Sample Calculations … 5-2 5.4 Calculating the OCS Slope Ratio … 5-5 5.5 Calculating the OCS LTP to Origin Distance … 5-5

VOLUME 6. UNITED STATES STANDARD

VOLUME 6. UNITED STATES STANDARD

FOR AREA NAVIGATION (RNAV)

Chapter 1 General Criteria

Section 1 Basic Criteria Information

1.0 Published Lines of Minimums … 1-1 1.1 Segment OEA Width (General) … 1-1 1.2 Turns … 1-5 1.3 Turn Construction … 1-10 1.4 Descent Gradient … 1-20 1.5 Feeder, Q, and T Route Segments … 1-22 1.6 Reserved … 1-24 1.7 Reserved … 1-24

Section 2 Terminal Segments

Section 2 Terminal Segments

1.8 Published Lines of Minimums … 1-25 1.9 Intermediate Segment … 1-29

vi

09/21/2012 8260.58

Table of Contents

Paragraph No. Page No.

VOLUME 6. UNITED STATES STANDARD

FOR AREA NAVIGATION (RNAV)

(CONTINUED)

Chapter 1 General Criteria (Continued)

Section 3 Basic Vertically Guided Final Segment General Criteria

Section 3 Basic Vertically Guided Final Segment General Criteria

1.10 Authorized Glidepath Angles (GPAs) … 1-38 1.11 Threshold Crossing Height (TCH) … 1-38 1.12 Determining the FPAP Location (LPV and LP only) … 1-40 1.13 Determining PFAF Coordinates … 1-42 1.14 Determining Glidepath Altitude at a Fix … 1-44 1.15 Common Fixes … 1-45 1.16 Clear Areas and Obstacle Free Zones (OFZ) … 1-45 1.17 Glidepath Qualification Surface (GQS) … 1-45 1.18 Precision Obstacle Free Area (POFA) … 1-45 1.19 MAS Conventions … 1-46

Chapter 2 Non-Vertically Guided Procedures

Chapter 2 Non-Vertically Guided Procedures

2.0 General … 2-1 2.1 Alignment … 2-1 2.2 Area – LNAV Final Segment … 2-2 2.3 Area – LP Final Segment … 2-3 2.4 Obstacle Clearance … 2-5 2.5 Final Segment Stepdown Fixes … 2-6 2.6 Minimum Descent Altitude (MDA) … 2-8 2.7 MA Section 1 (MAS-1) … 2-8

Chapter 3 Lateral Navigation with Vertical Guidance (LNAV/VNAV)

Chapter 3 Lateral Navigation with Vertical Guidance (LNAV/VNAV)

3.0 General … 3-1 3.1 FAC Alignment … 3-1 3.2 Area … 3-2 3.3 Obstacle Clearance Surface (OCS) … 3-3 3.4 MA Section 1 … 3-16

vii

09/21/2012 8260.58

Table of Contents

Paragraph No. Page No.

VOLUME 6. UNITED STATES STANDARD

FOR AREA NAVIGATION (RNAV)

FOR AREA NAVIGATION (RNAV)

(CONTINUED)

Chapter 4 LPV Final Approach Segment (FAS) Evaluation

4.0 General … 4-1 4.1 Final Segment OEA … 4-1 4.2 W OCS … 4-4 4.3 X OCS … 4-7 4.4 Y OCS … 4-8 4.5 HATh and DA … 4-10 4.6 Revising GPA for OCA Penetrations … 4-12 4.7 Adjusting TCH to Reduce/Eliminate OCS Penetrations … 4-13 4.8 Missed Approach Section 1 (Height Loss and Initial Climb) … 4-14 4.9 Surface Height Evaluation … 4-20

Chapter 5 Missed Approach (MA) Section 2

Chapter 5 Missed Approach (MA) Section 2

5.0 General … 5-1 5.1 Straight MA … 5-2 5.2 Turning MA (First Turn) … 5-2 5.3 Turning MA (Second Turn) … 5-16 5.4 Wind Spiral Cases … 5-19 5.5 MA Climb Gradient … 5-26

viii

United States Standard for

Performance Based Navigation (PBN)

Volume 1

General Guidance and Information

THIS PAGE INTENTIONALLY LEFT BLANK

THIS PAGE INTENTIONALLY LEFT BLANK

Volume 1. General Guidance and Information

Chapter 1. General Information

1.0 Purpose of This Order. This order provides a consolidated United States Performance Based Navigation (PBN) procedure design criteria.

1.1 Audience. The primary audience for this Order isAeroNav Services, who has the responsibilityto develop instrument departure procedures. The secondary audience includes otherAir Traffic Organization (ATO) ServiceArea offices, Flight Standards headquarters and regional office Divisions/Branches, Special Mailing List ZVN-826; and Special Military and Public Addressees.

Chapter 1. General Information

1.2 Where Can I Find This Order? This information is also available on the FAA's Web site at http://www.faa.gov/regulations_policies/orders_notices.

1.3 Cancellation. The order cancels the following FederalAviation Administration (FAA) orders, policy memorandums, and Terminal Instrument Procedure (TERPS) Instruction Letters (TILs) and incorporates their content into this directive:

1.3.1 FAAOrders.

• Order 8260.44A, Civil Utilization of Area Navigation (RNAV) Departure Procedures, dated 03/23/2000

• Order 8260.45A, Terminal Arrival Area (TAA) Design Criteria, dated 07/14/2000

• Order 8260.52, United States Standard for Required Navigation Performance (RNP) Approach Procedures with Special Aircraft and Aircrew Authorization Required (SAAAR), dated 06/03/2005

• Order 8260.54A, The United States Standard for Area Navigation (RNAV), dated 12/07/2007

1.3.2 Policy Memorandums.

• Clarification #4 to FAA Order 8260.52, United States Standard for Required Navigation Performance (RNP) Approach Procedures with Special Aircraft and Aircrew Authorization Required (SAAAR), dated 02/03/2006

• Application of Obstacle Accuracy Uncertainty, FAA Order 8260.52, United States Standard for Required Navigation Performance (RNP) Approach Procedures with Special Aircraft and Aircrew Authorization Required (SAAAR), dated 03/22/2006

• Correction to RNP SAAAR Clarification Memo #4, dated 04/25/2006

• Area Navigation (RNAV) Terminal Instrument Procedures (TERPS) Geospatial Standards for Procedure Development Automation, dated 02/01/2007

• Area Navigation (RNAV) Turn Altitude Determination, dated 02/26/2007

• Use of Heading to an Intercept (VI) Legs on Area Navigation (RNAV) Departures, dated 12/17/2007

• Implementation of Order 8260.54A, United States Standard for Area Navigation (RNAV), dated 01/15/2008

• Correction to Order 8260.52, U.S. Standard for Required Navigation Performance (RNP) Approach Procedures with Special Aircraft and Aircrew Authorization Required (SAAAR), dated 03/14/2008

• Corrections to Embedded Calculators and References in FAA Order 8260.54A, The United States Standard for Area Navigation (RNAV), dated 09/16/2009

• Determining Average Cold Temperature (ACT) for Barometric Vertical Navigation (Baro-VNAV) Based Approach Procedures, dated 09/24/2010

• Clarification of Locating the Flight Path Alignment Point (FPAP) on Wide Area Augmentation System (WAAS) Approach Procedures, dated 01/11/2011

• Ground Based Augmentation System Landing System (GLS) Procedure Design Guidance, dated 06/23/2011

• Landing Threshold Geodetic Datum, dated 08/11/2011

• Heading to an Altitude (VA) Followed by a Direct-to Fix (DF) Segment Design Analysis, dated 09/07/2011

• Revised Performance Based Navigation (PBN) Fly-By (FB)/Radius-to-Fix (RF) Turn Maximum Bank Angle Limits; Omni-Directional Tailwind Requirements; and Minimum Initial Departure Leg Segment Length Design Criteria, dated 10/03/2011 • • Performance Based Navigation Instrument Procedure Minimum Segment Length Standard, dated 02/06/2012

• Low/High Temperature Limits for Barometric Vertical Navigation (Baro-VNAV) Based Approach Procedures, dated 06/06/2012

1.3.3 Terminal Instrument Procedures (TERPS) Instruction Letters (TILs).

• TIL 00-009, Successive Fly-over Fixes, dated 07/18/2000

• TIL 01-020, FAA Order 8260.44, Interim Change 1, dated 05/01/2001

• TIL 01-024, Construction Criteria of Leg Segments VA to CF, dated 07/23/2001

• TIL 02-042, Area Navigation (RNAV) “Q” Route Processing, dated 12/12/2002

1-3 (and 1-4)

THIS PAGE INTENTIONALLY LEFT BLANK

THIS PAGE INTENTIONALLY LEFT BLANK

Volume 1. General Guidance and Information

Chapter 2. Basic Criteria Information

2.0 General.

The following FAA orders apply.

8260.3, United States Standard for Terminal Instrument Procedures (TERPS).

8260.19, Flight Procedures and Airspace.

7130.3, Holding Pattern Criteria.

Chapter 2. Basic Criteria Information

The feeder, initial, intermediate, final, and missed approach criteria described in this order supersede the other publications listed above. Application of Volume 4, TAA is encouraged in approach procedure design. The feeder criteria in Volume 6, chapter 1, paragraph 1.7 may be used to support RNAV Standard Terminal Arrival Route (STAR) and Tango (T) Air Traffic Service (ATS) route construction. See Order 8260.3, Volume 1, chapter 3 to determine visibility minima.

Calculators are numbered by chapter and depicted in standard mathematical notation. Each calculator is functional java script

Calculator X‐X. Title

X2 Y =

tan3°× π



 180 ° 

Where x is a variable

Calculator X‐X

X input value here Calculate

Y Clear

Click here after

entering input values to make the

calculator

function

The calculated answer is printed after

the grey button is clicked

Data Resolution.

Perform calculations using an accuracy of at least 15 significant digits; i.e., floating point numbers must be stored using at least 64 bits. Do not round intermediate results. Round only the final result of calculations for documentation purposes. Required accuracy tolerance is 1 centimeter for distance and 0.002 arc-second for angles. The following list specifies the minimum accuracy standard for documenting data expressed numerically. This standard applies to the documentation of final results only;

2.1

e.g., a calculated adjusted glidepath angle of 3.04178 degrees is documented as 3.05 degrees. The standard does not apply to the use of variable values during calculation. Use the most accurate data available for variable values.

2.1.1 Documentation Accuracy:

2.1.1 WGS‐84 latitudes and longitudes a. to the nearest one hundredth (0.01) arc second; [nearest five ten thousandth (0.0005) arc second for Final Approach Segment (FAS) data block entries].

2.1.1 b. LTP mean sea level (MSL) elevation to the nearest foot;

2.1.1 c. LTP height above ellipsoid (HAE) to the nearest tenth (0.1) meter;

2.1.1 d. Glidepath angle to the next higher one hundredth (0.01) degree;

2.1.1 e. Courses to the nearest one hundredth (0.01) degree; and

2.1.1 f. Course width at threshold to the nearest quarter (0.25) meter;

2.1.1 g. Distances to the nearest hundredth (0.01) unit [except for “length of offset” entry in FAS data block which is to the nearest 8 meter value].

2.1.2 Mathematics Convention.

Formulas in the calculators in this document as depicted are written for radian calculation.

X2 Y =

tan3°× π

  180° 

Note: The value ft‐per‐NM (fpnm) value for 1 NM was previously defined as 6,076.11548 ft. For the purposes of RNAV criteria, 1 NM is defined as the result of the following calculation:

fpnm = 1852

0 3048 .

round(a,f) rounds value a toward the nearest integer to f decimal places; e.g., round(6.2354,2)=6.24, round(10.5645,3)=10.565, round(5241.499,0)=5241, round(5241.5001,0)=5242

ceiling(a) rounds value a to the next integer toward positive infinity; e.g., ceiling(2.3)=3, ceiling(‐2.3)=‐2. The ceiling function may be defined as:

function ceiling(x) if x=int(x) then

ceiling=x else

if x<0 then

ceiling=int(x) else ceiling=int(x)+1 end if end if end function

floor(a) rounds value a to the next integer toward negative infinity; e.g., floor(2.3)=2, floor(‐2.3)=‐3. The floor function may be defined as:

function floor(x) if x=int(x) then

floor=x else

if x<0 then

floor=int(x)‐1 else

floor=int(x) end if end if end function

min(x,y) returns the least (closest to negative infinity) of real values x or y; e.g., min(‐3,‐5)=‐5, min(3,5)=3

max(x,y) returns the greatest (closest to positive infinity) of real values x or y; e.g., max(‐3,‐5)=‐3, max(3,5)=5

2.1.2 a. Conversions by Unit Factors:

• Degree measure to radian measure:

radians = degrees× π Example: 0.908095 = 52.03°× π 180° 180° • Radian measure to degree measure:

180° 180° degrees = radians× Example: 52.03° = 0.908095× π π • Feet to meters:

.3048 m .3048 m meters = feet× Example: 37.6294 m = 123.456 ft× ft ft

• Meters to feet

1 ft 1 ft feet = meters× Example: 123.456 ft = 37.6294 m× .3048 m .3048 m

• Feet to Nautical Miles (NM)

.3048 NM .3048 NM NM = feet× Example: 1.38707 NM = 8428 ft× 1852 ft 1852 ft

• NM to feet: 1852 ft 1852 ft feet = NM× Example: 8428 ft = 1.38707 NM× .3048 NM .3048 NM

• NM to meters 1852 m 1852 m meters = NM× Example: 2689.66 m = 1.4523 NM× NM NM

• Meters to NM

NM NM NM = meters× Example: 1.4523 NM = 2689.66 m× 1852 m 1852 m

• Temperature Degrees Celsius ( °C ) to Degrees Fahrenheit ( °F ):

1.8°F °F T°F = ×T°C + 32°F Example: 68°F = 1.8 × 20°C + 32°F °C °C

• Temperature Degrees Fahrenheit ( °F ) to degrees Celsius ( °C )

°C °C T°C = ×(T°F − 32°F) Example: 20°C = ×(68°F − 32°F) 1.8°F 1.8°F

2.1.2 b. Definition of Mathematical Functions and Constants.

a + b indicates addition

a − b indicates subtraction

a × b or ab or a ⋅ b or a*b indicates multiplication a a or a ÷ b indicates division or b b (a − b) indicates the result of the process within the parenthesis

a - b indicates absolute value

≈ indicates approximate equality

a or a

0.5 or a^0.5 indicates the square root of quantity "a"

a

2 or a^2 indicates a × a ln(a) or log(a) indicates the natural logarithm of "a"

tan(a) indicates the tangent of "a"

tan

−1 (a) or atan(a) indicates the arc tangent of "a"

sin(a) indicates the sine of "a"

sin

−1 (a) or asin(a) indicates the arc sine of "a"

cos(a) indicates the cosine of "a"

cos

−1 (a) or acos (a) indicates the arc cosine of "a"

e The constant e is the base of the natural logarithm and is sometimes known

as Napier’s constant, although its symbol (e) honors Euler. With the possible exception of π, e is the most important constant in mathematics since it appears in myriad mathematical contexts involving limits and derivatives. Its value is approximately 2.718281828459045235360287471352662497757...

r The TERPS constant for the mean radius of the earth for spherical

calculations in feet. r = 20890537

2.1.2 c. Common equation terms.

Terms: These terms/variables are common to all calculators.

AMSL is above mean sea level. φ is bank angle. β is magnitude of heading change in degrees. θ is glidepath angle in degrees. DA is decision altitude in feet AMSL. alt is altitude in feet AMSL. ATTi is the along-track error for the segment initial fix. ATTt is the along-track error for the segment termination fix. VKIAS is knots indicated airspeed (Volume 6, table 1-3). aptelev is the published airport elevation in feet AMSL. LTPelev is the published threshold elevation in feet AMSL. TCH is threshold crossing height in feet above threshold. PFAFalt is the minimum intermediate segment altitude in feet AMSL. OMSL is the obstacle elevation in feet AMSL. OBSX is the along track distance in feet from LTP to obstacle. HATh is the difference between DA and LTP elevation rounded to the next higher foot value. HAL is the difference between DA and FHP elevation rounded to the next higher foot value.

09/21/2012

2.1.2

2.1.3

2.1.3

8260.58 Volume 1

d. Operation Precedence (Order of Operations).

First: Grouping Symbols: parentheses, brackets, braces, fraction bars, etc. Second: Functions: Tangent, sine, cosine, arcsine, and other defined functions Third: Exponentiations: Powers and roots Fourth: Multiplication and Division: Products and quotients Fifth: Addition and subtraction: Sums and differences e.g.,

5 − 3 × 2 = −1 because multiplication takes precedence over subtraction (5 − 3) × 2 = 4 because parentheses take precedence over multiplication

62 = 12 because exponentiation takes precedence over division 3 9 + 16 = 5 because the square root sign is a grouping symbol

9 + 16 = 7 because roots take precedence over addition sin(30°) = 1 because functions take precedence over division 0.5

=0°  sin

3 = 0.8660254 because parentheses take precedence over functions  0.5 

Notes on calculator usage:

1. Most calculators are programmed with these rules of precedence.

2. When possible, let the calculator maintain all of the available digits of a number in memory rather than re-entering a rounded number. For highest accuracy from a calculator, any rounding that is necessary should be done at the latest opportunity.

Geospatial Standards.

The following standards apply to the evaluation of obstacle and terrain position and elevation data relative to RNAV OEAs and OCSs. Terrain and obstacle data are reported in NAD‐83 latitude, longitude, and elevation relative to MSL in National Geodetic Vertical Datum of 1929 (NGVD‐29) or North American Vertical Datum of 1988 (NAVD‐88) vertical datum. Evaluate obstacles using their NAD‐83 horizontal position and NAVD‐88 elevation value compared to the WGS‐84 referenced course centerline (along-track and cross-track), OEA boundaries, and OCS elevations as appropriate.

a. WGS‐84[G873] for Position and Course Construction. This reference frame is used by the FAA and the U.S. Department of Defense (DoD). It is defined by the National Geospatial-Intelligence Agency (NGA) (formerly the National Imagery and Mapping Agency, formerly the Defense Mapping Agency [DMA]). In 1986, the Office of National Geodetic Survey (NGS), redefined and readjusted the North American Datum of 1927 (NAD‐27), creating the North American Datum of 1983 (NAD‐83). The WGS‐84 was defined by the DMA. Both NAD‐83 and WGS‐84 were originally defined (in words) to be geocentric and oriented as the Bureau International d I’Heure (BIH) Terrestrial System.

09/21/2012

2.1.3

2.1.3

2.1.3

2.1.3

2.1.4

2.1.5

8260.58 Volume 1

In principle, the three-dimensional (3D) coordinates of a single physical point should therefore be the same in both NAD‐83 and WGS‐84 Systems; in practice; however, small differences are sometimes found. The original intent was that both systems would use the Geodetic Reference System of 1980 (GRS‐80) as a reference ellipsoid. As it happened, the WGS‐84 ellipsoid differs very slightly from GRS‐80). The difference is 0.0001 m in the semi-minor axis. In January 2, 1994, the WGS‐84 reference system was realigned to be compatible with the International Earth Rotation Service’s Terrestrial Reference Frame of 1992 (ITRF) and renamed WGS‐84 (G730). The reference system underwent subsequent improvements in 1996, referenced as WGS‐84 (G873) closely aligned with ITRF‐94, to the current realization adopted by the NGA in 2001, referenced as WGS‐84 (G1150) and considered equivalent systems to ITRF 2000.

b. NAVD‐88 for elevation values. NAVD‐88 is the vertical control datum established in

1991 by the minimum-constraint adjustment of the Canadian-Mexican-U.S. leveling observations. It held fixed the height of the primary tidal bench mark, referenced to the new International Great Lakes Datum of 1985 local MSL height value, at Father Point/Rimouski, Quebec, Canada. Additional tidal bench mark elevations were not used due to the demonstrated variations in sea surface topography, (i.e., the fact that MSL is not the same equipotential surface at all tidal bench marks).

c. OEA Construction and Obstacle Evaluation Methodology.

c. Construct straight-line courses (1) Courses, fixes, boundaries (lateral dimension). as a WGS‐84 ellipsoid geodesic path. If the course outbound from a fix differs from the course inbound to the fix (courses measured at the fix), then a turn is indicated. Construct parallel and trapezoidal boundary lines as a locus of points measured perpendicular to the geodesic path. (The resulting primary and/or secondary boundary lines do not display a “middle bulge” due to curvature of the ellipsoids surface since they are not geodesic paths.) NAD‐83 latitude/longitude positions are acceptable for obstacle, terrain, and airport data evaluation. Determine obstacle lateral positions relative to course centerline/OEA boundaries using ellipsoidal calculations (see Volume 1, appendix A).

c. (2) Elevations (vertical dimension). Evaluate obstacles, terrain, and airport data using their elevation relative to their orthometric height above the geoid (for our purposes, MSL) referenced to the NAVD‐88 vertical datum. The elevations of OCSs are determined spherically relative to their origin MSL elevation (NAVD‐88). Department of Defense (DoD) procedure developers may use EGM‐96 vertical datum.

Reserved.

ATT Values.

ATT is the value used (for segment construction purposes) to quantify along-track position uncertainty of an RNAV fix. In order to account for ATT in procedure design,

2.2

OEAs are constructed and evaluated from the ATT value prior to a segment’s initial fix to the ATT value past the segment termination fix. ATT values are not included in minimum segment length calculations.

Figure 2‐1. ATT

Along-track

tolerance.

Note: Cross-track tolerance (XTT) values were considered in determining minimum segment widths, and are not considered further in segment construction.

Table 2‐1. ATT Values

GPS or DME/DME/IRU

En Route STARs, DPs, Feeder, Initial, Intermediate, Missed Approach

(> 30 NM)

2.0 NM

Terminal STARs, DPs, Feeder, Initial, Intermediate, Missed Approach

(≤ 30 NM)

1.0 NM

0.3 NM Approach

(final)

WAAS* (LPV & LP)

Approach

(final) 40 m

*Applies to final segment only. Apply GPS values to all other segments of the approach procedure.

WAAS* (LPV & LP)

Terminal Instrument Procedures (TERPS) Standard for Geodetic Constructions. See Volume 1, appendix A.

Volume 1. General Guidance and Information

Chapter 3. Administrative Information

3.0 Distribution.

This order is distributed in Washington headquarters to the branch level in the Offices of Aviation Policy and Plans, Aviation Research, Airport Safety and Standards, the Air Traffic Organization (Safety, En Route and Oceanic Services, Terminal Services, System Operations Services, Mission Support Services, and Technical Operations Services), and Flight Standards Service; to the Aeronautical Information Management Group, AeroNav Services, Airspace and Rules Group, and the National Airway Systems Engineering Group; to the Regulatory Standards Division; to the branch level in the regional Flight Standards and Airports Divisions; to the Air Traffic and Technical Operations Service Areas, to all Flight Inspection Field Offices; to the Europe, Africa, and Middle East Area Office; to all Flight Standards Field Offices; Special Mailing List ZVN-826; and Special Military and Public Addressees.

Chapter 3. Administrative Information

3.1 Definitions and/or Acronyms.

In addition to the definitions common to procedure development contained in various 8260-series orders, the following definitions and/or acronyms apply:

3.1.1 3-Dimensional (3D). Approach procedures that provide longitudinal, lateral, and vertical path deviation information are 3D procedures. Instrument landing system (ILS), microwave landing system (MLS), precision approach radar (PAR), lateral navigation/vertical navigation (LNAV/VNAV), Localizer Performance with Vertical Guidance (LPV), and required navigation performance (RNP) are examples of 3D procedures.

3.1.2 Adverse Assumption Obstacles (AAO). A vertical additive applied to terrain height to compensate for the assumed existence of an unreported obstacle (see Order 8260.19).

3.1.3 Air Traffic Service (ATS) Route. A generic term that includes VOR Federal airways, colored Federal airways, jet routes, and RNAV routes. The term “ATS route” does not replace these more familiar route names, but serves only as an overall title when listing the types of routes that comprise the United States route structure.

3.1.4 Airport Reference Point (ARP). The official horizontal geographic location of an airport. It is the approximate geometric center of all usable runways at an airport.

3.1.5 Along-Track Distance (ATD). A distance specified in nautical miles (NM) along a defined track to an area navigation (RNAV) fix.

3.1.6 Along-Track (ATRK) Tolerance (ATT). The amount of possible longitudinal fix positioning error on a specified track expressed as a ± value.

Note: The acronym ATRK FDT (along-track fix displacement tolerance) has been used instead of ATT in the past. The change to ATT is a step toward harmonization of terms with International Civil Aviation Organization (ICAO) Pans-Ops.

3.1.7 Approach Surface Baseline (ASBL). The ASBL is a line aligned to the runway centerline (RCL) that lies in a plane parallel to a tangent to the WGS‐Ellipsoid at the landing threshold point. It is used as a baseline reference for vertical measurement of the height of glidepath and obstacle clearance surface (OCS).

3.1.8 Area Navigation (RNAV). A method of navigation which permits aircraft operation on any desired flight path within the coverage of ground or spacedbased navigation aids or within the limits of the capability of self contained aids, or a combination of these.

3.1.9 Authorization Required (AR). Aircraft may be equipped beyond the minimum standard for public required navigation performance (RNP) criteria and aircrews trained to achieve a higher level of instrument approach performance. AR criteria are based on a higher level of equipage and additional aircrew requirements. Procedures that utilize AR design criteria must be appropriately annotated.

3.1.10 Average Coldest Temperature (ACT). A value in Centigrade (°C) and/or Fahrenheit (°F) scale for the lowest temperature a Baro‐VNAV (including RNP) procedure can be utilized. It is derived from historical weather data, or in the absence of historical data, a standardized temperature value below airport ISA is used.

3.1.11 Barometric Altitude. A barometric altitude measured above mean sea level (MSL) based on atmospheric pressure measured by an aneroid barometer. This is the most common method of determining aircraft altitude.

3.1.12 Baseline. Where a turn area expansion arc(s) may be centered, a line perpendicular to the inbound course after the leg termination fix ATT area. For CA, CI, VA or VI legs, the baseline is located at the leg termination point.

3.1.13 Course Change. A course change is the mathematical difference between the inbound and outbound tracks at a single fix.

3.1.14 Course-to-a-Fix (CF). A defined, repeatable course (track over the ground) to a specific database fix.

3.1.15 Course-to-an-Altitude (CA). A defined, repeatable course to a specific altitude at an unspecified position.

3.1.16 Course-to-an-Intercept (CI). A defined, repeatable course to intercept the subsequent leg.

3.1.17 Cross-Track (XTT) Tolerance. The amount of possible lateral positioning error expressed as a ± value.

Note: The acronym XTRK FDT (cross-track fix displacement tolerance) has been used instead of XTT in the past. The change to XTT is a step toward harmonization of terms with ICAO Pans-Ops.

3.1.18 Decision Altitude (DA). The DA is a specified barometric altitude at which a missed approach must be initiated if the required visual references to continue the approach have not been acquired. DA is referenced to MSL. It is applicable to vertically guided approach procedures.

3.1.19 Departure End of Runway (DER). The DER is the end of the runway that is opposite the landing threshold. It is sometimes referred to as the stop end of runway.

3.1.20 Departure Reference Line (DRL). An imaginary line of indefinite length perpendicular to the runway centerline at the DRP.

3.1.21 Departure Reference Point (DRP). A point on the runway centerline 2000 ft from the start end of runway.

3.1.22 Descent Gradient (DG). Description of aircraft descent profile specified in feet per nautical mile.

3.1.23 Direct-to-a-Fix (DF). An unspecified non-repeatable track starting from an undefined position to a specific database fix.

3.1.24 Distance of Turn Anticipation (DTA). The distance from (prior to) a fly-by fix at which an aircraft is expected to start a turn to intercept the course/track of the next segment.

3.1.25 Early Turn Point (ETP). Represents the earliest location where a flight track turn may commence.

3.1.26 Earth Curvature (EC). Allowance for the curvature of the earth used in distance calculations based on a spherical earth model with a radius of 20890537 ft.

09/21/2012

3.1.27

3.1.28

3.1.29

3.1.30

3.1.31

3.1.32

3.1.33

3.1.34

8260.58 Volume 1

Fictitious Threshold Point (FTP). The FTP is the equivalent of the landing threshold point (LTP) when the final approach course is offset from the runway centerline. It is not aligned through the LTP. It is located on the final approach course the same distance from the intersection of the final approach course and runway centerline extended as the LTP. FTP elevation is the same as the LTP. For the purposes of this document, where LTP is used, FTP may apply as appropriate.

Final Approach Course (FAC). Magnetic and/or true heading definition of the final approach lateral path.

Final Approach Fix (PFAF). See PFAF, paragraph 3.1.74.

Final Approach Segment (FAS). The FAS begins at the PFAF and ends at the LTP/FTP. The FAS is typically aligned with the runway centerline extended. The segment OEA normally extends a distance equal to ATT (1 RPN) beyond (outside) the segment initial and termination fixes. The FAS is divided into the OCS and the visual segment obstacle identification surface (OIS).

Fix Displacement Tolerance (FDT). FDT is a legacy term providing 2-dimensional (2D) quantification of positioning error. It is now defined as a circular area with a radius of ATT centered on an RNAV fix. The acronym ATT is now used in lieu of FDT.

Flight Control Computer (FCC). Aircraft computers which process information from various inputs to calculate flight path and flight guidance parameters.

Flight Management System (FMS). An FMS is a specialized computer system that automates a wide variety of in-flight tasks, reducing the workload on the flight crew to the point that modern aircraft no longer carry flight engineers or navigators. A primary function is in-flight management of the flight plan. Using various sensors (such as GPS and INS often backed up by radio navigation) to determine the aircraft's position, the FMS can guide the aircraft along the flight plan. From the cockpit, the FMS is normally controlled through a Control Display Unit (CDU) which incorporates a small screen and keyboard or touchscreen. The FMS sends the flight plan for display on the EFIS, Navigation Display (ND) or Multifunction Display (MFD).

Flight Path Alignment Point (FPAP). The FPAP is a 3D point defined by World Geodetic System of 1984/North American Datum of 1983 (WGS‐84/NAD‐83) latitude, longitude, MSL elevation, and WGS‐84 Geoid height. The FPAP is used in conjunction with the LTP and the geometric center of the WGS‐84 ellipsoid to define the final approach azimuth (LPV glidepath’s vertical plane) associated with an LP or LPV final course.

09/21/2012

3.1.35

3.1.36

3.1.37

3.1.38

3.1.39

3.1.40

3.1.41

3.1.42

8260.58 Volume 1

Flight Path Control Point (FPCP). The FPCP is a 3D point defined by the LTP geographic position, MSL elevation, and threshold crossing height (TCH) value. The FPCP is in the vertical plane of the final approach course and is used to relate the glidepath angle of the final approach track to the landing runway. It is sometimes referred to as the TCH point or reference datum point (RDP).

Final Roll-Out Point (FROP). Where a course change is required at or inside the PFAF, the point that the aircraft rolls to a wings-level attitude aligned with the runway centerline extended is considered the FROP.

Fly-By (FB) Fix. Fly-by fixes/waypoints are used when an aircraft should begin a turn to the next course prior to reaching the waypoint separating the two route segments.

Fly-Over (FO) Fix. Fly-over fixes/waypoints are used when the aircraft must fly over the point prior to starting a turn.

Geoid Height (GH). The GH is the height of the Geoid relative to the WGS‐84 ellipsoid. It is a positive value when the Geoid is above the WGS‐84 ellipsoid and negative when it is below. The value is used to convert a mean sea level (MSL) elevation to an ellipsoidal or geodetic height, the height above ellipsoid (HAE).

Note: The Geoid is an imaginary surface within or around the earth that is everywhere normal to the direction of gravity and coincides with MSL in the oceans. It is the reference surface for MSL heights.

Geographic Positioning Navigation (GPN). Navigation based on geodetic

calculation of geographic position referenced to the WGS‐84 ellipsoid. Global positioning system (GPS), wide area augmentation system (WAAS), local area augmentation system (LAAS), flight management system (FMS), RNP, and RNAV are examples of GPN.

Glidepath Angle (GPA). The GPA is the angle of the specified final approach descent path relative to a horizontal line tangent to the surface of the earth at the runway threshold. In this order, the glidepath angle is represented in calculators and figures as the Greek symbol theta (θ).

Glidepath Qualification Surface (GQS). The GQS is a narrow inclined plane centered on the runway centerline that limits the height of obstructions between the DA and LTP. A clear GQS is required for authorization of vertically-guided approach procedure development.

09/21/2012

3.1.43

3.1.44

3.1.45

3.1.46

3.1.47

3.1.48

3.1.49

3.1.50

3.1.51

8260.58 Volume 1

Global Azimuth Reference Point (GARP). Global Navigation Satellite System

(GNSS) Azimuth Reference Point. A calculated point 1000 ft beyond the FPAP lying on an extension of a geodesic line from the LTP/FTP through the FPAP. It may be considered the location of an imaginary localizer antenna.

Global Navigation Satellite System (GNSS). A worldwide position and time determination system that includes one or more satellite constellations, aircraft receivers and system integrity monitoring. GNSS is augmented as necessary to support the required navigation performance for the actual phase of operation.

Ground Point of Intercept (GPI). The glidepath intercepts the ASBL at the GPI. The GPI is expressed as a distance in feet from the LTP. The GPI is derived from

TCH and glidepath angle values: GPI = TCH .

tan(θ )

Heading-to-an-Altitude (VA). A specified heading to a specific altitude at an unspecified position. The resulting track is not wind corrected.

Heading-to-an-Intercept (VI). A specified heading to intercept the subsequent leg at an unspecified position. The resulting track is not wind corrected.

Height Above Ellipsoid (HAE). The elevation of the glidepath origin (TCH point) for an LPV approach procedure is referenced to the LTP. RNAV avionics calculate heights relative to the WGS‐84 ellipsoid. Therefore, it is important to specify the HAE value for the LTP. This value differs from a height expressed in feet above the geoid (essentially MSL) because the reference surfaces (WGS‐84 ellipsoid and the geoid) do not coincide. Ascertain the height of the orthometric geoid (MSL surface) relative to the WGS‐84 ellipsoid at the LTP. This value is considered the GH. For Westheimer Field, Oklahoma the GH is -87.29 ft. This means the geoid is 87.29 WGS‐84 ellipsoid ft below the at the latitude and longitude of the runway 35 threshold.

* Calculate GH for CONUS using the appropriate NGS program. See the NGS website - http://www.ngs.noaa.gov/TOOLS/.

Height Above Threshold (HATh). The HATh is the height of the DA above LTP elevation.

Initial Climb Area (ICA). A segment variable in length starting at the DER which

allows the aircraft sufficient distance to reach an altitude of at least 400 ft above the DER.

Initial Course. The course established initially after take-off beginning at the DER.

3.1.52 Inner-Approach Obstacle Free Zone (OFZ). The inner-approach OFZ is the airspace above a surface centered on the extended runway centerline. It applies to runways with an approach lighting system of any authorized type. (USAF NA)

3.1.53 Inner-Transitional OFZ. The inner-transitional OFZ is the airspace above the surfaces located on the outer edges of the runway OFZ and the inner-approach OFZ. It applies to runways with approach visibility minimums less than ¾ statute miles (SM). (USAF NA)

3.1.54 Initial Approach Fix (IAF). A fix that identifies the beginning of an initial approach segment.

3.1.55 Instrument Landing System (ILS). A precision instrument approach system which normally consists of a localizer, glide slope, outer marker (or suitable substitute, inner marker for Category II operations below RVR 1600, and an approach lighting system.

3.1.56 Intermediate fix (IF). The fix that identifies the beginning of the intermediate approach segment of an instrument approach procedure. The fix is not normally identified on the instrument approach chart as an IF.

3.1.57 International Standard Atmosphere (ISA). A model of standard variation of pressure and temperature.

3.1.58 Knots Indicated Airspeed (KIAS). The speed shown on the aircraft airspeed indicator.

3.1.59 Landing Threshold Point (LTP). The LTP is a 3D point at the intersection of the runway centerline and the runway threshold (RWT). WGS‐84/NAD‐83 latitude, longitude, MSL elevation, and geoid height define it. For WAAS approach procedures, it is used in conjunction with the FPAP and the geometric center of the WGS‐84 ellipsoid to define the vertical plane of an RNAV FAC. (USAF must use WGS‐84 latitude and longitude only.)

Note: Where an FTP is used, apply LTP elevation (LTPE).

3.1.60 Lateral Navigation (LNAV). LNAV is RNAV lateral navigation. This type of navigation is associated with nonprecision approach procedures (NPA) because vertical path deviation information is not provided. LNAV criteria are the basis of the LNAV minima line on RNAV GPS approach procedures.

3.1.61 Lateral Navigation/Vertical Navigation (LNAV/VNAV). An approach with vertical guidance (APV) evaluated using the Baro VNAV obstacle clearance surfaces conforming to the lateral dimensions of the LNAV obstruction evaluation area (OEA). The final descent can be flown using Baro VNAV, or LPV vertical

09/21/2012

3.1.62

3.1.63

3.1.64

3.1.65

3.1.66

3.1.67

3.1.68

3.1.69

3.1.70

8260.58 Volume 1

guidance in accordance with Advisory Circular (AC) 90-97, Operational Approval of Barometric VNAV Instrument Approach Operations Using Decision Altitude.

Localizer Performance (LP). An LP approach is an RNAV NPA procedure evaluated using the lateral obstacle evaluation area dimensions of the precision localizer trapezoid, with adjustments specific to the WAAS. These procedures are published on RNAV GPS approach charts as the LP minima line.

Localizer (LOC). The component of the ILS which provides course guidance to the runway.

Localizer Performance with Vertical Guidance (LPV). An approach with vertical guidance (APV) evaluated using the OCS dimensions (horizontal and vertical) of the precision approach trapezoid, with adjustments specific to the WAAS. These procedures are published on RNAV GPS approach charts as the LPV minima line.

Maximum Allowable Descent Rate (MDR). A vertical velocity limit of 1000 ft per minute. Design of Baro‐VNAV approaches must ensure the MDR is not exceeded.

Minimum Descent Altitude (MDA). The lowest altitude, expressed in feet above mean sea level, to which descent is authorized on final approach where no glide slope is provided, or during a circle-to-land maneuver.

Minimum En Route Altitude (MEA). The lowest published altitude between radio fixes which assures acceptable navigational signal coverage and meets obstacle clearance requirements between those fixes. The MEA prescribed for a Federal airway or segment thereof, area navigation low or high route, or other direct route applies to the entire width of the airway, segment, or route between the radio fixes defining the airway, segment, or route.

Non-Vertically Guided Procedures (NVGP). Instrument approach procedures without vertical guidance. As used in this Order, NVGP include LNAV and LP approach procedures.

Obstacle Clearance Surface (OCS). An OCS is an upward or downward sloping surface used for obstacle evaluation where the flight path is climbing or descending. The separation between this surface and specified glidepath angle or minimum required climb path defines the MINIMUM required obstruction clearance at any given point.

Obstacle Evaluation Area (OEA). An area within defined limits that is subjected to obstacle evaluation through application of required obstacle clearance (ROC) or an OCS.

3.1.71 Obstacle Free Zones (OFZ). A three dimensional volume of airspace which protects for the transition of aircraft to and from the runway. Included are the Runway OFZ, the Inner-approach OFZ, and the Inner-transitional OFZ.

3.1.72 Obstacle Identification Surface (OIS). The OIS is an inclined surface conforming to the lateral dimensions of the OEA used for identification of obstacles that may require mitigation to maintain the required level of safety for the applicable segment. An OIS is normally associated with the visual portion of the FAS.

3.1.73 Obstacle Positions (OBSX,Y,Z). OBSX, Y & Z are the along track distance to an obstacle from the LTP, the perpendicular distance from the centerline extended, and the MSL elevation, respectively, of the obstacle clearance surfaces.

3.1.74 Precise Final Approach Fix (PFAF). The PFAF is a calculated WGS‐84 geographic position located on the final approach course where the designed vertical path (NPA procedures) or glidepath (APV and PA procedures) intercepts the intermediate segment altitude (glidepath intercept altitude). The PFAF marks the beginning of the FAS. The calculation of the distance from LTP to PFAF includes the earth curvature.

3.1.75 Q Routes. ‘Q’ is the designator assigned to published high altitude RNAV-based ATS routes in the United States.

3.1.76 Reserved.

3.1.77 Radius to Fix (RF) Leg. An RF leg is a constant radius circular repeatable path about a defined turn center that begins and terminates at a fix.

3.1.78 Reference Datum Point (RDP). The RDP is a 3D point defined by the LTP or FTP latitude/longitude position, MSL elevation, and a threshold crossing height (TCH) value. The RDP is in the vertical plane associated with the FAC and is used to relate the GPA of the final approach track to the landing runway. It is also referred to as the TCH point or FPCP.

3.1.79 Reference Fix. A point of known location used to geodetically compute the location of another fix.

3.1.80 Reference Line. For fix turns less than 90 degrees, a line parallel to the course line after the turn fix where an additional set(s) of turn area expansion arcs are centered.

3.1.81 Reference Navigational Aid (NAVAID). A navigational facility required for various leg construction (e.g., CF) to assign a magnetic variation to the course.

3.1.82 Required Navigation Performance (RNP). RNP is a statement of the 95 percent

navigation accuracy performance that meets a specified value for a particular phase of flight or flight segment and incorporates associated on-board performance monitoring and alerting features to notify the pilot when the RNP for a particular phase or segment of a flight is not being met.

3.1.83 Required Obstruction Clearance (ROC). Sometimes referred to as required obstacle clearance, ROC is the minimum vertical clearance (in feet) that must exist between aircraft and the highest ground obstruction within the OEA of instrument procedure segments.

3.1.84 Runway Threshold (RWT). The RWT marks the beginning of the portion of the runway usable for landing. It extends the full width of the runway.

3.1.85 Standard Instrument Approach Procedure (SIAP). Instrument approach procedures published in the Federal Register under Title 14 of the Code of Federal Regulations (14 CFR) Part 97.

3.1.86 Standard Instrument Departure (SID). A preplanned instrument flight rule (IFR) air traffic control (ATC) departure procedure printed for pilot/controller use in graphic form to provide obstacle clearance and a transition from the terminal area to the appropriate en route structure. SIDs are primarily designed for system enhancement to expedite traffic flow and to reduce pilot/controller workload. ATC clearance must always be received prior to flying a SID.

3.1.87 Standard Terminal Arrival (STAR). A preplanned instrument flight rule (IFR) ATC arrival procedure published for pilot use in graphic and/or textual form. STARs provide transition from the en route structure to an outer fix or an instrument approach fix/arrival waypoint in the terminal area.

3.1.88 Start of Climb (SOC). The SOC is a point located at a calculated flat-surface length distance from the decision altitude for LNAV/VNAV or the missed approach point for LNAV and LP or at the end of section 1 for LPV/GLS procedures.

3.1.89 Threshold Crossing Height (TCH). The height of the glidepath above the threshold of the runway measured in feet. The LPV glidepath originates at the TCH value above the LTP.

3.1.90 Track to Fix (TF) Leg. A TF leg is a geodesic path between two fixes. The resulting track is wind corrected.

3.1.91 True Airspeed (KTAS). The airspeed of an aircraft relative to undisturbed air. KTAS is the KIAS corrected for air density error. KTAS increases with altitude when KIAS remains constant.

3.1.92 Turn Anticipation. The capability of RNAV airborne equipment to determine the location of the point along a course, prior to a FB fix which has been designated a turn fix, where a turn is initiated to provide a smooth path to intercept the succeeding course.

3.1.93 Turn Fix. A FB or FO fix denoting a course change.

3.1.94 Turn Initiation Area (TIA). The straight portion of a missed approach OEA whose end is identified by a turn at a specified altitude.

3.1.95 Vertical Error Budget (VEB). The VEB is a set of allowable values that contribute to the total error associated with a VNAV system. Application of equations using the VEB values determines the minimum vertical clearance that must exist between an aircraft on the nominal glidepath and ground obstructions within the OEA of instrument procedure segments. When the VEB is used in final segment construction, its application determines the OCS origin and slope ratio.

3.1.96 Visual Glide Slope Indicator (VGSI). The VGSI is an airport lighting aid that provides the pilot with a visual indication of the aircraft position relative to a specified glidepath to a touchdown point on the runway. PAPI and VASI are examples of VGSI systems.

3.1.97 Visual Segment. The visual segment is the portion of the FAS OEA between the DA and the LTP.

3.1.98 Waypoint (WP).

3.1.99 Wide Area Augmentation System (WAAS). The WAAS is a navigation system based on the GPS. Ground correction stations transmit position corrections that enhance system accuracy and add satellite based VNAV features.

3.2 Information Update.

For your convenience, FAA Form 1320-19, Directive Feedback Information, is included at the end of this order to note any deficiencies found, clarification needed, or suggested improvements regarding the contents of this revision. When forwarding your comments to the originating office for consideration, please provide a complete explanation of why the suggested change is necessary.

3-11 (and 3-12)

THIS PAGE INTENTIONALLY LEFT BLANK

THIS PAGE INTENTIONALLY LEFT BLANK

Volume 1. General Guidance and Information

Appendix A. TERPS Standard Formulas

for Geodetic Calculations

1.0 Purpose.

The ellipsoidal formulas contained in this document must be used in determining RNAV flight path (GPS, RNP, WAAS, LAAS) fixes, courses, and distance between fixes.

Appendix A. TERPS Standard Formulas

Notes:

Algorithms and methods are described for calculating geodetic locations (latitudes and longitudes) on the World Geodetic System of 1984 (WGS‐84) ellipsoid, resulting from intersections of geodesic and non-geodesic paths. These algorithms utilize existing distance and azimuth calculation methods to compute intersections and tangent points needed for area navigation procedure construction. The methods apply corrections to an initial spherical approximation until the error is less than the maximum allowable error, as specified by the user.

Several constants are required for ellipsoidal calculations. First, the ellipsoidal parameters must be specified. For the WGS‐84 ellipsoid, these are:

a  semi‐major axis  6,378,137.0 m b  semi‐minor axis  6,356,752.314245 m 1 f  inverse flattening  298.257223563

Note that the semi-minor axis is derived from the semi-major axis and flattening parameters using the relation b a 1 f  .

Second, an earth radius is needed for spherical approximations. The appropriate radius is the geometric mean of the WGS‐84 semi-major and semi-minor axes. This gives

SPHERE_RADIUS (r) = ab=6,367,435.679716 m .

Perform calculations with at least 15 significant digits.

For the purpose of determining geodetic positions, perform sufficient iterations to converge within 1 cm in distance and 0.002 arc seconds in bearing.

2.0 Introduction.

The algorithms needed to calculate geodetic positions on the earth for the purpose of constructing and analyzing Terminal Instrument Procedures (TERPS) require the following geodetic calculation process some of which are illustrated in figure A-1:

Process 1: Find the destination latitude and longitude, given starting latitude and longitude as well as distance and starting azimuth (often referred to as the “direct” or “forward” calculation).

Process 2: Compute the geodesic arc length between two points, along with the azimuth of the geodesic at either point (often referred to as the “inverse” calculation).

Process 3: Given a point on a geodesic, find a second geodesic that is perpendicular to the given geodesic at that point.

Process 4: Given two geodesics, find their intersection point(s) (see label 4).

Process 5: Given two constant-radius arcs, find their intersection point(s) (see label 5).

Process 6: Given a geodesic and a separate point, find the point on the geodesic nearest the given point (see label 6).

Process 7: Given a geodesic and an arc, find their intersection point(s) (see label 7).

Process 8: Given two geodesics and a radius value, find the arc of the given radius that is tangent to both geodesics and the points where tangency occurs (see label 8).

Process 9: Given an arc and a point, determine the geodesic(s) tangent to the arc through the point and the point(s) where tangency occurs (see label 9).

Process 10: Given an arc and a geodesic, determine the geodesic(s) that are

tangent to the arc and perpendicular to the given geodesic and the point(s) where tangency occurs (see label 10).

Process 11: Compute the length of an arc.

Process 12: Determine whether a given point lies on a particular geodesic.

Process 13: Determine whether a given point lies on a particular arc.

The following algorithms have been identified as required for analysis of

TERPS procedures that use locus of points curves:

Process 14: Given a geodesic and a locus, find their intersection point.

Process 15: Given a fixed-radius arc and a locus, find their intersection point(s) (see

label 15).

Process 16: Given two loci, find their intersection.

Process 17: Given two loci and a radius, find the center of the arc tangent to both

loci and the points of tangency (see label 17).

The algorithm prototypes and parameter descriptions are given below using a C-like syntax. However, the algorithm steps are described in pseudo-code to maintain clarity and readability.

Figure A‐1.Typical Geodetic

Constructions for TERPS

8

8

8

4

4

9

10 10

10

10

7

5 5

6

9

7

15

17

17

17 17

Numbers refer to the algorithm in the list above that would be used to solve for the point.

2.1 Data Structures.

2.1.1 Geodetic Locations.

For convenience, one structure is used for both components of a geodetic coordinate. This is referred to as an LLPoint, which is declared as follows using C syntax:

typedef struct {

latitude; longitude; } LLPoint;

2.1.2 Geodesic Curves.

A geodesic curve is the minimal-length curve connecting two geodetic locations. Since the planar geodesic is a straight line, we will often informally refer to a geodesic as a “line.” Geodesics will be represented in data using two LLPoint structures.

2.1.3 Fixed Radius Arc.

A geodetic arc can be defined by a center point and radius distance. The circular arc is then the set (or locus) of points whose distance from the center point is equal to the radius. If an arc subtends an angle of less than 360 degrees, then its start azimuth, end azimuth, and orientation must be specified. The orientation is represented using a value of ±1, with +1 representing a counterclockwise arc and ‐1 representing a clockwise arc. The distance between the start and end points must be checked. If it is less than a predetermined tolerance value, then the arc will be treated like a complete circle.

2.1.4 Locus of Points Relative to a Geodesic.

A locus of points relative to a geodesic is the set of all points such that the perpendicular distance from the geodesic is defined by a continuous function w P which maps each point P on the geodesic to a real number. For the purposes of procedure design, w P will be either a constant value or a linear function of the  distance from P to geodesic start point. In the algorithms that follow, a locus of points is represented using the following C structure:

typedef struct {

LLPoint geoStart; /* start point of geodesic */ LLPoint geoEnd; /* end point of geodesic */ LLPoint locusStart; /* start point of locus */

LLPoint locusEnd; /* end point of locus */ double startDist; /* distance from geodesic *

* to locus at geoStart */ double endDist; /* distance from geodesic * * to locus at geoEnd */ int lineType; /* 0, 1 or 2 */ } Locus;

The startDist and endDist parameters define where the locus lies in relation to the defining geodesic. If endDist=startDist, then the locus will be described as being “parallel” to the geodesic, while if endDiststartDist, then the locus is “splayed.” Furthermore, the sign of the distance parameter determines which side of the geodesic the locus is on. The algorithms described in this paper assume the following convention: if the distance to the locus is positive, then the locus lies to the right of the geodesic; if the distance is negative, then the locus lies to the left. These directions are relative to the direction of the geodesic as viewed from the geoStart point. See figure A-2 for an illustration.

If memory storage is limited, then either the startDist/endDist or locusStart/locusEnd elements may be omitted from the structure, since one may be calculated from the other. However, calculating them once upon initialization and then storing them will reduce computation time.

The lineType attribute is used to specify the locus’s extent. If it is set to 0 (zero), then the locus exists only between geoStart and geoEnd. If lineType=1, then the locus begins at geoStart but extends beyond geoEnd. If lineType=2, then the locus extends beyond both geoStart and geoEnd.

Figure A‐2. Two Examples Loci Defined

Relative To A Single Geodesic

Defining geodesic

geoEnd

geoStart

locusEnd

locusStart

startDist>0 endDist=startDist>0

“parallel” Locus

“splayed” Locus

startDist<0

endDist<startDist<0

locusEnd

locusStart

3.0 Basic Calculations.

3.1 Iterative Approach.

For most of the intersection and projection methods listed below, an initial approximation is iteratively improved until the calculated error is less than the required accuracy. The iterative schemes employ a basic secant method, relying upon a linear approximation of the error as a function of one adjustable parameter.

To begin the iteration, two starting solutions are found and used to initialize a pair of two-element arrays. The first array stores the two most recent values of the parameter being adjusted in the solution search. This array is named distarray when the search parameter is the distance from a known point. It is named crsarray when the search parameter is an angle measured against the azimuth of a known geodesic. The second array (named errarray in the algorithms below) stores the error values corresponding to the two most recent parameter values. Thus, these arrays store a linear representation of the error function. The next solution in each iteration is found by solving for the root of that linear function using the findLinearRoot function:

static double findLinearRoot(double* x, double* y,

long* err) { if (x[0] == x[1]) {

/* function has duplicate x values, no root */ return x[0]; } else if (y[0] == y[1]) {

if (y[0]*y[1] == 0.0) {

return x[0]; } /* duplicate y values in root function */ return 0.5*(x[0]+x[1]); }

return ‐y[0]*(x[1]‐x[0])/(y[1]‐y[0]) + x[0] }

This function returns the value of the search parameter for which the linear error approximation is zero. The returned root is used as the next value in the adjustable parameter and the corresponding error value is calculated. Then the parameter and error arrays are updated and another new root is found.

This iteration scheme works well for the algorithms described in this paper. Convergence is achieved very quickly because each starting solution is very close to the final solution, where the error is well approximated by a linear function.

A

B

b

c

a

3.2 Starting Solutions.

Starting solutions must be provided to start iterating toward a precise solution. Initial solutions may be found in all cases by using spherical triangles to approximate the geodetic curves being analyzed, and then solve for unknown distance and azimuth values using spherical trigonometry formulas.

3.2.1 Spherical Direction Intersect.

Given two points A and B and two bearings A to C and B to C, find C.

C

Run Inverse to find arc length from A to B and bearings A to B and B to A. Compute differences of bearings to find angles A and B of the spherical triangle ABC.

More than one valid solution may result. Choose the solution closest to the original points.

Apply the spherical triangle formulas to find the angle C and arc lengths from A to C and from B to C:

 c   1 coscos B sin A sincos C  cos  A  B   , R   

-1  B  B    cos A cos  cos C   coscosAcos C cos b R cos-1 a R    , . sin B    C   sin C  sin A sin   

Note: If distances a or b result from a reciprocal bearing, assign appropriate negative sign(s).

Run Direct from A to find C. Use given bearing and computed length b.

3.2.2 Spherical Distance Intersection.

A

B

C

1

2

C

Given A, B and distances AC and BC, find C1 and C2.

Run Inverse to find length and bearings between A and B.

Use spherical triangles to find angles A =BAC1 = BAC2, B =ABC1 = ABC2, and C = BC1A = BC2A:

 a   b c b  a   c          cos cos cos cos cos cos               R R R R R R 1       1       A  cos  , B  cos   , b c a c             sin sin sin sin               R R   R        R 

b     c   a   cos cos cos         R 1   R     R and C  cos   .    a b    sin sin       R R      

Run Direct from A to find C1 and C2.

To compute the bearing from A to C1, start with the bearing from A to B and subtract angle A.

To compute the bearing from A to C2, start with the bearing from A to B and add angle A.

Use Inverse and spherical triangle formulas to get remaining bearings.

3.2.3 Spherical Tangent Point.

In both cases of the tangent point, distances are signed according to the following sign legend:

Where the arrow indicates the bearing from the first point A to the target point D.

3.2.4 Two Points and a Bearing Case.

Given two points, A and C, and a bearing from the first point (A). Find the point D along the given bearing extended which is closest to C.

Run Inverse to find length and bearings between A and C.

Find difference in bearings to compute angle A.

Use right spherical triangles to calculate y and x:

y  Rsin1 

sin( A 

 r )sin( ) ,  R   r y   cos 1 cos( )/ cos( ) x R .  R R 

Run Direct from A to find D using given bearing and computed length x.

3.2.5 Given Three Points Case.

Given three points (A, B, C), find the point (D) on the geodesic line from the first two points which is the perpendicular foot from the third point.

Use Inverse to determine bearing from A to B.

Use Inverse to determine bearing and length from A to C.

Find the difference in bearings to determine angle A.

Use right spherical triangles to find the lengths x and y:

  y Rsin 1 sin( r )sin( )  ,  A  R 

 r y   cos 1 cos( )/ cos( ) x R .  R R 

Use Direct to calculate D from A using the computed bearing from A to B and computed distance x.

3.3 Tolerances.

Two different convergence tolerances must be supplied so that the algorithms cease iterating once the error becomes sufficiently small. The first tolerance parameter is used in the forward and inverse routines; it is referred to as eps in the algorithm descriptions. The second parameter, labeled tol, is used in the intersection and projection routines to limit the overall error in the solution. Since the intersection and projection routines make multiple calls to the inverse and forward algorithms, the eps parameter should be several orders of magnitude smaller than the tol parameter to ensure that the iteration methods return correct results. Empirical studies have shown that eps = 0.5e‐13 and tol = 1.0e‐9 work well.

Finally, a maximum iteration count and convergence tolerances must be supplied to ensure that no algorithms can remain in an infinite loop if convergence is not reached. This parameter can be set by the programmer, but should be greater than five to ensure that all of the algorithms can reach convergence.

3.4 Direct and Inverse Algorithms.

The Direct and Inverse cases utilize formulae from T. Vincenty’s, Survey Review XXIII, No. 176, April 1975: Direct and Inverse Solutions of Geodesics on the Ellipsoid with Application of Nested Equations.

Vincenty’s notation is annotated below:

, , major and minor semi axes of the ellipsoid. a b

a b  f , flattening  . a , geodetic latitude, positive north of the equator.

L, difference in longitude, positive east.

s, length of the geodesic.

1, 2 , bearings of the geodesic, clockwise from north; 2 in the direction PP 1 2 produced.

, bearing of the geodesic at the equator.

2 2 2 a  b 2 u  cos  . b2

U , reduced latitude, defined by tan U   1 f  tan  .

, difference in longitude on the auxiliary sphere.

 , angular distance PP 1 2 , on the sphere.

1, angular distance on the sphere from the equator to P1.

m , angular distance on the sphere from the equator to the midpoint of the line.

3.4.1 Vincenty’s Direct Formula.

tan U tan 1  1 (1) cos 1

sin cosU1 sin1 . (2)

u 2 2 2 A  1

2 4096 u 768 u 320 175u  (3)   16384

u 2 2 2 B 

2 256  u 128  u 74  47u  (4)   1024

2m  21  (5)

 1  2 1 2 2  (6)  cos 2 m  Bcos 2cos 2  1  Bcos 2 m 4sin  3 4cos m3   Bsin   m   2  4  6 

s    (7) bA

Equations (5), (6), and (7) are iterated until there is a negligible change in  . The first approximation of  is the first term of (7).

Note 1: For 1 cm accuracy,  can change no more than 1.57e‐009.

sinU cos  cos U sin cos 1 1 1 tan 2  1 (8)

2 2 2 1 f sin  sin U sin  cos U cos  cos   1 1 1 

sin sin 1 tan  (9) cos U cos sin U sin  cos  1 1 1

f 2 2 C  cos  4  f 4  3cos   (10) 16

2 L   1 C f sin    C sin  cos 2m  C cos 2cos 2m 1 (11)  

2 L   1 C f sin    C sin  cos 2m  C cos 2cos 2m 1 (11)  

sin  tan  (12) 2 sin U sin cosU cos  cos 1 1 1

The latitude is found by computing the arctangent of (8) and 2 is found by computing the arctangent of (12).

3.4.2 Vincenty’s Inverse Formula.

L (first approximation) (13)

2 sin  cos U sin 

2 cos U sin U sin U cos U cos  2 (14) 2 1 2 1 2

cos sin U1 sin U2 cos U1 cosU2 cos  (15)

sin tan  (16) cos 

cos U cos U sin  sin 1 2 (17) sin

2sin U1 sin U2 cos2m  cos 2 (18) cos 

 is obtained by equations (10) and (11). This procedure is iterated starting with equation (14) until the change in  is negligible. See Note 1.

s bA  (19)  

Where  comes from equations (3), (4), and (6)

cosU2 sin  tan 1  (20) cosU1 sin U2 sin U1 cos U2 cos 

cos U1 sin  tan  (21) 2 cosU1 sin U2 cos sin U1 cosU2

The inverse formula may give no solution over a line between two nearly antipodal points. This will occur when  , as computed by (11), is greater than π in absolute value. To find 1,2, compute the arctangents of (20) and (21).

The remainder of this appendix will assume the direct and inverse use the following named functions:

Long WGS84Dest (LLPoint, origin, double course, double distance, LLPoint* dest, double eps) returns an LLPoint representing the destination point, where the inputs are:

LLPoint origin = Starting LLPoint with lat/lon in radian

Double course = Azimuth of geodesic at origin in radians

Double distance= Distance to desired point (in NM)

LLPoint* dest = Reference to LLPoint that will be updated with lat/lon of destination

Double eps = Maximum error allowed in computation

Long WGS84Inverse (LLPoint origin, LLPoint dest, double* crs, double* bcrs, double* dist, double eps) returns course and distance where the inputs are:

LLPoint origin = Coordinates of starting point

LLPoint dest = Coordinates of destination point

Double* crs = Reference to double that will be updated with course at origin in radians

Double* bcrs = Reference to double that will be updated with reciprocal course at destination in radians

Double* dist = Reference to return value that will contain the distance between origin and dest

Double eps = Maximum error allowed in computation

3.5 Geodesic Oriented at Specified Angle.

In TERPS procedure design, it is often required to find a geodesic that lies at a prescribed angle to another geodesic. For instance, the end lines of an obstacle evaluation area (OEA) are typically projected from the flight path at a prescribed angle. Since the azimuth of a geodesic varies over the length of the curve, the angle between two geodesics must be measured by comparing the azimuth of each geodesic at the point where they intersect. The following pseudo-code represents an algorithm that will calculate the correct azimuth at any point on a geodesic described by its start and end points. This azimuth can easily be extended to find the azimuth of an intersecting geodesic at the point if the angle of intersection is known.

3.5.1 Input/Output.

double WGS84GeodesicCrsAtPoint(LLPoint startPt, LLPoint endPt, LLPoint testPt, int length, double* startCrs, double* revCrs, double* distToPt, long* err, double tol, double eps) returns a double representing the azimuth of the intersecting geodesic, where the inputs are:

LLPoint startPt = Coordinates of start point of given geodesic

LLPoint endPt = Coordinates of end point of geodesic

LLPoint testPt = Point at which course of geodesic is to be determined

double* startCrs = Azimuth of geodesic at startPt in radians

double* revCrs = Reciprocal azimuth of geodesic at endPt in radians

double* distToPt = Distance from startPt to testPt in NM

double tol = Accuracy tolerance for intersection calculation

double eps = Convergence parameter for forward/inverse algorithms

3.5.2 Algorithm Steps.

STEP 1: Use the WGS84PtIsOnLine algorithm to check that testPt actually lies on

geodesic defined by startPt and endPt.

STEP 2: Use Inverse algorithm to determine course and distance from testPt to

startPt. Denote course as crsToStart.

STEP 3: Use Inverse algorithm to determine course and distance from testPt to

endPt. Denote course as crsToEnd.

STEP 4: If testPt lies on geodesic between startPt and endPt, then the correct

azimuth is crsToEnd.

STEP 5: If testPt lies on the geodesic beyond endPt, then the correct azimuth is

crsStart + .

STEP 6: Return the calculated azimuth.

Note that if angle is positive, then the new geodesic will lie to the right of the given geodesic (from the perspective of standing at the start point and facing toward the end point); otherwise, the new geodesic will lie to the left.

Figure A‐3. Projecting A Geodesic Through A Point Along The Specified Azimuth

NORTH

angle

intxAz

newAzimuth

intxPt

startPt

3.6 Determine If Point Lies on Geodesic.

This algorithm returns a true value if a point lies on and within the bounds of a given geodesic. The bounds of the geodesic are specified by two pieces of information: the end point coordinates and an integer length code. If the length code is set to 0, then the geodesic is understood to exist only between its start and end points, so a value of true will be returned only if the test point also lies between the start and end points. If the length code is set to 1, then the geodesic is understood to extend beyond its end point to a distance of one half of earth’s circumference from its end point. If the length code is set to 2, then the geodesic is understood to extend beyond both the start and end points.

Note that this algorithm relies on the concept of equality for two LLPoint structures. This will be defined to mean that the distance between the two LLPoints, as calculated using the inverse algorithm, is less than tol.

3.6.1 Input/Output.

int WGS84PtIsOnLine(LLPoint startPt, LLPoint endPt, LLPoint testPt, LineType lengthCode, double tol, double eps) returns an integer value indicating whether testPt lies on geodesic, where the inputs are:

LLPoint startPt = Geodetic coordinate of line start point

LLPoint endPt = Geodetic coordinate of line end point

LLPoint testPt = Geodetic coordinate of point to test

LineType lengthCode = Integer that specifies extent of line. 0: geodesic exists only between startPt and endPt. 1: geodesic extends beyond endPt. 2: geodesic extends behind startPt.

double tol = Maximum difference allowed in distance

double eps = Convergence parameter for forward/inverse algorithms

3.6.2 Algorithm Steps.

See figure A-4 for an illustration of the variables.

STEP 1: Use inverse algorithm to calculate the azimuth and distance from startPt to

endPt. Denote these values by crs12 and dist12, respectively.

STEP 2: Use WGS84PtIsOnCrs algorithm to determine if testPt lies on geodesic given by startPt and endPt:

1. Use inverse algorithm to calculate the distance from startPt to testPt. Denote this value by tmpDist1Test.

2. Use direct algorithm to project a point from startPt, along crs12, a distance equal to tmpDist1Test. Denote this point by comparePt.

3. Use WGS84PointsAreSame algorithm to determine if testPt is equal to comparePt.

STEP 3: Examine error to determine whether testPt lies on the geodesic within

tol as follows:

1. If (error  tol) then,

a. If (lengthCode > 0) or (dist13‐dist12  tol) then,

(1) onLine = true.

b. Else,

(1) onLine = false.

2. End if.

3. Else if (lengthCode = 2),

a. Use the direct algorithm to project point from startPt, along

crs12+ a distance dist13. Again, denote this point again by testPt2.

b. Use the inverse algorithm to recalculate error, which is the distance

from testPt to testPt2.

c. If (error  tol) then onLine = true,

(1) Else onLine = false.

4. End if.

5. Else,

a. onLine = false.

6. End if.

Figure A‐4. Entities For Testing Whether a Point Lies on a Geodesic

endPt

NORTH crs12

startPt

testPt

crs13

error

dist13

testPt2

dist12

3.7 Determine If Point Lies on Arc.

This algorithm returns a non-zero (true) value if the sample point lies on and between the bounds of the given arc. The arc is defined by its center point, radius, start azimuth, end azimuth, and orientation. A positive orientation parameter indicates that the arc is traversed in a counterclockwise sense, while a negative orientation parameter indicates that the arc is traversed clockwise. This algorithm is used in conjunction with the arc intersection functions (Algorithms 4.2, 4.3, and 4.6) to determine whether the computed intersections lie within the bounds of the desired arc.

3.7.1 Input/Output.

int WGS84PtIsOnArc(LLPoint center, double radius, double startCrs, double endCrs, ArcDirection orientation, LLPoint testPt, double tol) returns an integer value indicating whether testPt lies on arc, where the inputs are:

LLPoint center = Geodetic coordinates of arc center

double radius = Arc radius

double startCrs = True azimuth from center to start of arc

double endCrs = True azimuth from center to end of arc

ArcDirection orientation = Orientation of the arc [+1 for counter-clockwise; -1 for clockwise]

LLPoint testPt = Geodetic coordinate of point to test

double tol = Maximum error allowed in solution

double eps = Convergence parameter for forward/inverse algorithms

3.7.2 Algorithm Steps.

See figure A-5 for an illustration of the variables.

STEP 1: Use inverse algorithm to calculate distance and azimuth from center to

testPt. Denote values as dist and crs, respectively.

STEP 2: If (abs(dist‐radius) > tol) then testPt is not correct distance from

center,

a. onArc = false.

STEP 3: Else,

a. Use Algorithm 6.0 – Calculate Angular Arc Extent to calculate the

angle subtended by the full arc. Denote this value by arcExtent.

b. If (arcExtent = 360°) then,

(1) onArc = true.

c. Else,

(1) Use the inverse algorithm to calculate the azimuth from center to

testPt. Denote this value by testCrs.

(2) Use Algorithm 6.0 - Calculate Angular Arc Extent to calculate

the angle subtended by and arc starting at startCrs, but ending at testCrs, with the same orientation. Denote this value by subExtent.

(3) If (‐.002  subExtent  arcExtent +.002) then traversing arc from startCrs to endCrs, one would encounter testPt, so it must lie on arc,

(a) onArc = true.

d. End if.

STEP 4: End if.

Figure A‐5. Entities for Testing

Whether a Point Lies on an Arc

endPt

NORTH

startCrs

startPt

endCrs

testCrs

testPt

radius

3.8 Calculate Length of Fixed Radius Arc.

A fixed radius arc on an ellipsoid does not generally lie in a plane. Therefore, the length of the arc cannot be computed using the usual formula for the circumference of a circle. The following algorithm takes the approach of dividing the arc into many sub-arcs. Three points are then calculated on each sub-arc. Since any three points in space uniquely determine both a plane and an arc, the three points on each sub-arc are used to calculate the radius and subtended angle of the planar arc that contains all three points. The length of the approximating planar arc is then calculated for each sub-arc. The sum of the sub-arc lengths approaches the length of the original arc as the number of sub-arc increases (and each sub-arc’s length decreases).

A simpler method that is sufficiently accurate for arcs with radius less than about 300 nautical miles (NM) is described in section 6.4.

3.8.1 Input/Output.

double WGS84DiscretizedArcLength (LLPoint center, double radius, double startCrs, double endCrs, int orient, int *n, double tol) returns a double precision value representing the length of the arc, where the inputs are:

LLPoint center

double radius

double startCrs

double endCrs

int orient

int *n

double tol

double eps

3.8.2 Algorithm Steps.

= Geodetic coordinates of arc center

= Arc radius

= True azimuth from center to start of arc

= True azimuth from center to end of arc

= Orientation of the arc [+1 for counter-clockwise; -1 for clockwise]

= Reference to integer used to return number of steps in discretized arc

= Maximum allowed error

= Convergence parameter for forward/inverse algorithms

See figure A-6 for an illustration of the variables.

STEP 1: Set initial number of sub-arcs to use. The fixed value n = 16 has been found through trial-and-error to be a good starting value. Alternatively, the initial

value of n may be calculated based on the arc’s subtended angle and its radius (i.e., its approximate arc length).

STEP 2: Convert center point to Earth-Centered, Earth-Fixed (ECEF) coordinates,

v0 according to Algorithm 6.1.

STEP 3: Compute subtended angle, subtAngle, using Algorithm 6.0.

STEP 4: Set iteration count, k = 0.

STEP 5: Do while k = 0 or ((error > tol) and (k  maximumIterationCount)):

a. Calculate subtended angle of each sub-arc, dtheta = subtAngle/n.

b. Use direct algorithm from center, using startCrs and distance

radius, to project start point of arc. Denote this point by p1.

c. Convert p1 to ECEF coordinates. Denote this vector by v1.

d. Initialize arcLength = 0.

e. For i = 0 to n:

(1) Compute azimuth from arc center to end point of sub-arc number

i: theta = startCrs + i*dtheta.

(2) Use direct algorithm from center, using azimuth

theta+0.5*dtheta and distance radius, to project middle point of sub-arc. Denote this point by p2.

(3) Convert p2 to ECEF coordinate v2.

(4) Use direct algorithm from center, using azimuth theta+dtheta

and distance radius, to project endpoint of sub-arc. Denote this point by p3.

(5) Convert p3 to ECEF coordinate v3.

(6) Subtract v2 from v1 to find chord vector between p1 and p2. Denote this vector by chord1. Compute x1 = |chord1|.

(7) Subtract v2 from v3 to find chord vector between p3 and p2. Denote this vector by chord2. Compute x2 = |chord2|.

(8) Compute dot product of chord1 and chord2. Denote this value as

d.

(9) Use the following calculation to compute the length L of the sub-

arc (see figure A-7):

(a) xi = d/(x1*x2)

(b) sigma = sqrt(1‐xi^2)

(c) R = (x2*sqrt((x1/x2 ‐ xi)^2 +

sigma^2))/(2*sigma)

(d) A = 2( ‐ arccos(xi))

(e) L = R*A

d  x x 1 2  1 2

2 x  x x 

2  2 1 2 R  2 1 A  2  cos  L R A  

Note that since the arc length is a planar (not geodetic) calculation, the subtended angle A is not equal to dtheta.

(10) Add L to cumulative length to get total length of sub-arcs through sub-arc number i: length = length + L.

f. End for loop.

g, Compute error, which is the change in length calculation between this

iteration and the last: error = abs(length – oldLength).

h. Increment the iteration count: k = k+1.

i. Double the number of sub-arcs: n = 2*n.

j. Save the current length for comparison with the next iteration:

oldLength = length.

STEP 6: End while loop.

STEP 7: Return length.

Figure A‐6. Calculating Arc Length

sub-arc4

NORTH

startCrs

startPt

endCrs

startCrs-dtheta

sub-arc1

radius

sub-arc2

dtheta

sub-arc3

Figure A‐7. Calculating the Sub‐Arc Length

R

R

R

A

0v

1v

2v

1 cos  

1x

2x

R

R

R

A

0v

1v

2v

1 cos  

1x

2x

3.9 Find Distance from Defining Geodesic to Locus.

When computing a position on a locus of points, it is necessary to solve for the distance from the defining geodesic to the locus. This distance is constant if the locus is designed to be “parallel” to the defining geodesic. However, it is necessary to allow the locus distance to vary linearly with distance along the geodesic, since in some cases the locus will splay away from the defining geodesic. To account for this, we have included startDist and endDist attributes in the Locus structure defined above. For a given point on the geodesic (or given distance from the geodesic start point), the distance to the locus can then be calculated.

The two algorithms described below carry out the computation of locus distance for different input parameters. If the distance from the geodesic start point to the point of interest is known, then WGS84DistToLocusD may be used to calculate the locus distance. If instead a point on the defining geodesic is given, the WGS84DistToLocusP may be used. The latter algorithm simply computes the distance from the geodesic start point to the given point and then invokes the former algorithm. Therefore, steps are described for WGS84DistToLocusD only.

3.9.1 Input/Output.

double WGS84DistToLocusD (Locus loc, double distance) returns the distance from the defining geodesic to the locus at the given distance from loc.geoStart, where the inputs are:

Locus loc = Locus of interest

double distance = Distance from locus start point to point where distance is to be computed

double WGS84DistToLocusP (Locus loc, LLPoint geoPt, double *faz, double tol, double eps) returns the distance from the defining geodesic to the locus at the given point, where the inputs are:

Locus loc = Locus of interest

LLPoint geoPt = Point on defining geodesic

double *faz = Pointer used to return forward azimuth of geodesic at geopt. This is needed if geopt is not between geoStart and geoEnd.

double tol = Maximum allowable error

double eps = Convergence parameter for forward/inverse algorithm

3.9.2 Algorithm Steps.

The following steps are followed if the distance from loc.geoStart is given. If a point on the geodesic (geoPt) is given instead, then first use the inverse algorithm to compute the distance from geoPt to loc.geoStart and then follow the following steps (note that distance must be signed negative if the locus’s line type is 2 and geoPt is farther from geoEnd than it is from geoStart):

STEP 1: Use the inverse function to compute the length of the locus’s defining

geodesic. Denote this value as geoLen.

STEP 2: If (geoLen = 0) then distToLoc = 0.0.

STEP 3: Else.

distance distToLoc=loc.startDist+ * loc.endDist-loc.startDist   geoLen

STEP 4: End if.

STEP 5: Return distToLoc.

3.10 Project Point on Locus from Point on Defining Geodesic.

Given a point on the defining geodesic, this algorithm computes the corresponding point on the locus.

3.10.1 Input/Output.

LLPoint WGS84PtOnLocusP (Locus loc, LLPoint geoPt, LLPoint* ptonloc, double* perpCrs, double tol, double eps) returns the point on the locus that is abeam the given point, where the inputs are:

Locus loc = Locus of Interest

LLPoint geoPt = Point on defining geodesic

LLPoint* ptonloc = Pointer to LLPoint, updated with coordinates of point on locus abeam given point.

double* perpCrs = Pointer to double, updated with azimuth from point on geodesic to point on locus.

double tol = Maximum allowable error

double eps = Convergence parameter for forward/inverse

algorithms 3.10.2 Algorithm Steps.

STEP 1: Use Algorithm 3.9 (with point input) to determine the distance from geoPt

to the locus. Denote this distance as distp.

STEP 2: If (distp = 0) return geoPt.

STEP 3: Use the inverse algorithm to compute the course from geoPt to the start

point of the defining geodesic. Denote this value as fcrs.

STEP 4: If (distp > 0.0) then the locus lies to the right of the geodesic. Let

*perpCrs = fcrs + /2.

STEP 5: Else, the locus lies to the left of the geodesic. Let

*perpCrs = fcrs ‐ /2.

STEP 6: End if.

STEP 7: Use the direct algorithm to project a point along *perpCrs, distance

abs(distp) from geoPt. Denote the point as ptonLoc.

STEP 8: Return ptonLoc.

3.11 Determine If Point Lies on Locus.

This algorithm compares the position of a given point with the position of the corresponding point on the locus. The corresponding point on the locus is found by projecting the given point onto the locus’s defining geodesic curve, computing the correct distance from there to the locus, and then projecting a point at that distance perpendicular to the geodesic. If distance from the corresponding point to the given point is less than the error tolerance, then a reference to the projected point on the geodesic is returned. Otherwise a null reference is returned.

An alternative implementation could simply return true or false, rather than references. However, it is more efficient to return the projected point as this is often needed in subsequent calculations.

3.11.1 Input/Output.

int WGS84PtIsOnLocus (Locus loc, LLPoint testPt, LLPoint* ptOnGeo, double tol, double eps) returns a reference to the projection of testPt on the locus's defining geodesic if testPt lies on the locus and NULL otherwise, where the inputs are:

Locus loc = Locus of Interest

LLPoint testPt = Point to test against locus

LLPoint* ptOnGeo = Pointer to LLPoint, updated with point on defining geodesic abeam the given point on the locus.

double tol = Maximum allowable error

double eps = Convergence parameter for forward/inverse algorithms

3.11.2 Algorithm Steps.

See figure A-8 for an illustration of the variables.

STEP 1: If testPt is the same as loc.geoStart or loc.geoEnd then return a reference to ptOnGeo containing the appropriate point.

STEP 2: Use Algorithm 5.1 to project testPt onto the locus’s defining geodesic.

Denote the projected point as ptOnGeo.

STEP 3: Use Algorithm 3.6 to determine whether ptOnGeo lies on the locus’s

defining geodesic. This will account for an infinite or semi-infinite locus. If it does not, then return 0 (false).

STEP 4: Use the Inverse Algorithm to find the course between loc.geoStart and

testPt. Use this course to determine which side of the locus testPt falls. Apply the appropriate sign to this distance, distFromPoint.

STEP 5: Use Algorithm 3.9 to calculate the correct expected locus distance, locDist.

STEP 6: If abs(distFromPoint ‐ locDist) <= tol, then the point is on the

locus. Return a reference to the projection on the defining geodesic.

Figure A‐8. Locating a Point Relative to a Locus

locusEnd

locusStart

testPt

Defining geodesic

compPt

projPt

error

startDist

endDist Locus

3.12 Compute Course of Locus.

This algorithm is analogous to the inverse algorithm for a geodesic. It is used by other locus algorithms when the direction of the locus is needed.

3.12.1 Input/Output.

double WGS84LocusCrsAtPoint (Locus loc, LLPoint testPt, LLPoint* geoPt, double* perpCrs, double tol) returns the course of the locus at the given point. Also sets values of calculation byproducts, including the corresponding point on the locus’s geodesic and the course from the given point toward the geodesic point, where the inputs are:

Locus loc = Locus of Interest

LLPoint testPt = Point at which course will be calculated

LLPoint* geoPt = Projection of testPt on defining geodesic

double* perpCrs = Course for testPt to geoPt

double tol = Maximum allowable error

double eps = Convergence parameter for forward/inverse algorithms

3.12.2 Algorithm Steps.

See figure A-9 for an illustration of the variables.

STEP 1: Use Algorithm 3.11 to determine whether testPt lies on loc. This same

step will return a reference to the projection of testPt onto the defining geodesic. Denote this reference as geoPt.

STEP 2: If (geoPt = NULL), then testPt is not a valid point at which to calculate the locus’s course. Return ‐1.0. (Valid course values are in the range

0,2.)

STEP 3: Use the inverse algorithm to calculate the course and distance from

testPt to geoPt, denoted by perpCrs and perpDist, respectively.

STEP 4: Use Algorithm 3.9 to calculate distToLoc, the distance from the

geodesic to the locus at geoPt. This step is required to determine which side of the geodesic the locus lies on because perpDist will always be positive.

STEP 5: Calculate the slope of the locus relative to the geodesic:

loc.endDist-loc.startDist slope= geoLen

STEP 6: Convert the slope to angular measure in radians

slope  atan slope   .

STEP 7: Adjust the value of the perpendicular course by slope. This accounts for

how the locus is approaching or receding from the geodesic

perpCrs=perpCrs+slope .

STEP 8: If (distToLoc < 0), then testPt lies to the left of the geodesic, so perpCrs points to the right of the locus’s course:

locCrs  perpCrs  2

STEP 9: Else, testPt lies to the right of the geodesic so perpCrs points to the left of the locus’s course: locCrs  perpCrs+  2

STEP 10: Return locCrs.

Figure A‐9. Angle Used to Calculate the Course of a Locus

Geodesic

endDist

startDist

geoEnd

geoStart

locusStart

locCrs

perpCrs

slope locusEnd

NORTH

geoPt

testPt

4.0 Intersections.

4.1 Intersection of Two Geodesics.

The following algorithm computes the coordinates where two geodesic curves intersect. Each geodesic is defined by its starting coordinates and azimuth at that coordinate. The algorithm returns a single set of coordinates if the geodesics intersect and returns a null solution (no coordinates) if they do not.

4.1.1 Input/Output.

long WGS84CrsIntersect(LLPoint pt1, double crs13, double* crs31, double* dist13, LLPoint pt2, double crs23, double* crs32, double* dist23, LLPoint* intx, double tol) returns a reference to an LLPoint structure that contains the intersection coordinates, where the inputs are:

LLPoint pt1 = Start point of first geodesic

double crs13 = Azimuth from pt1 to intersection point

double* crs31 = Reference to azimuth from intersection point to pt1

double* dist13 = Reference to distance from pt1 to intersection

LLPoint pt2 = Start point of second geodesic

double crs23 = Azimuth from pt2 to intersection point

double* crs32 = Reference to azimuth from intersection to pt2

double* dist23 = Reference to distance between pt2 and intersection point

LLPoint* intx = Reference to intersection point

double tol = Maximum error allowed in solution

double eps = Convergence parameter for forward/inverse algorithms 4.1.2 Algorithm Steps.

See figure A-10 for an illustration of the variables.

STEP 1: Use inverse algorithm to calculate distance, azimuth and reverse azimuth

from pt1 to pt2. Denote these values by dist12, crs21 and crs12, respectively. Run a check to see if pt1 lies on the geodesic defined by pt2 and crs23 and if pt2 lies on the geodesic defined by pt1 and crs13:

a. If pt1 falls on geodesic 2 and pt2 falls on geodesic 1.

(1) Return an error. Courses are collinear. There are infinite intersections.

b. If pt1 falls on geodesic 2.

(1) Return intersection = pt1.

c. If pt2 falls on geodesic 1.

(1) Return intersection = pt2.

STEP 2: Calculate the signed azimuth difference in angle between crs12 and

crs13, denoted by angle1.

STEP 3: Calculate the signed azimuth difference in angle between crs21 and

crs23, denoted by angle2.

STEP 4: If (sin(angle1)*sin(angle2) < 0) then the courses lay on opposite sides of the pt1‐pt2 line and cannot intersect in this hemisphere. Use reciprocal course so that the nearest intersection may be found:

a. If abs(angle1) > abs(angle2),

(1) angle1 = (crs13+) ‐ crs12.

b. Else,

(1) angle2 = crs21 ‐ (crs23+).

STEP 5: End if.

STEP 6: Locate the approximate intersection point, intx, using a spherical earth model. See the documents referenced in section 2.2 methods to accomplish this.

STEP 7: The following steps describe the function iterateLineIntersection which is called once the initial approximation, intx, of the line intersection is found. The purpose of the iterateLineIntersection function is to further refine the solution.

STEP 8: Use the inverse algorithm to calculate dist13, the distance from pt1 to intx.

STEP 9: Use the inverse algorithm to calculate dist23, the distance from pt2 to intx.

STEP 10: If dist13 < tol, then the intersection point is very close to pt1. Calculation errors may lead to treating the point as if it were beyond the end of the geodesic. Therefore, it is helpful to move pt1 a small distance along the geodesic:

1. Use the direct algorithm to move pt1 from its original coordinates 1 NM along azimuth crs13 + .

2. Use the inverse algorithm to calculate the azimuth acrs13 for the geodesic from the new pt1.

STEP 11: Repeat steps 10, 10(1), and 10(2) for pt2 and crs23.

STEP 12: If (dist23 < dist13) then the intersection point is closer to pt2 than pt1. In this case, the iterative scheme will be more accurate if we swap pt1 and pt2.This is because we iterate by projecting the approximate point onto the geodesic from pt1 and then calculating the error in azimuth from pt2. If the distance from pt2 to the intersection is small, then small errors in distance can correspond to large errors in azimuth, which will lead to slow convergence. Therefore, we swap the points so that we are always measuring azimuth errors farther from the geodesic starting point:

a. newPt = pt1

b. pt1 = pt2

c. pt2 = newPt

d. acrs13 = crs13

e. crs13 = crs23

f. crs23 = acrs13

g. dist13

saved.

= dist23; We only need one distance so the other is not

h. swapped = 1; This is a flag that is set so that the solutions can be

swapped back after they are found.

STEP 13: End if.

STEP 14: Initialize the distance array: distarray[0] = dist13. Errors in azimuth from pt2 will be measured as a function of distance from pt1. The two most recent distances from pt1 are stored in a two element array. This array is initialized with the distance from pt1 to intx.

STEP 15: Use the direct algorithm to project intx onto the geodesic from pt1. Use pt1 as the starting point, and a distance of distarray[0] and azimuth of crs13.

STEP 16: Use the inverse algorithm to measure the azimuth acrs23 from pt2 to intx.

STEP 17: Initialize the error array: errarray[0] = signedAzimuthDifference(acrs23, crs23). signedAzimuthDifference function; errarray[0] will be in the range (-, ).

STEP 18: Initialize the second element of the distance array using a logical guess: distarray[1]=1.01*dist13.

STEP 19: Use the direct algorithm to project the second approximation of intx onto the geodesic from pt1. Use pt1 as the starting point, and a distance of distarray[1] and azimuth of crs13.

STEP 20: Use the inverse algorithm to measure the azimuth acrs23 from pt2 to intx.

STEP 21: Initialize the error array:

errarray[1] = signedAzimuthDifference(acrs23, crs23).

STEP 22: Initialize k = 0

STEP 23: Do while (k=0) or ((error > tol) and (k  MAX_ITERATIONS)):

a. Use linear approximation to find root of errarray as a function of

distarray. This gives an improved approximation to dist13.

b. Use the direct algorithm to project the next approximation of the

intersection point, newPt, onto the geodesic from pt1. Use pt1 as the starting point, and a distance of dist13 (calculated in previous step) and azimuth of crs13.

c. Use inverse algorithm to calculate the azimuth acrs23 from pt2 to

intx.

d. Use the inverse algorithm to compute the distance from newPt to

intx (the previous estimate). Denote this value as the error for this iteration.

e. Update distarray and errarray with new values:

Continue reading ↓ 120 of 736 passages shown