SA95160250B1 - method for automatically displaying map symbols - Google Patents

Abstract

Abstract: The present invention relates to a Geographic Information System (GIS), in which a computer retrieves records from a data base for each map feature within the range of the displayed portion of the map. Records of point features are organized into “flat” structures, where each map feature is represented by a single symbol, and into multi-level “hierarchical” structures, where each feature is represented by a hierarchy of symbols. which represent different resolutions for the map features. For a hierarchical symbol structure, the level of records retrieved by the computer is determined by the scale of the map displayed on the screen. The computer determines, for each symbol at its own map scale, whether the symbol overlaps significantly with any other symbol. Symbols that overlap significantly are modified to reduce clutter by either merging the overlapping symbols into a single symbol that includes a numeric identifier, or replacing the siblings with the single parent symbol in the hierarchy. The symbols from the modified register are displayed on the display screen.

Description

Method For Automatically Displaying Map Symbols Loli Method For Automatically Displaying Map Symbols : Full Description Background of the Invention A | 1. Scope of the invention The present invention dag relates in general to the field of Geographic Information System (GIS) and in more precise terms the present invention relates to a method for displaying oo map symbols automatically. According to the current map scale and .symbol overlap: ". Related technology description: A typical Geographic Information System (GIS) uses a computer for the purpose of accessing records from a database data base in order to display maps and symbols of map symbology 0 on the display screen, and the records contain spatial and descriptive information associated with the features in the map le | Features are represented graphically in the form of points, lines, and areas, and point features records include a descriptive symbol for the feature. A schematic representation of these features is displayed, including the feature symbols. In a military application, point features such as ctroop units, aircraft, planes, and artillery pieces are added to normal geographic features such as roads. roads, canals, waterways, buildings, cbuildings, and are placed above the superimposed geographical map on the display screen. : E: Um

¥.

0 The analyst can view the map view to determine the troop strength and their locations. The analyzer works with Geographic Information System (GIS) for the purpose of zooming in or zooming out on the map to display a desired part or scale of the map. Features within the selected part of the map are displayed as point symbols, lines, or areas.

0 It is important for Tan to display the map clearly and accurately describe its features at all map scales and for all map areas. : This way of displaying map symbols has a number of drawbacks. However, if the projected portion of the map is densely populated with map symbols, a cluttered accumulation of overlapping symbols can occur in the display. furthermore 0; Laie The analyzer shifts the image to display a larger part of the map; Additional symbols are displayed on the display as close as cm to increase the clutter due to overlapping symbols. In addition; The degree of irregular symbol accumulation (isk display) may vary depending on overlapping symbols in local regions of the map. Uneven symbol accumulation reduces the analyst's ability to accurately evaluate visual display Vo. a and at the present time; The only option available to the analyzer is to zoom-in the image until the uneven symbol accumulation is reduced to an acceptable level. Although the resolution of the 00 map display may change, the resolution of the map symbols is constant. This inhibits the analyst's ability to view large-scale areas of the map and; If it is desirable Yo differentiate Sad symbols; It takes a significant amount of Jad time to zoom in on each part of the entire region to gather the necessary information. The current method used to display map symbols fails to solve the problem of uneven accumulation due to overlapping of symbols in Jd L

: General Description of the Invention The present invention seeks to provide a method for displaying map symbols that works on the problem of uneven accumulation due to overlapping of symbols Providing multiple resolutions of symbols; Tad map symbols change the scale of the displayed map; Gas symbols adapted to overlap symbols in local areas of the displayed map; and reduce user interaction to a minimum. These objectives are achieved by selecting the appropriate degree of clarity for the map symbols. LAS to provide a display free of clutter and a detailed Lind that depends on the degree of overlap between the symbols displayed. The computer retrieves records from a database for each map feature located within the projected portion of the map. The records of point features1 are organized into cus “flat” structures, in which each feature represents 0 of the map feature with a single symbol, and into multi-level “hierarchical” structures. level "hierarchial" structures where JL Aa is each feature in a hierarchy of symbols, which represent different resolutions of the map features. displayed on the display ve the computer sag for each point feature symbol and at the map's own scale Lad if the symbol overlaps significantly with any other symbol overlapping symbols are greatly modified to reduce irregular buildup by either merging Symbols nested into a single symbol include Fe numeric identifier Ld by replacing the siblings with the single parent symbol in the hierarchy. Symbols from modified records of the © bitmap features are displayed on the display with the features populated as lines In an alternative embodiment of the invention, the degree of irregular accumulation of symbols is computed in terms of the density of symbols in the Alas region of the map. And in the embodiment of Al; Icons are reduced in size to reduce overlapping icons. And in the AT embodiment as well; The level of records is determined from the scale of the map by means of a Jook-up table vo a : m ov

