Electronic map display declutter

• US 20040122589A1
• Filed: 12/20/2002
• Published: 06/24/2004
• Est. Priority Date: 12/20/2002
• Status: Active Grant

• Current Assignee: Honeywell International Inc.
• Original Assignee: Honeywell International Inc.
• Inventors: Gibbs, Michael J.
• Granted Patent: US 6,973,386 B2
• Time in Patent Office: Days
• US Class Current: 701/208
• CPC Class Codes: G01C 23/00 Combined instruments indicating more than one navigational value, e.g. for aircraft; Combined measuring devices for measuring two or more variables of movement, e.g. distance, speed or acceleration

Abstract

Method, apparatus and program product are provided for controlling the number of symbols presented on an vehicle electronic map display by using a first threshold constant for the number of symbols to be presented in FULL detail and a second threshold constant for the number of symbols to be presented in MINIMUM detail. In a first embodiment, the total number of selected symbols is compared to the threshold constants for each symbol type. In a second embodiment, the number of symbols of each type is compared to the respective threshold constants for each type. Excessive map clutter is avoided without regard to the map range selected by the user and for both high density and sparse map regions.

Claims

1. A method for controlling the number of symbols of types (XYZ)_i rendered on a map display, where i runs from 1 to N and N is the total number of selected symbol types, comprising:

a) determining the total number of symbols S_T′

=SUM{S(_XYZ)_i} for i=1 to N, where {S(_XYZ)_i} is the number of symbols of type (XYZ)_i, and then first for i=1;

b) rendering FULL information for symbol type (XYZ)_i on the map display and delivering S_T=S_T′

to step (e) if S_T<

S _i(F)_XYZ is TRUE, where S _i(F)_XYZ is a first threshold constant for symbol type (XYZ)_i, or if S_T<

S _i(F)_XYZ is FALSE;

(1) rendering MINIMUM information for symbol type (XYZ)_i on the map display and delivering S_T=S_T′

to step (e) if S_T<

S _i(M)_XYZ is TRUE, where S _i(M)_XYZ is a second threshold constant for symbol type (XYZ)_i, or if S _i(M)_XYZ is FALSE;

c) delivering S_T=S_T′

−

S _i(XYZ)_i to step (e);

, where S _i(XYZ)_i is the number of available symbols of type (XYZ)_i; and

d) repeating steps (b)-(d) for i=2 to N, thereby populating the map display with a controlled number of symbols.

2. The method of claim 1 wherein S _i(M)_XYZ>

S _i(F)_XYZ.

3. The method of claim 1 further comprising, prior to step (a), the step of determining whether symbol type (XYZ)_i available in stored map data has been selected by the user and if selected using the selected symbols in steps (a)-(d) and if not selected proceeding to step (e) without performing steps (a)-(d) for that symbol type.

4. The method of claim 1 wherein (XYZ)_j for 1<

j<

N comprises at least two symbol types 1PQR and 2PQR where PQR=(XYZ)_j, wherein steps (b)-(d) are first performed for 1PQR using threshold values S _j(F)_1PQR and S _j(M)_1PQR and steps (b)-(d) are then performed for 2PQR using threshold values S _j(F)_2PQR and S _j(M)_2PQR using the S_T value resulting from steps (b)-(d) for 1PQR, and wherein the S_T value resulting from steps (b)-(d) for 2PQR is used in steps (b)-(d) for i=j+1.

5. A method for controlling the number of symbols of types (XYZ)_i rendered on a map display, where i runs from 1 to N and N is the total number of selected symbol types, comprising, starting first with i=1:

a) setting S_{T i}=S_(XYZ)i, where S_(XYZ)i is the number of available symbols of type (XYZ)_i;

b) rendering FULL information for symbol type (XYZ)_i on the map display if S_{T i}<

S _i(F)_XYZ is TRUE, where S _i(F)_XYZ is a first threshold constant for symbol type (XYZ)_i, or if S_{T i}<

S _i(F)_XYZ is FALSE;

c) rendering MINIMUM information for symbol type (XYZ)_i on the map display if S_{T i}<

