Electronic map display declutter

• US 6,973,386 B2
• Filed: 12/20/2002
• Issued: 12/06/2005
• Est. Priority Date: 12/20/2002
• Status: Active Grant

• Current Assignee: Honeywell International Inc.
• Original Assignee: Honeywell International Inc.
• Inventors: Gibbs, Michael J.
• Primary Examiner(s): Black, Thomas G.
• Assistant Examiner(s): Broadhead, Brian J.
• Application Number:
  US10/325,185
• Publication Number:
  US 20040122589A1
• Time in Patent Office: 1,082 Days
• Field of Search: 701/205, 701/211, 701/212, 340/995.1, 340/995.14, 340/995.15, 340/995.24, 340/995.27
• 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 subsequently initializing i=1 and S_T′

=S_T;

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;

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(F)_XYZ is FALSE and if S_T<

S_i(M)_XYZ is TRUE, where S_i(M)_XYZ is a second threshold constant for symbol type (XYZ)_i;

d) delivering S_T=S_T′

−

S_i(XYZ)i to step (e) if S_T<

S_i(F)_XYZ is FALSE and if S_T<

S_i(M)_XYZ is FALSE, where S_i(XYZ)i is the number of available symbols of type (XYZ)_i; and

e) repeating steps (b)–

(d) for i=2 to N and initializing S_T′

=S_T, 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 as a user selected symbol 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 symbol type (XYZ)_j for 1<

j<

N comprises at least two symbol sub-types 1PQR and 2PQR, wherein for symbol type (XYZ)_i steps (b)–

(d) are first performed for symbol sub-type 1PQR using threshold values S_i(F)_XYZ=S_j(F)_1PQR and S_i(M)_XYZ=S_j(M)_1PQR and steps (b)–

(d) are then performed for symbol sub-type 2PQR using threshold values S_i(F)_XYZ=S_j(F)_2PQR and S_i(M)_XYZ=S_j(M)_2PQR using the S_T value resulting from steps (b)–

(d) for symbol sub-type 1PQR.

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_Ti=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_Ti<

S_i(F)_XYZ is TRUE, where S_i(F)_XYZ is a first threshold constant for symbol type (XYZ)_i;

c) rendering MINIMUM information for symbol type (XYZ)_i on the map display if S_Ti<

S_i(F)_XYZ is FALSE and if S_Ti<

S_i(M)_XYZ is TRUE, where S_i(M)_XYZ is a second threshold constant for symbol type (XYZ)_i, or if S_Ti<

S_i(F)_XYZ is FALSE and if S_Ti<

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 as a user selected symbol and using the selected symbols in steps (a)–

(d) for that symbol type.

8. The method of claim 5 wherein symbol type (XYZ)_j for 1<

_i<

N comprises at least two symbol sub-types 1PQR and 2PQR wherein for symbol type (XYZ)_i steps (a)–

(c) are first performed for symbol sub-type 1PQR using threshold values S_i(F)_XYZ=S_j(F)_1PQR and S_i(M)_XYZ =S_j(M)_1PQR and then steps (a)–

(c) are performed for symbol sub-type 2PQR using threshold values S_i(F)_XYZ=S_j(F)_2PQR and S_i(M)_XYZ=S_j(M)_2PQR.

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 subsequently initializing i=1 and S_T′

=S_T;

(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;

(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(F)_XYZ is FALSE and if S_T<

S_i(M)_XYZ is TRUE, where S_i(M)_XYZ is a second threshold constant for symbol type (XYZ)_i;

(4) delivering S_T=S_T′

−

S_i(XYZ)i to step (5) if S_T<

S_i(F)_XYZ is FALSE and if S_T<

S_i(M)_XYZ is FALSE, 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 and initializing S_T′

=S_T, 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 as a user selected symbol 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 symbol type (XYZ)_j for 1<

j<

N comprises at least two symbol sub-types 1PQR and 2PQR, wherein steps (2)–

(4) are first performed for symbol sub-type 1PQR using threshold values S_i(F)_XYZ=S_j(F)_1PQR and S_i(M)_XYZ=S_j(M)_1PQR and steps (2)–

(4) are then performed for symbol sub-type 2PQR using threshold values S_i(F)_XYZ=S_j(F)_2PQR and S_i(M)_XYZ=S_j(M)_2PQR using the S_T value resulting from steps (2)–

(4)) for symbol sub-type 1PQR.

13. The apparatus of claim 9 further comprising a second program residing in memory comprises, starting first with i=1:

(A) setting S_Ti=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_Ti<

S_i(F)_XYZ is TRUE, where S_i(F)_XYZ is a first threshold constant for symbol type (XYZ)_i;

(C) rendering MINIMUM information for symbol type (XYZ)_i on the map display if S_Ti<

S_i(F)_XYZ is FALSE and if S_Ti21 S_i(M)_XYZ is TRUE, where S_i(M)_XYZ is a second threshold constant for symbol type (XYZ)_i, or if S_Ti<

S_i(F)_XYZ is FALSE and if S_Ti<

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.

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 as a user selected symbol 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 symbol type (XYZ)_j comprises at least two symbol sub-types 1PQR and 2PQR, wherein steps (1)–

(3) are first performed for symbol sub-type 1PQR using threshold values S_i(F)_XYZ=S_j(F)_1PQR and S_i(F)_XYZ=S_j(M)_1PQR and then steps (1)–

(3) are performed again for symbol sub-type 2PQR using threshold values S_i(F)_XYZ=S_j(F)_2PQR and S_i(F)_XYZ=S_j(M)_2PQR.

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 initializing S_T′

=S_T;

(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;

(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(F)_XYZ is FALSE and if S_T<

S_i(M)_XYZ is TRUE, where S_i(M)_XYZ is a second threshold constant for symbol type (XYZ)_i;

(d) delivering S_T=S_T′

−

S_i(XYZ)i to step (e), if S_T<

S_i(F)_XYZ is FALSE and if S_T<

S_i(M)_XYZ is FALSE;

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 and subsequently initializing S_T′

=S_T, 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 as a user selected symbol 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 further comprising a second program starting first with i=1:

A) setting S_Ti=S_(XYZ)i, where S_(XYZ) 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_Ti<

S_i(F)_XYZ is TRUE, where S_i(F)_XYZ is a first threshold constant for symbol type (XYZ)_i;

C) rendering MINIMUM information for symbol type (XYZ)_i on the map display if S_Ti<

S_i(F)_XYZ is FALSE and if S_Ti<

S_i(M)_XYZ is TRUE, where S_i(M)_XYZ is a second threshold constant for symbol type (XYZ)_i, or if S_Ti<

S_i(F)_XYZ is FALSE and if S_Ti<

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.