a brief explanation of the drawings for a better understanding of the invention and an indication of how it can be applied in practice; LEY (example Y) limitation 4 to the attached drawings will be where: Figure Jia) block GES Taw: 1 Su ay Geographic Information System (GIS) present invention to display map symbols; Figures A and B | : represent two diagrams of a co-level symbol structure and a multi-level hierarchical symbol structure, respectively; A wf : represent two flowcharts showing how the method reduces the degree of uneven accumulation between map symbols; Figures from Je #D : represent displays showing the expression of numeric symbols at different scales. Figures A and B : represent Two displays showing the expression of hierarchical symbols at different (pale) Fig. Jia : 17 Gig flowchart for a tailed embodiment to reduce the degree of irregular accumulation between map symbols; Fig. A | : Thy flowchart For an alternative embodiment of calculating the degree of non-uniform accumulation between map symbols by measuring the density of symbols; and “+ Fig. Jia Fig. 1 is a block LHS drawing of a geographic information system embodying the present invention for displaying map symbols; Analyst 01 interacts with the VY geographic information system to display ve maps and map symbols. The GIS includes 11 VE screens to display the lov map

4A . 8 and map symbols OT computer 18 to control the display of the map on the screen VE and database 10 contains map symbols 1 1 map 0 defines LY and database 0 contains ? 0 on linear feature registers 1 ?; YY area feature registers and point feature registers ??; Each raster feature record includes Lena 4% Tay of the symbol (Tag) AY of the x-coordinate (x) 0 and y coordinate Whee YE (y) of structure 77 and includes in the case of the structure hierarchical; ID of an original record 4. The database also stores the boundary coordinates 90 of the entire map as well as the boundary coordinates TY of the part of the map displayed on the screen. The boundary coordinates determine the size or extent of the map. The computer includes 18 YE zoom functions that allow the user to display different parts of the map at different scales 0 : and an algorithm for displaying WU symbols in order to control processing and display symbols 11 from the YY raster feature registers On screen 6 1

User 01 interacts with the VY Geographic Information System via WA keyboard and mouse 56 to select part 47 of the map 10 by approximating SoH FE the new boundary coordinates 1 from the displayed part ?; from the map ve to the computer AA and the zoom function YE uses the coordinates FY to determine the display size of the new map 10 and selects all map records 1 ?? and ?? YW, located within the selected part of the map. The registers are supplied to the PN symbol display algorithm and the approximation function calculates the scale of the drawing; 4 for the new map display screen to calculate the ratio of the size of the displayed part of the map as defined by boundary coordinates PY to the size of the entire map as yy defined by coordinates Y In the previous technique, the symbol display algorithm simply transfers the records provided directly to the display screen VE and in the present invention the algorithm 0 display symbols YY processes raster feature records 17 Gala of scale £4 and overlapping symbols 47 arising from the proximity of symbols 16 and their sizes to calculate the degree of irregular accumulation 17 per record. The result is a display that has a high level of symbol clarity with

JB ve a degree of irregular accumulation due to overlapping symbols. love:

Figure ?a is a diagram of the structure of symbols located on the same plane. Each type of single-level or scalar structure represents 58 point features; Aircraft, tanks or enlisted troops created with a single numerical class 1 of the symbols NT and the symbols in a numerical group can be combined with each other to reduce overlapping symbols. The combined symbol includes a numeric identifier 0X0 and has coordinates ; ? equals The average center of the coordinates of the embedded symbols. The @Y figure is a diagram of a multi-level hierarchical hierarchical symbol structure. Different types of 04 hierarchical structure of point features include troop units, aircraft, or tanks. The symbols are different at each level of the hierarchy, so the Each level in the hierarchy has a corresponding class 07 of the AT symbols. In Figure B the division; An approximation of the coarsest level of symbols. Each of the successive levels (oY level oF level ...) contains several such al 0 symbols that are offshoots of the parent symbol from the adjacent higher level of the sequence Hierarchical and represents a finer degree of clarity of the notation.Vo and in the form @Y the symbol 001 which represents the upper level of the hierarchy has three branches 011, 10 and 10 in the second level. Each of these symbols has two branches eg specifically, the code 014 has two branches, 01# and 1001, and the code 01# has three branches 1, 1411 and 11 at the lowest level of the hierarchy. Similar symbols are defined as those symbols that have the same original symbol. Therefore the symbols Veg Es VY are _symmetric symbols as are the symbols AY es 01# and organize the YY registers that include the individual symbols; coordinates; Token sizes ID the structure type and the original record in the same hierarchical structure depicted for the tokens. If the symbols and corresponding records are organized in such a hierarchical structure, the symbol display algorithm PN investigates the degree of irregular symbol accumulation by selecting the initial level of encoding from the Bola hierarchical structure of the 4 4 L scale

A | A of the displayed map; And then replace symbols that overlap with other symbols with the original symbol in the adjacent higher level of the structure. Figure © is a high-level flowchart showing the basic steps to reduce the degree of uneven accumulation between map symbols. fans display map symbols 0 : In step Lovie OA the computer retrieves user input; Which includes the desired part of the map 49 for the FT code display algorithm, and after retrieving the user's input, the computer starts the function of approximation and distance in step Ve, and in this step the computer knows the database records located within the limits of the desired width as determined by the boundary coordinates "© from the part £Y from map 010 and calculates the scale of the displayed map as the ratio of the size of 0 - the whole map to the size of the projected part of the map and displays the geographic map features Lay in including symbols from line 1? and area records egy.

YW The computer starts the symbol rendering algorithm by retrieving the raster feature records defined YY (step 17) and calculates the degree of