S _i(M)_XYZ is TRUE, where S _i(M)_XYZ is a second threshold constant for symbol type (XYZ)_i, or if S_{T i}<

S _i(M)_XYZ is FALSE rendering none of symbols of type (XYZ)_i on the map display; and

d) repeating steps (a)-(c) for i=2 to N, thereby populating the map display with a controlled number of symbols.

6. The method of claim 5 wherein S _i(M)_XYZ>

S _i(F)_XYZ.

7. The method of claim 5 further comprising prior to step (a), the step of determining which of (XYZ)_i has been selected by the user and using the selected symbols in steps (a)-(d) for that symbol type.

8. The method of claim 5 wherein steps (a)-(d) are executed for i=1 to j and then performing steps (a)-(c) for i=j wherein (XYZ)_j comprises at least two symbol types 1PQR and 2PQR where PQR=(XYZ)_j, wherein steps (a)-(c) are first performed for 1PQR using threshold values S _j(F)_1PQR and S _j(M)_1PQR and then steps (a)-(c) are performed for 2PQR using threshold values S _j(F)_2PQR and S _j(M)_2PQR and then in step (d) repeating steps (a)-(c) for i=j+1 to N.

9. An apparatus controlling in part the operation of a map display on which various symbols are to be rendered in controlled number, comprising:

a) a processor;

b) a memory coupled to the processor;

c) a display unit coupled to the processor and memory for displaying the map, the aircraft location on the map and the various symbols; and

d) a program residing in memory and being executed by the processor for rendering on the map display a controlled number of the symbols, the program comprising;

(1) determining the total number of symbols S_T′

=SUM{S(_XYZ)_i} for i=1 to N, where {S(_XYZ)_i} is the number of selected symbols of type (XYZ)_i, and then first for i=1;

(2) rendering FULL information for symbol type (XYZ)_i on the map display and delivering S_T=S_T′

to step (5) if S_T<

S _i(F)_XYZ is TRUE, where S _i(F)_XYZ is a first threshold constant for symbol type (XYZ)_i, or if S_T<

S _i(F)_XYZ is FALSE;

(3) rendering MINIMUM information for symbol type (XYZ)_i on the map display and delivering S_T=S_T′

to step (5) if S_T<

S _i(M)_XYZ is TRUE, where S _i(M)_XYZ is a second threshold constant for symbol type (XYZ)_i, or if S _i(M)_XYZ is FALSE;

(4) delivering S_T=S_T′

−

S _i(XYZ)i to step (5), where S _i(XYZ)i is the number of available symbols of type (XYZ)_i; and

(5) repeating steps (2)-(4) for i=2 to N, thereby populating the map display with a controlled number of symbols.

10. The apparatus of claim 9 wherein S _i(M)_XYZ>

S _i(F)_XYZ.

11. The apparatus of claim 9 wherein the program residing in memory further comprises prior to step (1), the step of determining whether symbol type (XYZ)_i available in stored map data has been selected by the user and if selected using the selected symbols in steps (1)-(4) and if not selected proceeding to step (5) without performing steps (1)-(4).

12. The apparatus of claim 9 wherein in the program residing in memory (XYZ)_j for 1<

j<

N comprises at least two symbol types 1PQR and 2PQR where PQR=(XYZ)_j, wherein steps (2)-(4) are first performed for 1PQR using threshold values S _j(F)_1PQR and S _j(M)_1PQR and steps (2)-(4) are then performed for 2PQR using threshold values S _j(F)_2PQR and S _j(M)_2PQR using the S_T value resulting from steps (2)-(4)) for 1PQR, and wherein the S_T value resulting from steps (2)-(4) for 2PQR is used in steps (2)-(4) for i=j+1.

13. The apparatus of claim 9 wherein the program residing in memory comprises, starting first with i=1:

(1) setting S_{T i}=S_(XYZ)i, where S_(XYZ)i is the number of available symbols of type (XYZ)_i;

(2) rendering FULL information for symbol type (XYZ)_i on the map display if S_{T i}<

S _i(F)_XYZ is TRUE, where S _i(F)_XYZ is a first threshold constant for symbol type (XYZ)_i, or if S_{T i}<