Uneven accumulation 67 per YF register (step (VE) | The degree of irregular accumulation is related to the overlap between the symbol and neighboring symbols ve when displayed on the screen. Although the symbol size and distance between symbols are in terms of coordinates The map may remain constant, the displayed distance between symbols and therefore the amount of overlap as seen on the screen changes as a function of map scale When image z is used to display a wider area of the map, the relative distance between the symbols becomes smaller and the overlap increases, leading to irregular buildup As the user zooms in to view a local area of the map, the relative distance between symbols increases and the amount of irregular overlay decreases

| for overlapping symbols. pos

According to the non-pill score of 7+ for each of the symbols, the computer later modifies the registers in the TN step to reduce the overlap between symbols and reduce the uneven piling seen by the viewer of the screen. If the YY records in the database are organized into a ve structure at the same level or a CEA numerical structure, then the records corresponding to each set of symbols lov

3. The nested ones are replaced by a register with the same VT symbol and a numeric identifier of 7*.equal to the number of characters replaced. And the coordinates of the replaced symbol 176 are equal to the center. The mean of the replaced symbols. As for the case in which the symbols are organized in a hierarchical structure of sequence 4 *, the records are processed sequentially, and if the symbol from the current record is strongly intertwined with any other symbol, then the current record with all 0 records of similar symbols is replaced by the original record. for example; It using the hierarchy defined in the figure ? If the register Jal includes the code 011 and the computer determines that 01" adel and 10 are too closely intertwined then the registers for the codes VY, 10 and 10 are replaced by the original code register .001 y | In step 7 the computer places the modified registers In S13 3 temporary storage ATA database without changing the original records in the database.In step 1l the computer displays the symbols from the records in the TA on the display screen.The GIS works continuously Bia Displays maps and map symbols in real-time in response to any user zoom-outs or changes to records in the database. TY between the map symbols. In Figure it, the computer retrieves user input (step 0A) so as to start a zooming function (step Te) in which the computer knows which records in the database fall within the desired part £Y of the map 15 and displays the line and area features.Next, in step VY the computer reads a specific control option © to user ed of the symbol display algorithm to determine the mode of operation. If the algorithm is not in automatic mode, the computer retrieves a fixed level of registers YY from the structure (step 64 1); the level is specified by the user either as input or as default. For a scalar structure there is only a single lower level but for hierarchical structures there are several levels 0 available for the user to choose from. This option allows the user to see a consistent level of Ye degree symbol clarity throughout the entire display; Although the degree of clarity may not be perfect and may be a lam.

Display is irregularly stacked due to overlapping symbols. The algorithm places records in TA in the database (step VT) and in YA step the computer displays the symbols from the cached records on the display screen. If in VY step it finds that the algorithm is in automatic mode; The computer calculates the map scale (VA step) and the map scale is an indicator of the resolution of the displayed map and is used to choose the initial level of symbol representation in the hierarchical structure. The map scale is calculated as the ratio of the map size to the display size, namely: Seale - 0 ie) (Equation 1) 1 In the embodiment shown of the invention and in a typical geographic information system the display screen is square and therefore all parts shown of the map are square; otherwise the maps are distorted when displayed on the screen. The map and the view are both square Scale can be calculated using the y coordinates Maximum and minimum for each. Attains Map scale achieves its minimum value of 1 when displaying the entire map ee screen Displaying any smaller part of the map yields a scale Graphic is greater than 1 and scale increases as the displayed part of the map becomes smaller. In step Av, the computer determines an initial level of coding for the hierarchical structures based on the computed map scale. Map scale provides an approximation of the sharpness of symbols needed to display map features adequately. By entering the hierarchy at 0 intermediate level compared to the higher level, the number of accounts and execution time can be reduced. Where errors occur in the method of selecting the initial level on the side of the higher level or the degree of clarity of finer symbols. Starting too high increases the number of accounts, but starting too low provides a level of unnecessary shrewd coding. In hierarchical structures, the upper level is denoted by level 1, and the next level is denoted by vo at the lower level. and so on. To select the initial level in the hierarchy to start the process: a

1 Removing the irregular accumulation from it, the map scale value is simply rounded to the largest number: true unless the scale is exactly equal to an integer in which case it remains the same for example; If you display the entire map, the scale is exactly one, and the notation is chosen at the first level in the hierarchical structure. And if the drawing is scaled, then this value is rounded to ? It selects the records corresponding to the third level of the struct YY equal to M. The computer retrieves the hierarchical records at the hierarchical level (AY). In the selected step, the corresponding numerical records from the database. 0 Specific steps used to reduce After retrieving map symbols between map symbols 57 clutier 'degree of irregular accumulation' from the database defines the appropriate YY point features records Point feature records 0 Computer First record from These records as the current record (step 84); the AT algorithm (file step) checks to see if the record is the last record in the file and identifies each successive record as the record 75 symbol display algorithm Displays symbols starting from the record corresponding to the current maximum estandard raster format in standard raster format, left-to-right, top-left display Cael (display Cael) down until reaching the bottom right The algorithm works on 0 adjusting the current record so that the degree of irregular accumulation associated with the symbol from that record is computed as an overlapping distance AA and the computer in step AY Tuas from a specific level Ji of the current record. AS overlap distance centroids A The overlap distance is the minimum distance that should be provided between the centroids 7 of two symbols to avoid uneven overlapping. And if the current record is of a scalar structure for any two symbols in the structure. And since AQ single is stubborn; One structure overlaps other symbols of the same structure; The ae symbols from the numerical structure are replaced by combining them. The computer measures only the interference created by the symbols in the same numerical structure. In addition to that; The computer should only calculate one overlapping distance because there is only one class, ve lov

VY

of the symbols in the numerical structure. However, if the record is of the hierarchical structure of the sequence, let it be: 10; The algorithm will overwrite the register if the symbol overlaps too much with the structure of any other symbol. The computer determines an overlapping distance from the current symbol to every other class of symbols; symbols in a different class in the same architecture; ASN characters, including symbols belonging to the same - exist in different hierarchical and numerical structures. 0

VY size aan is: parameters on three elements 84 Jalal and dependent distance to another register and a threshold overlap ratio of 16 from the current register; The symbol size is 16 Se, which defines a circle surrounding the radius. The symbol size is represented by half a diameter. 911 threshold overlap percentage is the percentage of 91 in the symbol, even if the symbols are not necessarily circular. The threshold overlap ratio before the degree of non-tolerated overlap between two symbols accumulates 0 resulting from overlapping symbols exceeds a predetermined level. A threshold value of uniform TY: 6 equals 0 Ay she indicates that no irregular accumulation can occur; A ratio of 0 overlapping distances for the current record Gundy indicates an uneven build-up that occurs when two symbols overlap. The symbol is represented by an optional roll K and the number of symbol classes is represented by the symbol stored *“n specifies the overlapping distance of the class “g by the following equation: arbitrary class (with threshold) 96 (Equation ?) Migla-001(*)0 S51) = overlap distance radius of the current symbol Jagr 0001 and where the threshold value denotes the number of ranges from zero

J is the radius of a symbol belonging to the class and by specifying the overlapping distances of the symbols in the current record; The computer calculates the distance from the center of the current symbol to the center of each of the following symbols; Step + 5. Since the © screen is at a certain map scale; The distance between the symbols Ale The display is a copy The displayed on the display screen is a modified copy with a specific scale for the distance between the symbols The displayed distance is included in equation .7 ex in terms of the following x- and y-coordinate axes of the map: © Scale (equation?) Su) Scale Sa) -Scale Yo lov :

VY

1 represents the scale of the map as specified in the equation Scale Cas denotes between the centers of symbol 8, and the other symbol ,8; euclidean distance Euclidean distance Dy (Sy, 5 displayed distance Dy (Sy , 5,) is the displayed distance between the symbols. D(S,, 5) represents the Jad structure that changes proportionally to the scale of the map. If the record is D(S,, 5) m is a scalar ; only calculates the distance between symbols from that structure. In step AY the computer computes the degree of irregular accumulation of log Jad by comparing the distance for each symbol 1), 5 (Sa) with the corresponding overlap distances; overlap distance g where the symbol is . Sy 0 | .of EAD If any of the distances is smaller than the required overlap distance, then the degree of irregular accumulation of the current record exceeds the predetermined level.In step At 0 > if the degree of irregular accumulation does not exceed Regular set level Buse programs return to step (Af) get the next register and repeat the loop as that register is the current register. It is noted that in step 90 the distance is only calculated from the register current to each of the following records because any irregular backlog between the current record and previous records has been removed. A Vo and if the degree of irregular accumulation exceeds the specified level (ie in step A) the computer determines in step AT whether the current record structure is hierarchical or numerical. If the current record is of a numerical structure, the computer replaces In step AA the current record and all other records of the same structure whose distance (5, , 2)5 is less than the overlapping distance, with a new record with the same symbol and a numeric identifier whose value of id is equal to the number of ys records replaced. The coordinates of the new symbol are calculated as the average center of the coordinates of the replaced records.If any of the replaced records has a numerical identifier whose value is greater than 1, the value of that identifier is taken into account in the numerical identifier of the call symbol, and the coordinates of that symbol are weighted by the value of the identifier when calculating the average center of the coordinates of the new symbol Adding the numeric identifier does not affect the size of the symbol, so the computed overlapping distance for the existing symbol is usable for the new ell ve formed.

VE . If the current record structure type is hierarchical; The computer determines whether the current record has a parent record in the structure; That is, if the current record is at level one of the chierarchy step .01 and if the record does not exist. the original; The computer in step 177 reduces the size of the symbol. But if the original record exists; The computer replaces the current 0 record and all similar records (from the same source) siblings with the original record (VE step).