S _i(F)_XYZ is FALSE;

(3) rendering MINIMUM information for symbol type (XYZ)_i on the map display if S_{T i}<

S _i(M)_XYZ is TRUE, where S _i(M)_XYZ is a second threshold constant for symbol type (XYZ)_i, or if S_{T i}<

S _i(M)_XYZ is FALSE rendering none of symbols of type (XYZ)_i, on the map display; and

(4) repeating steps (1)-(3) for i=2 to N, thereby populating the map display with a controlled number of symbols.

14. The apparatus of claim 13 wherein S _i(M)_XYZ>

S _i(F)_XYZ.

15. The apparatus of claim 13 wherein the program residing in memory further comprises prior to step (1), the step of determining whether symbol type (XYZ)_i available in stored map data has been selected by the user and if selected using the selected symbols in steps (1)-(3) and if not selected proceeding to step (4) without performing steps (1)-(4).

16. The apparatus of claim 13 wherein steps (1)-(3) are executed for i=1 to j, then performing steps (1)-(3) for i=j wherein (XYZ)_j comprises at least two symbol types 1PQR and 2PQR where PQR=(XYZ)_j, wherein steps (1)-(3) are first performed for 1PQR using threshold values S _j(F)_1PQR and S _j(M)_1PQR and then steps (1)-(3) are performed again for 2PQR using threshold values S _j(F)_2PQR and S _j(M)_2PQR, and then in step (4) repeating steps (1)-(4) for i=j+1 to N.

17. A program product comprising:

(1) a program for controlling the number of symbols of types (XYZ)_i rendered on a map display, where i runs from 1 to N and N is the total number of selected symbol types, comprising, starting first with i=1 by;

(a) determining the total number of symbols S_T′

=SUM{S(_XYZ)_i} for i=1 to N, where {S(_XYZ)_i} is the number of symbols of type (XYZ)_i, and then first for i=1;

(b) rendering FULL information for symbol type (XYZ)_i on the map display and delivering S_T=S_T′

to step (e) if S_T<

S _i(F)_XYZ is TRUE, where S _i(F)_XYZ is a first threshold constant for symbol type (XYZ)_i, or if S_T<

S _i(F)_XYZ is FALSE;

(c) rendering MINIMUM information for symbol type (XYZ)_i on the map display and delivering S_T=S_T′

to step (e) if S_T<

S _i(M)_XYZ is TRUE, where S _i(M)_XYZ is a second threshold constant for symbol type (XYZ)_i, or if S _i(M)_XYZ is FALSE;

(d) delivering S_T=S_T′

−

S _i(XYZ)i to step (e);

, where S _i(XYZ)i is the number of available symbols of type (XYZ)_i;

(e) repeating steps (b)-(d) for i=2 to N, thereby populating the map display with a controlled number of symbols; and

(2) signal bearing media bearing said program.

18. The program product of claim 17 wherein S _i(M)_XYZ>

S _i(F)_XYZ.

19. The program product of claim 17 further comprising prior to step (a), the step of determining whether symbol type (XYZ)_i available in stored map data has been selected by the user and if selected using the selected symbol in steps (a)-(c) and if not selected proceeding to step (d) without performing steps (a)-(c).

20. The program product of claim 17 wherein the program comprises, starting first with i=1:

a) setting S_{T i}=S_(XYZ)i, where S_(XYZ)i is the number of available symbols of type (XYZ);

b) rendering FULL information for symbol type (XYZ)_i on the map display if S_{T i}<

S _i(F)_XYZ is TRUE, where S _i(F)_XYZ is a first threshold constant for symbol type (XYZ)_i, or if S_{T i}<

S _i(F)_XYZ is FALSE;

c) rendering MINIMUM information for symbol type (XYZ)_i on the map display if S_{T i}<

S _i(M)_XYZ is TRUE, where S _i(M)_XYZ is a second threshold constant for symbol type (XYZ)_i, or if S_{T i}<

S _i(M)_XYZ is FALSE rendering none of symbols of type (XYZ)_i on the map display; and

d) repeating steps (a)-(c) for i=2 to N, thereby populating the map display with a controlled number of symbols.