The algorithm returns to step AA and recalculates the overlap distances. In the case of a hierarchical structure, the parent symbol may have a different size than the childrens child symbols, and it is clear that reducing the symbol size affects the calculation of the nesting distance. The procoss algorithm processes the current record until the backlog caused by overlapping symbols is removed. And at this point; 0 - The algorithm at step 44 returns to step Af to get the next record to process. And when the algorithm Just AY record in step AT the computer returns the modified records to a temporary storage area in the database (data base step VY and in step YA 3> the computer retrieves the record from The temporary storage area and displays the corresponding symbols on the screen : Figures #A-#D represent Ales pia displays expressing numerical symbols at different scales. In the displays shown in Figures 5a-9d, the user brings the map image closer and closer. In this case there is a single numerical hierarchy Diag Je airplane and in Fig. 10 displays a single symbol having a digital identifier of TV and the resolution of the symbol is appropriate to the screen scale and avoids any signs of irregular accumulation of symbols. 8b User zooms in on the image at twice the amniometer scale so that (OY) the six planes can be clearly represented by two symbols each with a numeric identifier of ? This provides a higher resolution of the map symbols without overlapping the symbols. In figure o c the symbol on the far right can also be shown as three single planes xe without overlapping symbols. However, replacing the symbol in the far left with three single planes of scale “oy | vo” causes overlap between the symbols, so the algorithm displays that symbol with a numeric identifier ga in this graphic. Its value is ?. and in Figure #d; User zooms in on the image at a scale four times the scale of the original drawing, which displays a significantly higher resolution of the map and higher resolution of individual planes. The Display 1 algorithm appropriately selects the map symbols on the map shape. The appropriate resolution of the map symbols is based on the scale 44 of the 0 screen of the display. Tocal areas Width and overlap £1 for symbols in local areas Figures 1a and 7b are represented Two displays showing the process of expressing the hierarchical symbols in two different scales. The hierarchical structure used in Figures A and Ib is illustrated in Figure B. In Figure 1a, the display screen includes a relatively large part of the 1+0 map at a low resolution. The expression process for symbols selected by -0 corresponds Algorithm with appropriate display scaling so that only the node of the hierarchy is displayed. In Figure b user closes the image by twice the top node scaling and resolution; the algorithm replaces the single symbol at the top level with two symbols in the second level of the hierarchy and four symbols in the third level, top level, but clear to the user. Changes therein without deviating from the scope of the invention as defined in the accompanying claims; and their equivalent. Map. The flowchart in Figure -© replaces the Operations in Figure C. In this alternate embodiment, the algorithm reverts to step 84 after The effect of this change is to specify Process AA instead of Step ATES 177 AA Steps. | Most of the problems of irregular accumulation in single iteration of the current record are solved by a single pass (J) als the first iteration of the record, and thus a fundamental improvement can be obtained. The implementation of the symbol display algorithm. of records which speeds up” ov

V1 - Figure A represents a flowchart showing an embodiment of Dy to calculate the degree of irregular accumulation between map symbols by measuring symbol density AFT and replaces for steps AA 0 and in figure af for step 191 In Figure 8. In Pegs hall, the computer calculates the symbol density around the current record. Density can be calculated as the number of symbols whose coordinates are within a circle around the coordinates of the current record. The radius of a circle is a number equivalent to Se ? Times the radius of the current symbol. step 197 is replaced by step 446 where density is compared; which is measured as the number of symbols present in Bal with a specified threshold number. pre. If the density is less than the threshold value, there will be no irregular accumulation and the algorithm returns to step 84. If the density exceeds the pre-determined threshold value, the 0 | - algorithm proceeds to step 95. Step 98 of replacing the scalar type of the log is slightly modified so that it replaces the current record and those records with symbols belonging to the same category within the circle with a record containing one symbol; digital identifier The coordinates are equal to the mean center of the replaced coordinates. After performing steps NYY AA and 14, the algorithm reverts to step 84, saving only one Tl pel per record. Veo Fig. 9 is a flowchart showing another alternative embodiment of the initial record computation or symbol expression level for hierarchical structures where it replaces step Av in Fig. de and in step VA the computer determines the scale of the displayed map. Step 4 17 The computer determines the relationship between the plot scale and the initial symbol level in the hierarchical structure by using a look-up-table (LUT) v- and 1107 can be programmed for each type of hierarchical structure Structures have a variable number of levels Judy have different degrees of clarity in their symbol classes The mapping performed by TUT may be as simple as the rounding up function described in Figure 18 or it can be a more sophisticated mapping that obtains .trial and error | : lov

Claims (1)

7 Claims 1-1 A method for displaying symbols from a data base on a Y display screen. physical display including: 0 a retrieving Ae gana retrieving of symbols from the database; ¢ computing the degree of irregular clutter between the mentioned symbols; ° Modifying the symbols automatically Tila si ol to reduce the degree of non-uniform 1 accumulation based on the said calculation step; And . 7 Displaying modified symbols on a physical display. i 7- The method of pail (ad) protection 1 Cua The step of calculating the degree of irregular accumulation between the mentioned symbols includes: or calculating the symbol overlap between at least two of the mentioned symbols. 1 * - The Gy method of the claimant, where the mentioned symbols are organized into several symbol classes and where the overlap of symbols is calculated between symbols belonging to the same class. Calculating the degree of irregular accumulation between the mentioned Y symbols: 1 Y calculating the density of the symbols 1 ©*- A method according to Claim 1 where the step of modifying the symbols includes: - Replacing symbols in case of overflow The degree of irregular accumulation is a specific level, Tse, with the symbol ay ov m VA: 1-1 Gy method for sandbox 0 ux includes the symbol substitution step: Y include the re numeric identifier in the new symbol; where is the value of the identifier 1 equal to the number of symbols to be replaced. 1 7- Wy method for claim element 00 where each of the symbols has an accompanying set of coordinates : and where the substitution step includes the symbols: coordinates Y —A \(ad) method for the protector Y where the coordinate set calculation step includes: 1 Calculating the centroid for symbols in which the degree of irregular accumulation exceeds 7 Level Maal is already set. \ 9- method praia (ad, protection 0 where AE are symbols mentioned in sae classes of symbols Y -- where the substitution step for symbols includes: » -- substitution for symbols in each category where the degree of irregular accumulation exceeds the level of Ane ¢ already has a new symbol for that class. :——Y \(ad) method of claim 3 where it includes the step of calculating the degree of irregular accumulation 1 Among the listed symbols Calculate the first non-uniform accumulation score among the symbols in the category for each category 7 and the degree of A is a second irregular sleeve between the symbols in different gestures and where (para) is a step 4 Modify the symbols as well: : Modify symbols where the degree of nonuniform accumulation exceeds a second between symbols SLED 4 A: Different pre-defined level II to reduce AN A irregular symbols. A mother Va 11-1 method according to claim 01 where the step of modifying the symbols includes: Y Replaces each block of symbols with a new symbol. 1-171-1 Gs method for claim 01 wherein the symbol modification step where the Y score exceeds the uneven accumulation between symbols of different classes involves a predetermined second level: 1 Change the size of icons. | : 1 1 - A method according to the VY claim, where the import step includes each of the Y groups of symbols: Include a numerical identifier in : the new symbol for each (de gana) such that the value of the identifier is equal to —-\V¢ 1 method (Gd, for claim 1 where the step for calculating the degree of irregular accumulation Y defines groups of pall so that each of the groups includes symbols where Tv : The degree of irregular accumulation between symbols exceeds a predetermined amount. -1#© 1 A way to display symbols from a database on a physical display; where the database contains a multi-level hierarchical structure of records where the v records at each successive level are the parent records of the records at the previous t level; Each record includes a symbol; coordinates for symbols and an identification of an original record; The method includes: 1 (i) Choose a level for the record in the hierarchical structure; Cy (b) retrieve Bac records from the database at the compressed level; A (c) calculate the degree of irregular accumulation between the symbols mentioned in the records lov i Ye retrieved; 9 (d) automatically modify the retrieved records by replacing records where they override Ve with their original records; f line irregular accumulation by a specified amount da 11 (e) display symbols from modified registers on the physical display. Each of the types of Spa) tokens mentioned in several classes of GBs "z 1 Structures is associated with one class of tokens; the method includes: Retrieving several records from the database at the level chosen for each type of Structure 1 A: 5 Calculate the degree of irregular accumulation of records at the chosen level in each of the 1 types of structures, and m v Modify the set of records in each structure by replacing records where A exceeds the degree of irregular accumulation by an amount predetermined by their original records. q for claim 19+ wherein the step of calculating the degree of irregular accumulation Ty involves the method of YY among the said symbols calculating a first degree of irregular accumulation between symbols in each 1 structure and a second degree of accumulation and where CA the symbol modification step includes the additional step 1 modification of symbols where the second degree of nonuniform accumulation between symbols is exceeded in ° to reduce the nonuniform accumulation between symbols. 2nd level 1 Where the step of modifying symbols where the degree of VY exceeds the method according to the VA protection element includes the irregular accumulation between symbols in different structures A predetermined second level: Y Change the size of symbols. 0 L F. -19 1 method under claim 06 where the database includes a set of boundary-7 coordinates specifying what records are in the set of records retrieved from database-7 and where the level selection step includes: defining the set of boundary coordinates; and ° calculating the log level in the structure from the set of boundary coordinates. 0-1 method under Claim Vo also includes: (f) incrementing the log level; and repeat steps (c) OFF until b the uneven accumulation between symbols has sufficiently reduced. : ——YY 1 method in accordance with claim 10 dua The step for calculating the degree of irregular accumulation of y between said symbols includes: oy Computing the overlap between at least two of said symbols. ~YY 1 1 Ey method for claim 10 Cus The step for calculating the degree of irregular accumulation Y between the mentioned symbols includes: ¥ Calculating the density of symbols 1 1 .density of symbols - method (ad For the claim ml where onl is the step of calculating the degree of irregular A how many irregular Y records to Ole gana se ¢ each includes records such that ia BY yo The irregular accumulation between symbols the predetermined amount. —VE 1 method according to claim (YY) where modification of symbols includes: Y replaces each group of records with the original record. ov T.Y. 1 ©?- a way to display symbols from a database on a display; where database Y includes a digital map that includes map coordinates and a multilevel hierarchical v-log structure where the records at each level are JB the original records of the records at the previous level; Each register has Gay coordinate symbols and is identified by register Lal 5. The method includes the following steps: 1 (1) Display a portion of the digital map on the display screen; v (b) compute a certain level of record in the hierarchical structure from the coordinates of the map/part of the map displayed on the display screen; 1 > (c) retrieve a set of records from the database at the selected record level; Ve (d) calculate the degree of irregular accumulation between the symbols mentioned in set 11 retrieved from the records; \Y (e) Automatically modify the retrieved set of records by replacing records Lexie VY exceeds the backlog score. irregular by an amount predetermined by their original records; Ve ( f ) increment log level; and repeating steps (3) and (e) until the degree of irregular vo accumulation between symbols has sufficiently reduced; and (g) displaying symbols from the Asal set of records on a computer screen. -YT 1 A computer-implemented method to reduce the non-uniform symbolic accumulation X; where Ai database includes Joe Lull multi-level hierarchical records 1 where the records at each level are JB the original records of the records at ¢ the previous level; Each record includes “Jay” coordinate symbols; identified by the original record; The method includes the following steps: : (a) choose a record level in the hierarchy; v (b) retrieve multiple records from the database at the selected level; A (c) Calculating the degree of irregular accumulation between said symbols in the retrieved lov vy records; and q automatically. By replacing the ED records (d) modifying the retrieved set of Vs in advance with its original records. Toda when the degree of irregular accumulation exceeds 111 lam.