DE102018122847A1 - Computer-implemented method for filtering personal parameters and display device - Google Patents

Abstract

Computer-implemented method for filtering personal parameters when displaying virtual characters in an interactive virtual online environment on a first terminal with a display device of a first user, each virtual character being assigned to a user of the online environment, with the following steps: identifying (410 ) the characters to be basically displayed on the first display device of the first user, for example by means of a matching method; Assigning degrees of prioritization (435) to each character to be represented in principle; Determining the coordinates of the characters to be displayed in the virtual online environment; Comparing the determined coordinates and identifying possible coordinate collisions; Display of all characters to be displayed without coordinate collision; for characters with coordinate collision, selecting the character with a higher degree of prioritization and displaying this character on the display device.

Description

The present invention relates generally to the field of software and network technology. In particular, the invention relates to a computer-implemented method for filtering personal parameters and a corresponding display device.

The method according to the invention for filtering personal parameters represents the technical feasibility of a single instance (singularity) of a virtual environment with an unlimited number of users, who only perceive the part of the virtual environment that is relevant to them and thus limit the computing power and network traffic required for this .

The development of computer and network technology has seen a dramatic development in recent decades. From computers that occupy entire rooms to the personal computer that finally made this technology accessible to ordinary people, right up to today's electronic devices, e.g. in the form of desktop PCs, laptops, tablets, smartphones, consoles, virtual reality glasses, etc. The enormous demand and desire of users for faster, more mobile and increasingly networked computers continuously fueled this growth.

This progressive development of the electronic end devices together with the also fast developing and spreading of the broadband Internet, both stationary and mobile, enable today that on these end devices ever more complex and often strongly networked applications are possible.

Today's very powerful hardware components make it possible for most electronic end devices to represent virtual environments that appear deceptively real to the user. These can be both 2D and 3D environments. These virtual environments are mostly deliberately geared towards users, among others. through high-resolution, realistic textures, very realistic modeling of virtual objects and characters and intuitive control to convey the impression that he or at least his character is part of this virtual environment.

The ever faster networking and more efficient network technology also make it possible for the user to experience the virtual environment together with many other users in real time. Which drastically increases the reality effect, since the characters perceived by the user of the other users often move and behave unpredictably and thus correspond to real human behavior in many ways.

Due to the constantly increasing complexity of the interactive virtual environments, as well as the numerous participating users, there is increasing network traffic between the users and the servers (in server-client network solutions), which provide the virtual environment, and possibly also between users (with peer-to-peer network solutions). In order to master this traffic, i.e. neither overload the server nor the end devices of the users, nor the data network, with regard to the available bandwidth, with too much traffic, the solution of the prior art, which is mostly used, looks like that multiple instances of the virtual environment (pluralities) are created in order to limit the number of users per instance who are in parallel in the virtual environment or at least parts thereof. This also limits the traffic that has to be exchanged between the participants of the respective instance and thus does not exceed the available bandwidth.

In the case of server-client network solutions, this is achieved in that each instance of the virtual environment with a defined maximum capacity for users runs on an extra server or at least one separate computing instance of a server (also referred to as a server in the following for simplification). Different instances of a virtual environment are basically completely separate virtual environments. The user of an instance may visually perceive the same virtual environment as a user of another instance, but he can only see and interact with the other users who are logged in via the same server as him and use the same instance. Users who use another instance of the virtual environment via another server cannot see or interact with them.

With peer-to-peer network solutions, on the other hand, this is achieved in such a way that each instance of the virtual environment with a defined maximum capacity for users is hosted via the respective end devices of the participating users. Depending on the definition, the end devices of the users take on coordinative tasks, similar to the server of a server-client network solution. In pure peer-to-peer network solutions, communication between the users' electronic devices takes place directly. In hybrid hybrid forms of server-client and peer-to-peer network solutions, depending on the definition, part of the communication takes place via the server and part directly between the users' end devices. The peer-to-peer network is therefore analogous to a server-client network separate instance of a virtual environment with the same consequence that users of one instance cannot see or interact with users of other instances.

However, the available bandwidth is not the only limitation as to why the participating users of an instance have to be limited in order to be technically feasible in a virtual environment. Latency also represents an important physical limit in network technology. Since both server-client and peer-to-peer network solutions, the data sent after a user action has to be waited for in some way.

Either all data of all users of the instance (or at least the actions of which the respective user will perceive in the next rendered frame) is waited for before the next image is rendered. This means that every user sees every action of all other users, however, the playback of the virtual environment is delayed or even perceived even at quite normal latencies of 40ms and more and the realistic experience is therefore no longer possible for the user.

Or techniques are used in which the actions of each user e.g. can be estimated using probabilities on the user's electronic end device. This allows them to be perceived smoothly despite increased latencies. However, if the late data on the actual actions of a user are not significantly congruent with the estimated ones, they have to be corrected subsequently (e.g. by the user correcting the user's position), which in turn means a loss of realistic perception. I.e. the shorter the latency of all users and the better the algorithm for estimating, the more realistic the perception of the virtual environment. According to the state of the art, acceptable latencies are mainly guaranteed by limiting the users per instance. As latencies fluctuate and mainly the longest latencies are significant, the likelihood of users with long latencies increases with each additional user in the instance.

But not only the network traffic per instance, but also the representation of many characters in one area within an instance of the virtual environment on the users' electronic end devices is a currently very limiting factor. This display fails on the one hand due to the immense computing load that many different characters trigger, since every movement of each individual character has to be calculated physically and graphically, and on the other hand due to the meaningful graphical representation.

A nesting of multiple instances, e.g. in defined sub-areas of the virtual environment is possible (see US 2016/0121212 AI). This can e.g. Instance A and instance B can be combined into one instance at least in the meantime, so that users of instances A and B perceive each other. Here, servers regulate whether certain sub-areas of the virtual environment are interconnected to form one instance for one or more instances. In this way, the number of users per instance can be actively regulated.

A possibility to limit the traffic between the users, as well as the computing load, however, therefore not to have to dodge to multiple instances (pluralities), but to be able to guarantee a single instance (singularity), is only possible through intelligent matching between users. This means that for each user there is a self-initiated or automatic selection from other users, which the user then perceives. However, he does not notice the other unselected users in his vicinity. Such matching methods are already state of the art (e.g. US20020090954 A1 , US5963951 A , US20060059142 A1 ), however, are currently mainly used for 2D applications based on user profiles, e.g. on dating sites. This is currently not the case in virtual environments, i.e. 3D applications. The reason for this is that up to now a user group individualized for each individual user has not been able to be represented graphically.

In contrast, the invention proposes a method with the features of claim 1, a computer program with the features of claim 12 and a terminal with a display device with the features of claim 13.

The present invention represents a solution as to how a computer-implemented method can filter virtual content and present it in a realistic and selective manner in such a way that an infinite number of users can use the same virtual instance.

For technical reasons, an efficient, lean traffic between the servers or other users and their electronic device and, on the other hand, resource-saving processing on the electronic device is desirable for the user of an interactive, virtual environment. This can only be achieved through efficient limitation and intelligent Achieve selection of the data sent to the user, which in turn means that the limitation of other users in the perceptible environment of the user represents a decisive factor in the technical feasibility of a virtual environment on an electronic terminal.

The present invention makes this possible without a strong external restriction due to the limitations imposed by a server, e.g. Area servers on which only a certain number of users can exist at the same time and usually every user sees each other, but not users of other area servers. Instead, it is possible with the present invention that any number of users perceive the same virtual environment realistically. Preferred is e.g. the user himself, to a significant extent, controls who and what exactly he wants to perceive in the virtual environment and who or what not. He can then e.g. Decide for yourself at any time which other users he or she does not want to perceive, and also change this at any time when he is in the virtual environment.

The present invention is generally independent of the network architecture. A virtual environment according to the invention can be implemented by means of server-client as well as peer-to-peer network solution as well as hybrid mixed forms. Pure peer-to-peer network solutions are generally possible, but due to data security there is always a server-client network solution or a hybrid of server-client and peer-to-peer, in which at least one server takes on at least targeted, coordinative tasks , to prefer. In the following we mainly talk about servers and clients. However, this always implies that the respective task could also be carried out via peer-to-peer or a hybrid hybrid.

Filter settings: For the exclusive display of the other users relevant to each user, a matching, i.e. a matching or reconciliation process take place. Regardless of whether the matching is initiated automatically (e.g. by the server) or manually (by the user), the basis for this matching is a data pool of user information that is compared with one another. This data preferably comes from filter settings that the user has selected himself. For this purpose, either the user, while he is logged into the virtual environment, by means of any input methods, preferably with the aid of a GUI, or the virtual environment itself, preferably at any time, which, however, can be limited in various ways by the virtual environment , based on predefined filter options, information about what or who is to be presented to the user in the virtual environment and / or what or who is not. Any filter results, actions, events, etc. can also be used to generate or change new filter settings.

The specified filter options can be as complex and extensive as you like. For example, you can refer to any interests, skills, characteristics, information, etc. from other users, both in real life and in the virtual environment. The filter options can be nested, hierarchically divided and dependent on one another and / or they can be based on any logic. E.g. certain values with filter setting A are only possible if filter setting B or filter setting C and D each have certain values.

The filter settings can be limited as desired. For example, certain filter settings or levels of filter settings can be defined in such a way that they can only be made at certain times or after certain time intervals or only in combination with any other filter settings, or are only enabled for certain users. The latter e.g. by the user activating the filter setting by performing one or more arbitrary tasks, or by the user belonging to a certain group, e.g. has a premium subscription, if applicable, or because the user has a certain property, e.g. a certain level or age.

The present description also covers a computer program with program code, which is suitable for carrying out a method according to the invention if the computer program runs on a computer or a suitable computing or control device. Both the computer program itself and stored on a computer-readable medium (computer program product) are claimed.

Further advantages and refinements of the invention emerge from the subclaims, the description and the accompanying drawing.

It goes without saying that the features mentioned above and those yet to be explained below can be used not only in the combination specified in each case, but also in other combinations or on their own without departing from the scope of the present invention.

• 1 zeigt ein beispielhaftes Filtereinstellungs-GUI
• 2 zeigt ein beispielhaftes Verfahren zur Validierung der Filtereinstellungen
• 3 zeigt eine beispielhafte Server-Client-Netzwerklösung zur Umsetzung des vorliegenden Verfahrens
• 4 zeigt einen beispielhaften Prozess, nach dem das Matching durchgeführt werden kann
• 5 zeigt beispielhafte Matching-Trigger
• 6 zeigt beispielhaft einen Teil und einen erweiterten Teil einer virtuellen Umgebung basierend auf vorliegendem Verfahren
• 7 zeigt beispielhaft das Routing von Informationen zwischen nach vorliegendem Verfahren entstandene Matches
• 8 zeigt beispielhaft mögliche technischen Probleme einer Singularität ohne Einsatz des vorliegenden Verfahrens
• 9 zeigt einen beispielhaften Ablauf des Ausblendens oder anderweitig aus der Wahrnehmung Entfernens

The invention is shown schematically in the drawing using exemplary embodiments and is described in detail below with reference to the drawing.

• 1 shows an exemplary filter setting GUI
• 2nd shows an exemplary procedure for validating the filter settings
• 3rd shows an exemplary server-client network solution for implementing the present method
• 4th shows an exemplary process according to which the matching can be carried out
• 5 shows exemplary matching triggers
• 6 shows an example of a part and an extended part of a virtual environment based on the present method
• 7 shows an example of the routing of information between matches created using the present method
• 8th shows an example of possible technical problems of a singularity without using the present method
• 9 shows an exemplary process of fading out or otherwise removing from the perception

1 shows an example of a filter setting GUI 100 using the example of social media software, ie an application for making contacts. This is shown in a very simplified manner for clear presentation and can be as complex as desired in terms of appearance and structure as well as scope, context and logic. Depending on the definition of the virtual environment, matches with other users occur either if one of the filter settings, a certain number of filter settings or all of the filter settings between the users match or match according to certain criteria. In the present example, a match is created for each of the filter settings that match between the users. The described logics and relationships of the filter settings are also only examples and can be varied as required. Because the user in the present example uses a dating filter 110 activated by ticking the "Dating" checkbox and decided that, for the purpose of dating, he was only interested in women aged 31 to 44 within a radius of 100 km around postcode 29374 in Germany, his filter settings will be here compared with the data of other users specified in the profile or anywhere else in the virtual environment.

Matches therefore occur with all users who are preferably logged in and whose details match the filter settings mentioned. Here the specifications of the virtual environment, e.g. allow you to search for both men and women at the same time by activating the corresponding checkboxes. Here, e.g. the specification of at least one gender and age may be mandatory, but not that of the country, postal code and area. So if the user is looking for According to men and women, but does not provide information on the country, postcode and area, matches are created for him with both men and women of the appropriate age, who either did not provide information about the country, postcode and area, or if they provided this information have only if the relevant information on the country, postcode and radius of the user meet their criteria.

Because the user in the present example uses a socializing filter 120 activated and, for example, wants to perceive friends without restriction as well as strangers with the restriction that they are interested in sports or music or animals, but has not specified these hobby categories, matches are created with their friends, provided that the setting is different Show friends have also activated, as well as with all strangers, who also selected matches from strangers and one of the three hobby categories, but did not specify the hobbies further. Here, for example, the activation of at least one of the two settings "Friends" and "Unknown" may be mandatory, but that of the hobby category, as well as the more precise specification of the hobbies may not. For example, if the user searches for unknowns but not for friends and does not provide any information on the hobby category and hobbies, there will be no matches with friends, but with all users with whom he is not friends and who also have no information on the hobby category and Have made hobbies. However, there is no match with the strangers who have given information on the hobby category and hobbies, since the user does not match their filter settings.

Because the user in the present example uses a shopping filter 130 has activated and, for example, no other buyers, i.e. users with an activated shopping filter, but sellers who sell the smartphone product in the electronics product category and can advise him accordingly, as well as only virtual objects in the "Products" category that belong to the " Electronics ”and correspond to a smartphone that wants to perceive in the virtual environment. Here, for example, the activation of all settings could be voluntary, but they become mandatory for the product category, if "Hide other products" is activated. For example, if the user is looking for electronics but not for other buyers or sellers, there will be no matches in the shopping filter, but he will then only perceive virtual objects of the "Products" category with the "Electronics" subcategory in the virtual environment.

The fact that the user in this example in a knowledge filter 140 Although he provided information on the "interest category" and specified it more precisely, but did not activate the knowledge filter, he does not have matches with other users who have selected at least one of the same interests in these interest categories, regardless of whether they have activated the knowledge filter or not.

The fact that the user in this example in the fun filter 150 Although he made information about the "game category" and specified it more precisely, as well as other users who want to play the same games and also want to perceive the selected games in the virtual environment highlighted but do not want to activate the fun filter, they arise no matches with other users who have selected at least one of the same games in these game categories, regardless of whether they have activated the fun filter or not. The user also does not perceive the games in the virtual environment due to the non-activated fun filter.

The information about the desired filter settings can be made using any available input method. E.g. using a keyboard, mouse, joystick, gamepad, touchscreen, gesture or speech recognition, etc.

In a preferred embodiment, the user can read out his current filter settings from the server. In a particularly preferred embodiment, the user can also read out a certain number of his old filter settings analogously. These are e.g. based on a history or a history or saved as favorites. In both cases, the user can adopt, modify and reuse them.

In a preferred embodiment, the user is made suggestions for his filter settings based on his or her preferred data stored on the server, or the analysis of his previous usage behavior, or other algorithms, which he can then adopt accordingly.

The user can confirm the filter settings based on a specific input using the input methods mentioned above, for example by pressing a button or clicking a button or using gesture or speech recognition.

The filter settings are preferably validated by the server before the so-called matching, i.e. the comparison of the filter settings of different users, that is, the compliance with all stored logics and rules is checked. 2nd shows an example of a procedure used. While the user inputs or changes the filter settings preferably using a GUI ( 210 ), pre-validation is already carried out in a preferred embodiment ( 220 ) on the user's electronic device or by sending the data in advance on the server. This enables the user to be given direct feedback on the validity and, if applicable, on existing problems and, if applicable, their causes. He can thus be supported in finding suitable, sensible and efficient filter settings. This feedback can be graphic, auditory or haptic, or a combination thereof.

In a particularly preferred embodiment, the pre-validation takes place on the electronic terminal device and incorrect settings for filter settings are not even permitted by the electronic terminal device. Finally, the user sends the filter settings to the server ( 230 ), regardless of whether a pre-validation has taken place, the filter settings are validated by the server ( 240 ) instead of, but possibly in a simplified form.

If the filter settings correspond to the specifications of the virtual environment, the matching ( 250 ) continue, otherwise the matching is refused and in a preferred embodiment the user is asked to correct the errors accordingly.

The specifications for logics, links, nesting, dependencies and limits of filter settings can be defined as desired for each virtual environment. E.g. In addition to the relationships between filter settings already shown as an example, there could be a limitation that only a certain number of filters may be active at the same time and / or that a certain number of filters must be active in order to bring the number of matches to a reasonable order limit.

After the confirmation, the data of the filter settings are sent to the server in a server-client network solution, which has preferably stored all relevant data of all users. With a peer-to-peer network solution however, it is either processed directly on the client's electronic device or, in the case of a hybrid hybrid, sent to the server responsible for it. In the event that further processing takes place on the electronic end device, all required data of the other users are requested either via peer-to-peer connection or from a server. Regardless of which of the two options is used, i.e. whether the data of the filter settings arrive on the server or on the electronic device, after the filter settings have been validated ( 240 ) and optional storage of the data on the respective device the matching ( 250 ) on the respective device.

3rd shows an example of a server-client network solution with which the present method can be implemented. The server 300 is an example of the generic term for the entirety of the servers required for hosting and the execution of the virtual environment and can consist of any number of servers and server components that communicate with one another and may be globally distributed. It communicates with different users or clients 310 ( 310A , ..., 310F ) to implement an interactive, virtual environment for all clients as host. The server can consist of a single stand-alone device or a global network of many data centers. In the present example, it consists of four different components, one for the matching (matching server 340 ), one for all social connections (social connection server 350 ), e.g. communication between the clients, one for routing (routing server 360 ), i.e. forwarding of network-relevant information between the clients, as well as one for the storage and provision of any relevant data (data server 370 ) responsible for. The server components can in turn consist of any number of their kind and possibly use the same hardware and software resources. So you don't have to represent physically separate components.

The matching server 340 processes all matching orders in this example, regardless of which trigger caused them, i.e. regardless of whether they came about by changing the filter settings, by logging in, logging out a client or, for example, by the death of a user's character. It therefore notifies the respective clients of any changes to their matching data, regardless of how they came about, with the updated matching data and thus ensures that every client is permanently updated 310 the current matching data is available at all times.

The social connection server 350 regulates all social connections between the clients in the present example, e.g. who is friends with whom, who is blacklisted with whom, etc. In addition, it establishes all connections required for communication between the clients and regulates the sending of messages.

The routing server 360 In the present example, it is responsible for forwarding the information of the network-related actions and events of each client to all other clients who have matches with him at the time, knowing all existing matches between the clients that are current at all times.

The data server 370 is responsible in the present example for all relevant messages sent by the clients to the server (cf. 5 at 561A ) or to store information created or changed by the server components at the appropriate place ( 564 ), preferably in any database, as well as the corresponding server components (at 565 ) or the clients (at 562A ) to provide requested data.

Depending on the requirements of the virtual environment, other servers can also be used 380 are required or used for any other conceivable services.

The individual servers and server components communicate with one another in any constellation in order to forward corresponding data and orders to the server component responsible for them or to request information from another server component. Which client is operated via which server component is assigned, preferably by a communication router 330 . It serves for efficient, targeted communication with the various clients. The communication router 330 is optional, however, because the connections between the clients and the server components can also be established directly.

A peer-to-peer connection is also optional 390 between users. Depending on the definition of the virtual environment, certain information can be exchanged directly between users without a detour via the server. Then it is a hybrid hybrid of a server-client and a peer-to-peer network solution. For example, the communication or the sending and processing of the location and movement information between the users could take place using peer-to-peer. The latter is possible in accordance with the present invention, since each electronic terminal always has the current information about who matches and who does not match by matching. This also gives the information to whom, for example Location changes and motion information must be sent.

Matching matches the filter settings made by the user or the virtual environment with the filter settings of certain other users sequentially (user for user) or in parallel (several or all users in parallel) or in any other way. 4th shows an exemplary process according to which the matching can be carried out.

A matching order can have different triggers 400 to be triggered. In 5 examples of matching triggers are shown. This can be a user or client who transmits new filter settings to the server 563A , either by changing his existing filter settings or by logging into the virtual environment and thus also transmitting filter settings for matching for the first time since his last logout. In both cases, the user's electronic end device is the matching trigger, i.e. the device that triggers the matching, possibly via the server.

Another example of a matching trigger is when a user comes into a new area of the virtual environment, i.e. several other users suddenly become relevant to him or when a user comes into the relevant radius or the relevant sphere of other users 563B . This can be done, for example, by various types of transportation (e.g. running, driving, flying, swimming, teleporting, etc.). Because in a position-based virtual environment, the routing server or another server knows, among other things, all movements and current position data of the user at all times and notices accordingly if a new user is in the relevant radius of another user or in a new area of the virtual Environment, it is the matching trigger in both cases.

Another example of a matching trigger is when a user teleports to another user he is friends with ( 563C ). Since this teleport is based on the social connection of both users, the social connection server is the matching trigger. Depending on the definition of the tasks of the server components, it could also be the routing server due to the change in position associated with the teleport.

Another example of a matching trigger is when the virtual environment or the server initiates matching for certain users based on defined criteria. E.g. if in a game after a given period of time (such as every two minutes) all users are re-matched according to random filter settings, or if e.g. Achieving a goal or completing a task is a trigger by definition (e.g. in a game application, defeating all matches could result in one or all users being re-matched).

Any other matching triggers can also be defined in the virtual environment, for example, if a user who was not previously taken into account in the matching comes to the preselection of another user in any way or the matching of a user would change in any way. This could e.g. through a friendship invitation, an advertisement, suggestions from the virtual environment, etc. Depending on which trigger triggers the matching, the process can vary slightly, but remains basically the same.

If a user logs out of the virtual environment, all of his matches, both for him and for all users with whom he has had matches, are deleted or deactivated. The matching data of him and all affected users on the server are updated, sent to all affected users and preferably saved. Has e.g. If user A matches user B and if user A logs out, user A's matches are completely deleted or deactivated. In the case of matches by user B, however, only the match with user A is deleted or deactivated. His other (active) matches remain unaffected.

Any other matching changing events and actions can also be defined. If the virtual environment is e.g. is a game, e.g. the death (i.e. the resignation) of a user or any other user actions or events are responsible for the fact that at least one match would become out of date and therefore an adjustment of the matches must be carried out.

Is in 4th verification of filter settings 405 successful through the server, prefers the so-called preselection 410 instead, which reduces the computing load of the matching as well as the network traffic. The preselection can be carried out according to any criteria and in any number of stages. For example, login status, interests, skills, traits, whereabouts, locations, levels, character race, achievements or other information or traits of users. The preselection preferably takes place on the basis of location information and the login status of the users in the virtual environment. This makes it possible, for example, that the matching takes place only with users who are in a certain one Radius or a certain spatial sphere to the executing user A. The sphere is preferably chosen to be so large that if another user B comes into this sphere and the matching results in a match between him and user A, the distance in virtuality between user A and user B is so great that the character of User B is created without User A seeing it. Preselection can also be used to exclude users with whom there is already a match, but for whom neither the filter settings nor the location has changed. Or the matching can only be carried out between two users from the start.

Regardless of whether a preselection has taken place, the filter settings are compared 420 between the user and all other preselected users, if any. Depending on the evaluation benchmark used for matching, a match is created between two users either if all filter settings or only parts of them match. For example, has user A in the filter setting 1 and filter setting 3rd the same and with filter setting 2nd Different settings such as user B for these respective filter settings, there is no match between the users according to the evaluation standard that all filter settings must match. On the other hand, according to the evaluation criterion that only at least one filter setting has to match, there are two matches between user A and user B, namely with filter setting 1 and filter setting 3rd . In another example, has user A with filter setting 1 and filter setting 2nd Different settings such as user B for these respective filter settings arise both according to the evaluation standard that all filter settings must match, and that only at least one filter setting must match, no match between the users.

For each compared other user with whom no match with the user was achieved, a check is carried out either before or after the comparison of the filter settings, but preferably afterwards, to determine whether one or more matches with the respective other user have already existed 425 . If this is the case, the matches of the two users will be adjusted accordingly 430 , the order to delete the other user is sent to the corresponding electronic device and the updated matches are preferably stored.

In a preferred embodiment, the information about each compared other user with whom at least one match has been achieved with the user is initially collected until the matching is completed and then prioritized according to the specifications of the virtual environment ( 435 ). It is then checked whether the number of users with matches meets the requirements of the virtual environment ( 440 ) and, if the number of users with matches (i.e. the number of characters to be displayed) exceeds the specified limit, as many users with matches with increasing priority will be deleted or deactivated in the matching data until the requirements are met ( 445 ). Again, before or after comparing the filter settings, but preferably afterwards, it must be checked whether one or more matches with the respective other user have already existed ( 450 ). If this is the case, it is also checked whether the previous matches correspond exactly to the new ones ( 455 ). If this is the case, nothing needs to be done because nothing has changed in the matches. However, if this is not the case, the matches of the two users will be adjusted accordingly ( 460 ) and the updated matches are preferably saved. If there were no matches with the other user before, the matches of the two users will be adjusted accordingly ( 465 ), and the order to create the other user is sent to the two electronic devices and the updated matches are preferably saved.

In any case, the result of the matching is data that provides information about which other users the requesting user has which match with. In addition, further data about the respective matched user are preferably also contained, which are required for further processing of the matching data on the electronic end device of the user.

In 6 is an example of a part 620 and an extended part 610 a virtual environment 600 shown. Here are exemplary matches from users 1 , as well as some users who are in close proximity to users 1 are shown. By matching in the example for users 1 (circled 1 matches with user due to filter matches 2nd , User 6 and users 11 result in what can be seen from the solid direct connecting lines. user 2nd has in addition to the described match with user 1 still matches with users 4th , User 5 and users 9 . user 1 takes only an area defined for him and thus relevant part of the virtual environment on his display device 620 true. This could also be a round or spherical shape with a radius around the first user 1 , to have. In contrast, other users perceive an area around their respective (centrally displayed) position in an analogous manner. Therefore, for example, user 5 with user 22 and users 218 two matches outside the relevant range by the first user 1 , in the example shown in the extended part of the virtual environment 610 . For users 13 If no match was made, he does not notice any other users in the example shown, even if they are like users 5 are in close proximity to him.

The dashed lines do not stand for matches, but for superordinate social connections. So for example is user 11 with user 203 and users 404 befriended, can make contact with them at any time, but does not perceive them directly due to the long distance. If, for example, users 1 changes his filter settings, his matches with the relevant users in his relevant area must be recalculated, which would change the connecting lines. He then no longer perceives all users who previously had a match with him but then no longer have one, and then perceives all users who previously had no match but then had one with him. He continues to notice all users who still have a match with him.

In a preferred embodiment, whole groups can be matched instead of a single user using an analog method. Has e.g. a group that wants to experience the virtual environment together, depending on the definition of the virtual environment, they can either agree on common filter settings, or the filter settings of the individual users who belong to the group can be combined (according to a predefined scheme). Depending on the definition of the virtual environment, groups can only be matched with other groups or with individual users. The matching process works in the same way as if individual users were matched with each other. However, the users belonging to the group are not matched with each other, but rather perceive each other due to the higher priority group membership.

An important basis for the selection of users is the prioritization of matches with other users. Prioritization takes place every time a user matches or changes a match, ensuring that every other user who has matches with the user has a certain priority at all times. For prioritization, the other users who have matches with the user are removed from the server or from the user's electronic terminal, depending on the definition of the virtual environment, e.g. Prioritized and preferred, this prioritization is stored on the server and / or the electronic terminal device according to the relevance that it could have for the user based on its filter settings, or according to any other specifications.

Priorities are assigned to a user's matches in order to prioritize them. This can e.g. happen in the form of priority characters, i.e. individual numbers or individual letters or individual other characters or sequences of numbers or sequences of letters or sequences of other characters or combinations thereof. For the prioritization algorithm, however, it must always be clear which priority sequence these characters or character strings have.

When assigning priorities when matching a user, priority characters are deliberately assigned that have a certain priority character spacing from their next priority matches. Then adjustments are made in the user's matches, e.g. If matches are added, the unused priority signs can be assigned without having to recalculate all priorities. E.g. The following priorities are assigned for the matches of user A when matching, based on the strength of the matches of his filter settings with his matches: user B = 1,000, user C = 2,000, user D = 3,000. If now e.g. If user E joins the part of the virtual environment relevant to user A and there is a match between user A and user E, user E becomes e.g. given a higher priority than user C compared to user C due to its greater agreement of the filter settings with those of user A, but a lower priority than user B due to its weaker agreement of the filter settings with those of user A compared to user B.

In order to be able to guarantee further such priority slots later, user E would then e.g. get the priority 1,500. Another additional user could then e.g. with priority 1,250, etc. If a priority slot is no longer possible due to many matches, new, preferably higher priority numbers can be assigned or the prioritization of the matches can be carried out from scratch.

In another embodiment, the user can prioritize his matches himself (under the framework of the virtual environment).

In a preferred embodiment, the matching data are stored in any form in any type of database on the server. Each user logged into the virtual environment stores his or her current matches in the database. these can either be deleted or deactivated when the user logs out or remain stored in any way beyond the time the user logs out.

After all matching data have been processed on the electronic end devices of the respective user, the virtual environment, or at least the part of it perceptible to the respective user, has the current status with regard to all other users relevant to the respective user. As soon as changes occur to the current matches of a user due to any defined actions or events in the virtual environment, or at least in the part of it that is perceptible to the respective user, that is to say they would become inactive, the user receives directly from the server or the respective other user the correspondingly adjusted matching data is sent, whereupon these are processed accordingly on the electronic terminal.

In order to prevent matching data from becoming up-to-date, every action that would lead to a change in the matching data is always followed by a corresponding adjustment or recalculation of the matching data of all relevant users. This ensures that all matching data in the virtual environment are up to date at all times.

In order to keep network traffic as low as possible, the results (in the form of data) of a matching process are sent to the electronic end devices of the users concerned in a highly efficient manner. This means that the data is only sent selectively to the users concerned. Accordingly, each user only receives the data relevant to them. On the example of 5 the matching results (in the form of data) from the client 310A initiated matches to all users affected by this matching, i.e. to himself 566A , as well as to the two clients 310B and 310D matches were created with ( 566B and 566C ). In the data sent, it becomes a client 310A informed that he had a match with client 310B and 310D Has. Client 310B is only informed that he is now a match with client 310A Has. And client 310D is only informed that he is now a match with client 310A Has. If client 310B and 310D however, if there is no match with each other, these two clients will learn nothing about their mutual existence.

In a preferred embodiment, information about a match between two users is only sent to exactly these two users and not to other users. All or some of the resources required to operate the virtual environment can be excluded. Sending the matching information to both users involved in a match ensures that both users definitely perceive each other in the virtual environment. The case that e.g. User A sees user B, but conversely user B does not see user A, is thus excluded.

The sent, adjusted matching data do not have to have the complete scope of all matches of a user, but can preferably only contain the actual changes of the matches to the latest status of the matching data on the electronic end device of the user. An example for the selective sending of the matching results including the preselection depending on the user radius would be the following: e.g. logs User A enters the virtual environment at a location in whose defined sphere there are among other users B, user C and user D, a matching takes place between user A and all other users located there. For example, one match each with user B and user D, user C, and possibly other users without a match, do not receive any information about user A, since no match was created with him. On the other hand, due to the matches that have occurred, the corresponding matching data is sent to the three other users, resulting in the following matching data:

• User A: User B, User D
• User B: User A and all previously existing matches
• User C: All previously existing matches
• User D: User A and all previous matches

In a preferred embodiment, certain algorithms are carried out at regular intervals in order to check whether all matching data are conclusive (validity check). If errors are discovered as a result, in a particularly preferred embodiment, these are corrected immediately by appropriate adjustments to the matching data.

In a preferred embodiment, the server carries out the matching or possibly a simplified version thereof in advance for one or more users, possibly in various combinations, partially or entirely, without sending data to the user or users (precautionary or preliminary Matching). This precautionary matching is based on previously collected information about the behavior and preferences of the user or users, which are used to predict as precisely as possible which filter settings the or could use the users for the next matching. As a result, the matching can already be fully or partially precalculated and, if the matching is actually carried out, computing time can be saved, as a result of which the user gets his matching result faster.

In a preferred embodiment, the user is made suggestions for filter settings at certain times or for certain events or actions, which he can use with a corresponding input confirmation. If he agrees to the new filter settings, there is a matching with all relevant users.

In a preferred embodiment, the virtual environment can temporarily or permanently restrict or completely suspend the user's right of determination via his filter settings, provided that this is provided in the definition of the virtual environment (matching authority of the virtual environment). In this case, at least one user or all users in a virtual environment have no or only limited rights to edit his or her filter settings. Instead, the virtual environment determines e.g. in the form of the server, according to predefined rules about the filter settings of the affected users in whole or in part, as well as about any changes to these filter settings in whole or in part. In this case, the virtual environment controls, in whole or in part, which user perceives which other users and which do not. Depending on the definition, this executes the virtual environment only at certain times or permanently.

E.g. the virtual environment could completely independently regulate between which users matches occur. Or every user is e.g. given a certain limit on filter adjustments; If these are used up, the virtual environment may regulate further filter adjustments or do not allow new ones for a certain time. Or the filter settings are e.g. randomly assigned by the virtual environment at certain times, which regularly creates new, random matches. Or the virtual environment limits or minimizes e.g. the number of matches independently to ensure that each user can only have a maximum number of matches at a time.

The data, which is partially or completely collected or sent individually or at different times to the affected users of the matching, contain at least information about the user ID and / or the user name or any other type of identification for each affected user in order to provide a clear, unambiguous one To ensure identification of every user on every device in the complete network of the virtual environment. The server assigns this unique identification to each user, preferably each time the user logs in.

Regardless of which trigger and how a new matching came about and how it came to the affected users, this matching data must then be processed on the users' electronic devices. It does not matter whether the matching data from all matches is partially or completely collected or sent individually or at different times to the electronic end device of the respective user. On the basis of the received user ID or the user name or another identification, each user contained in the matching data, the electronic terminal virtually creates the respective new user, whereby it is initially present informally on the respective electronic terminal of the respective other user .

Set new user to position: The virtual environment is based on position data (virtual coordinates) of the user. Each user can thus be assigned at least one position in the virtual environment at any time. Therefore, the respective user who is informally present on the electronic terminal is assigned its respective initial position. This information must be available on the respective device performing the matching, that is to say the server or the electronic terminal device, and must be made available accordingly.

Create character appearance: The characters of the users are graphically displayed on the users' electronic devices. For the graphic creation of a character, information about the character appearance is sent to the user's electronic end device. Based on this character appearance data, the respective user who is informally present on the electronic terminal device is given its respective appearance. It is modeled by the electronic device on the basis of the matching data relevant to the character appearance and from then on graphically displayed.

On the basis of all existing matches of all users, the routing server regulates which information is network-relevant for which other users, and thus which information has to be sent to which other users at what time of a user, so that each user has exactly the relevant information at all times Completely perceives part of the virtual environment on its electronic device to a defined extent. The relevant part of the virtual environment corresponds to this the area of the virtual environment perceived by the user at the time. The resulting network-relevant information includes, depending on the definition of the virtual environment, information from all other users relevant to the user, i.e. his matches, all of his relevant matches, i.e. the currently perceived, executed actions, all relevant, his relevant matches relevant events, as well as all relevant virtual objects, media, information, etc.

Which information is relevant for which network users depends on the definition of the virtual environment and can therefore vary. E.g. Under certain circumstances, a client may also need information about other clients with whom it does not have a match. In this case, this information can also be provided and sent. Regular promotions, such as Movements by a user are also sent at regular, defined intervals. In addition to validating and checking the data sent by each user, the server also serves as a type of router to which which data is forwarded.

In 7 is an example of how information can be routed between matches. In this example the case is considered if client 310A one match each with client 310B and 310D Has. All other clients have their own individual matches and receive information about their respective matches according to the same scheme, but these are not considered here.

Runs client 310A a network-relevant action 761A from the client 310A to the server 300 sent and there preferably by a communication router 330 to the responsible routing server 360 forwarded. The routing server either has the information with whom the client 310A has a match directly in front of it or is located somewhere else, preferably the data server 370 , in front and the routing server can accordingly by data request / provision 564 and 565 access to it or he receives it from the client additionally or together with the information of the network-relevant action.

Regardless of where the routing server gets the information about client matches from 310A , he himself or another server component processes this information accordingly if necessary and checks or validates this information himself or another server component accordingly if necessary before sending the possibly prepared information to the client's matches 310A , so client 310B and client 310D sends. All other clients that do not match the client 310A do not get this information. However, leads client 310B a network-relevant action, the corresponding information is sent analogously to the client 310A as well as the other matches, the client 310B with other clients. The same applies to clients 310D . Because in the example between client 310B and 310D If there is no match, these two clients do not receive any network-relevant information from one another.

Depending on the definition of the virtual environment, the routing server is therefore responsible for deciding which information is network-relevant for which user, as well as forwarding and, if necessary, processing and validating the relevant network-related information, with parts of these tasks also partially or can be completely taken over by other server components or edited in cooperation with them. Depending on the definition of the virtual environment, however, parts of these responsibilities can also be shifted to the electronic end device of the clients or one or more defined hosts. In this way, network-relevant information is completely or partially not via server-client but via peer-to-peer solution 380 distributed. Since every client has information at all times about which other clients are in matches, it is also possible, for example, that certain actions are sent permanently or temporarily, such as the movement of a user, directly to the relevant matches of the clients via peer-to-peer become.

Routing example: exist e.g. for user A at the point in time considered matches with user B, user D, user H, user M and user X and sends user A's electronic terminal e.g. Data on the movement just completed by user A to the server, the server forwards them, after successful validation and verification of the data, to the electronic end devices of user B, user D, user H, user M and user X. With a peer-to-peer network, this data can also be sent directly to the relevant users.

Regardless of how the information was sent to the corresponding electronic devices, all users now see the user A, ie have matches with him, also the actions defined by him in the virtual environment. Conversely, e.g. If user X has matches with user A, user C, user H and user Y at the point in time considered, his data is sent to user A, user C, user H and user Y analogously after optional validation and verification. This limits network traffic to the data relevant to each user.

The data sent from the server to the clients is reduced to the currently relevant for the respective client. A client A is therefore only sent the relevant data of the other clients with whom matches exist and whose characters are at a certain distance from the character of client A. The relevant data is preferably even reduced to only the data of other clients with whom matches exist and whose characters are currently visible to client A or would become visible through a simple action, for example by the character of client A rotating or otherwise moving.

If another user becomes irrelevant to the user for any reason after defining the virtual environment, e.g. by logging out of the virtual environment or being in another area of the virtual environment that is not relevant to the user or dying in a game or one of the two users changing their filter settings, etc., a corresponding message is sent to the two users , whereupon the other user on the user's electronic device is deleted or deactivated accordingly.

In a preferred embodiment, the filter settings of the respective users are processed or used in some way in the virtual environment in addition to the calculation of which user perceives which other users. Therefore, the filter setting data of the respective users are needed in the matching data in this embodiment. These are initially assigned to the respective user informally on the users present on the electronic terminal and processed accordingly by the electronic terminal.

In a particularly preferred embodiment, a user's matches with another user can be displayed graphically or in text form. Various possibilities are conceivable for this. E.g. the matches can be displayed graphically or in text form above the head of the other user, or the matches of individual or of all users are shown to the user graphically or in text form, or the matches of individual or all users become the user displayed graphically in a radar. Mixed forms are also possible.

Further processing of the filter settings: In a preferred embodiment, the user can be provided with a tailored offer of contents of the virtual environment based on his filter settings. Using the filter settings of the user, the server can use an algorithm to determine or at least estimate which offers in the virtual environment could be of interest to the user. The user can e.g. Proposals, tips, advertising, the teleport to a specific location, the acquisition of virtual or real objects (eCommerce) etc. tailored to his current interests and needs are submitted in text, graphic or video form.

In a particularly preferred embodiment, the server can create a history on the basis of stored, old filter settings of a user, which can serve for an even more precise estimation of what the user is interested in at the moment or could be interested in in the future.

Summary UserFilter: This ensures that every user is fully aware of the relevant part of the virtual environment at any time in its current form and that they have neither too little nor too much information, but that they receive exactly the information that their electronic device needed to display the virtual environment as it was defined either by the user himself or by the virtual environment or by mixed forms of user and virtual environment.

Since the virtual environment is based on virtual coordinates and users are represented graphically on the electronic end devices and possibly a digital rigid body (realistic simulation of physical properties of a spatially extended virtual completely or partially rigid object, e.g. with regard to inertia, gravity, impact behavior, etc.) or have an analogue as a basis, but due to the matching, not everyone sees each other or exists, but only their respective matches, either a hardware-technical visualization problem or a software-technical logic problem in combination with a network problem occurs if there is more than one User is in the same virtual place. Depending on the number of users in the same virtual location, this can even lead to the hardware of the electronic terminal being overloaded and possibly no longer working, or the software being slowed down or crashing.

In 8th these problems are shown schematically. Because, in the present invention, not every user perceives every other user, but only the users relevant to them, it can happen that several users who do not perceive each other are in the same position.

At 810 such a situation is outlined in an exemplary and very simplified manner. user 2nd and users 9 have no match with each other and therefore do not notice each other. Ie user 2nd is on the user's electronic device 9 not available, so user receives 9 also no information about users 2nd . Conversely, the same applies. This allows users 2nd , as indicated in the image by the movement arrow without realizing it, be in the same or almost the same virtual position as the user 9 . Another user then takes, here by user 1 shown, these two users are true in the same position, since he has matches with both, this can lead to the problems mentioned. Both users 2nd as well as users 9 are on the user's electronic device 1 displayed. Since he perceives both, the characters of users can differ in his perception 2nd and users 9 hinder or overlap each other on his electronic device through coordinate collisions. However, the three users considered in this example then do this exclusively on the user's electronic terminal 1 . On users' electronic devices 2nd and users 9 However, there is no coordinate collision, since the other user does not exist on their electronic devices. In this example, the coordinate collision occurs exclusively in the perception of the user 1 and without users 2nd and users 9 know some of it because it is irrelevant to their perception.

The characters in the virtual environment have no digital rigid bodies 820 or the like, which collide with one another elastically or inelastically in a collision, then overlap or overlap the characters of users 2nd and users 9 or their corresponding graphics from the user's perspective 1 completely or partially. In this case, user takes 1 the other two users are true in their correct positions, but the overlapping of the characters leads to difficult cover calculation by the hardware, which can lead to known problems such as “Z-fighting” or graphic artifacts and flickering. It is also a user 1 then possibly no longer possible to distinguish between the two characters. These effects increase the more the other users of the user 1 perceives due to matches that do not perceive each other due to missing matches.

Such a situation is with 850 shown. Here the case may arise that the hardware of the electronic end device is used by the user 1 is overwhelmed. However, if the characters have rigid bodies or the like as a base (see at 830 ), so a character cannot be partly or completely in another character due to the elastic or inelastic impact occurring when the two rigid bodies touch, there is no or at least no significant overlap. Ie when users 2nd moved back to the position that approximates the position of user 9 corresponds, in his perception he can of course do so easily, since users 9 is not available on his electronic device. But since both users 2nd as well as users 9 on the user's electronic device 1 are present, the user moves 2nd in the perception of users 1 only up to the position in which the rigid body of the user 2nd and users 9 touch and remains there, as if on an obstacle (illustrated by the user icon with a solid line). The true position of user 2nd , that is, the user 2nd in his own perception (illustrated by the user symbol with a dashed line), he has in the perception of users 1 by rigid body repulsion by user 9 not ingested, but slightly missed.

This means that in this case a user is perceived at a position where he is not, but at a distance next to it which corresponds to the rigid body interaction. This leads to various problems. On the one hand, the software logic is disturbed because the same user can be in a different position on some electronic devices than on others. On the other hand, the server continuously sends the position data of this user to the electronic end device of the other user, which then also continuously tries to move the user to his actual position, but this does not work due to the rigid body interaction with other users. This creates unnecessary network traffic and heavy hardware / software loads.

This effect increases with the number of users in the same position. In a lot of users, many characters would be perceived in a significantly different position (see at 860 ) (illustrated by the user icon with a solid line) than they actually are ( 870 ) (illustrated by the user symbol with a dashed line). The hardware and software load can then become so strong that the electronic device crashes.

However, there is an additional problem here, because then different users would be represented on the electronic terminals by different other users in different positions, since each user sees an individualized selection of other users. In this example, the positions would be the users 6 , 8th , 12th , 14 , 16 , 18th , 20th on the user's electronic device 3rd (see at 880 ) other than the same users on the user's electronic terminal 1 (The same applies to that of users 5 perceived other user (see 890 )). That is influenced by many factors. For one, has users 1 other matches than user 3rd , which means that the matches influence each other differently, i.e. push through their rigid bodies into other positions. On the other hand, innumerable dynamic effects also play a role. Which match joined the virtual environment when and was matched with whom? Which match performed which movement and when and thus influenced which other user? Possibly. could also eg the real position of user 16 be far away since he has already moved a lot in his perception, but in the perception of users 1 between the rigid bodies of the users 2nd , 12th , 20th , 18th , 14 and 10th is trapped and therefore cannot perceive it.

In order to solve these problems, that is to say in the perception of each user at any time to represent every other user perceptible to him in his exact position and to prevent overlaps, according to the invention, so many of those other users to be displayed or represented who are on the same or one are in a similar position, completely or partially hidden or otherwise completely or partially removed from the user's perception that only one of these other users remains in the same position or so many users remain in similar positions so that there is no overlap.

The fading out or otherwise removing from the perception can take place in various ways. E.g. the respective character can disappear completely from the user's point of view, by slowly or quickly fading out ("fade-out"). Or the character is partially transparent or shown in the background, but is still partially perceptible to the user (ghost display).

Hiding or otherwise removing them from perception can either result in the character being deleted from the user's matches or replaced by another user, i.e. permanent, but it preferably remains in the user's matches and is only temporarily hidden until it no longer overlaps with another match of the user and can also be shown again in various ways. In this case, the user continues to be provided with information about this character over the network. So his electronic device knows immediately when he is no longer in the same position as another match of the user.

The decision as to which other users located in the same position are hidden and which individual other user also located in this position remains depends on the definition of the criteria of the virtual environment of the server or the electronic end device of the user. In the first case, appropriate communication between the user's electronic terminal and the server takes place before the masking or before it is otherwise removed from the user's perception, before the user's electronic terminal receives instructions as to which other users are to be masked out. In a particularly preferred embodiment, the fading out or otherwise removing from the user's perception takes place on the basis of the existing prioritization of the matches. On the basis of the prioritizations, the user's electronic terminal can hide or otherwise remove all characters, apart from the user or users with the highest priority, who are in the same or a similar position.

In 9 the process of fading out or otherwise removing from perception is described as an example. As already described above, matching (or trigger events) are used to match ( 910 ) with subsequent prioritization ( 920 ) instead of. If, for example, user A enters the virtual environment or part of it, a matching takes place with all other users located in a defined area. The result of the matching, that is to say all the matches which have arisen, preferably prioritized, is sent to user A in the form of data on his electronic terminal. If, for example, user B now joins the virtual environment, a matching takes place between user A and user B. If a match arises, user B is prioritized in user A's existing priority list. Due to this constant process, according to which a matching takes place with subsequent prioritization for each defined trigger, the matching list ( 930 ) each user at any time up-to-date and individually tailored to the respective user and preferably prioritized. It is irrelevant whether the matching takes place on the server or the electronic device.

On this basis, the hide or otherwise remove from the user's perception can be triggered either by a particular trigger or manually. As a trigger ( 940 ) acts, for example, falling below a Minimum distance between at least two other users perceived by the exemplary user A or the penetration of a user / character into a contour zone of another displayed character. The minimum distance could be chosen, for example, so that the characters cannot overlap. This distance can be a radius or any shape and does not have to be symmetrical. For example, the rigid body or any non-rigid body can be used which triggers the trigger as soon as it is cut or touched by another analog body or virtual object.

It is also conceivable that user A e.g. a controller can control how large the distance should be, that the fade-out or otherwise remove from the perception is activated. This allows him to control how large a user he wants to be, if he chooses a small distance he perceives many users in one area, if he chooses a large distance, he perceives few users in one area, but if prioritized, always for him most relevant.

Controlling this distance by the virtual environment is also conceivable, since it can, for example, automatically influence the performance of the electronic end device. If this trigger has triggered, for example because three users have fallen below the minimum distance from each other, it can optionally first be checked whether the matches concerned have mutual matches with each other ( 950 ). If this is the case, if the virtual environment is based on characters with rigid bodies, it can be assumed that the users cannot overlap because they perceive each other. Accordingly, these users may not have to hide or otherwise remove them from their perception.

Regardless of whether this optional check has taken place, the priorities of the affected users on the matching list of user A are now compared ( 960 ). All users with lower priority than the highest priority user are hidden or otherwise removed from the perception of user A, so that only the highest priority user is completely left in the perception.

Many users overlap in one area at the same time, which could mainly happen when a user joins a new area, since overlaps otherwise occur due to dynamic movements that are unlikely to happen all at the same time, in principle, different methods can be used. The users with direct overlaps with the highest priority match in this area are then preferably first hidden or otherwise removed from the perception. From the remaining users, those with direct overlaps with the second highest priority match are then either hidden or otherwise removed from the perception, and so on.

Also remove the manual activation of the masking or otherwise from the perception ( 945 ) is conceivable if, for example, user A selects an area in which he would like to have all low-priority matches hidden or otherwise removed from perception. Hiding or otherwise removing them from the perception preferably does not result in a match being deleted from user A's matching list, but rather represents only a temporary state in which a user can no longer be perceived in favor of a higher-priority match.

However, user A preferably has control over who is or remains hidden and who is not. After hiding or otherwise removing it from the perception, the user is preferably shown which other users are currently hiding behind the most highly prioritized user who is left behind. This can e.g. be in the form of a list in which the prioritization can preferably be changed manually, that is to say that the previously highest priority can be hidden or otherwise removed from the perception and a previously lower priority can be shown instead. How the fading out or otherwise removing from the perception is represented can be varied as desired.

Examples of this are: a continuously increasing hiding, the closer the affected users get, or hiding the parts of the characters that would overlap, or only partially hiding that the character can still be recognized in silhouettes, for example, or discoloration of the character, or any other transformation, e.g. the change from 3D to 2D or that the lower-priority user becomes smaller and smaller as he approaches the higher-priority one, etc. Then the reciprocal trigger ( 970 ) triggered, e.g. by the fact that the minimum distance between the users concerned is exceeded again, or this is triggered manually in the same way, for example by the selection of an area, is shown or otherwise brought back into perception ( 980 ) instead of. In principle, this is reciprocal to hide or otherwise remove from perception, but can be represented in a different way to hide. The affected users will then be visible again as soon as they no longer overlap a higher-priority user.

All steps 910 - 980 can be initiated and executed both by a server and by the respective electronic device. However, preference is given to matching ( 910 ) and prioritizing ( 920 ) on a server and the electronic end devices only receive the relevant final results. On the basis of this existing information, the respective electronic terminal device then preferably carries out the respective action after the trigger has been triggered ( 960 respectively. 980 ) yourself. Monitoring the triggers ( 940 respectively. 970 ) can be monitored both by the server and by the electronic device.

Reduction of matches: In a preferred embodiment, the user has an input or combination of inputs, a voice or gesture command, or the like. the possibility to reduce the content relevant to him and thus usually to increase the speed and thus possibly the quality of the perception of his virtual environment. After this function has been selected by the user, a specific, defined number or a specific, defined percentage of the matches and thus their characters are deleted or deactivated on the basis of the prioritization of the matches of the user. The lowest prioritized matches are first deleted or deactivated according to increasing priority. Depending on the definition of the criteria of the virtual environment, exceptions can be made. E.g. matches that are friends with the user can be exempt from this deletion or inactivation, and or or matches that are friends get a higher prioritization already when the matches are prioritized.

This reduction function means that the user's electronic end device has to display fewer characters and therefore receives less network traffic. Both conserve the hardware resources of the electronic device. Take user A for example 500 Matches true, but notices that by displaying these many matches, the overall presentation and usability of the virtual environment is slow or restricted, he can start his matches by starting the function mentioned, for example by 50%, i.e. up 250 Reduce matches. If this does not improve the performance enough, he can call up the matches again, for example by a further 50% 125 Matches, decrease.

Summary Singularity: Due to the present invention, only users perceive themselves in a virtual environment, between whom a match was achieved based on certain matches of their filter settings, without the software / hardware and network problems being matched individually for each user comes because several users are in the same position. This method makes it technically possible for the first time that no parallel instances of a virtual environment have to exist in order to be able to process and display a virtual environment on the users' electronic end devices despite large numbers of users.

The virtual environments according to the invention are therefore preferably always singularities, in which, without exception, each user perceives the same virtual environment in terms of position, size and shape of all virtual objects that make up the virtual environment, with the exception of the users themselves virtual object always has a precisely defined position or unique address. Representation and perception parameters such as textures of the virtual objects, incidence of light, light reflection and refraction on virtual objects, noises, music, weather, time of day, night time and much more. can, on the other hand, vary without impairing the perception of other users on the users' electronic end devices. E.g. one user might perceive the same virtual environment at night, while another user might perceive it in daylight.

Address search engine: Because each virtual object, including the user, always has a precisely defined position or unique address in the virtual environment, that is, it only ever exists once, in a preferred embodiment it is possible for the user to use an Search engine and various search criteria to find certain defined, virtual objects. These different search criteria can e.g. Names of virtual objects, names of object owners, names of people or characters associated with the virtual object, position data, keywords related to virtual objects, descriptions of virtual objects, names of other virtual objects located in or on the virtual objects, keywords to other virtual objects located in or on the virtual objects, descriptions of other virtual objects located in or on the virtual objects. Random hits created by the search engine are also conceivable. The search engine shows the user after entering a search query via keyboard, mouse, joystick, gamepad, tablet, smartphone, speech or gesture recognition, etc. at least all search results found on the basis of the exact wording so that the user can select one of these results and / or add them to his favorites list.

In a very particularly preferred embodiment, the search engine also displays search results with a similar wording or meaning as the search term itself. In a In a very preferred embodiment, further information is displayed in the search results for the respective result, that is to say the respective object. Eg descriptions, reviews of other users, associated logos or images, the virtual object position, the name of the part of the virtual environment in which this virtual object is located, which friendly users are currently there, etc.

Teleport to the search result: In a preferred embodiment, the user in the virtual environment is able to teleport to the virtual coordinates of the virtual object either from the search results or from the list of favorites using a teleport function by selecting a virtual object. I.e. the user instantly changes from his previous position in the virtual environment to the defined position of the selected virtual object. The defined position of the virtual object can be close to or at a specific point in the virtual object, but is predefined for each virtual object and cannot be changed by the user.

QUOTES INCLUDE IN THE DESCRIPTION

This list of documents listed by the applicant has been generated automatically and is only included for the better information of the reader. The list is not part of the German patent or utility model application. The DPMA assumes no liability for any errors or omissions.

Patent literature cited

• US 20020090954 A1 [0015]
• US 5963951 A [0015]
• US 20060059142 A1 [0015]

Claims (14)

Computer-implemented method for filtering personal parameters when displaying virtual characters in an interactive virtual online environment on a first terminal with a display device of a first user, each virtual character being assigned to a user of the online environment, with the following steps: Identifying (410) the characters to be basically displayed on the first display device of the first user, for example by means of a matching method, Assigning degrees of prioritization (435) to each character to be represented in principle, - determining the coordinates of the characters to be displayed in the virtual online environment, - comparison of the determined coordinates and identification of possible coordinate collisions, - display of all characters to be displayed without coordinate collision, - For characters with coordinate collision, selecting the character with a higher degree of prioritization and displaying this character on the display device. Procedure according to Claim 1 , in which the step of identifying the characters to be depicted is carried out on the basis of filter settings, the filter settings being specified by the first user and / or automatically, and / or the step of identifying being triggered automatically, continuously or by the occurrence of a framework condition. Procedure according to Claim 1 or 2nd , in which only characters with a higher level of prioritization are displayed and characters with a lower level of prioritization are completely or partially hidden. Procedure according to one of the Claims 1 to 3rd , in which a contour zone or a minimum distance of the characters is taken into account in the step of identifying coordinate collisions. Procedure according to one of the Claims 1 to 4th , in which the step of identifying coordinate collisions is carried out continuously or by a predetermined triggering event or triggered manually, in order to hide the character with a lower degree of prioritization in the case of a moving or new character in the event of a coordinate collision. Procedure according to one of the Claims 1 to 5 , in which, after the step of identifying (410) the characters to be displayed in principle, it is checked whether the number of characters to be shown in principle corresponds to the requirements of the virtual online environment, and if necessary starting with the lowest level of prioritization, all characters that exceed a specified display limit are hidden or not be displayed. Procedure according to one of the Claims 1 to 6 , in which results of the matching process or prioritization are stored on the first terminal and / or in the results of the matching process or prioritization are only communicated to the users assigned to the characters concerned. Procedure according to one of the Claims 1 to 7 , in which the non-displayed or hidden characters with subordinate matching or prioritization results are displayed to the first user and the first user can preferably make a change in the display by manual prioritization change. Procedure according to one of the Claims 1 to 8th , in which a search tool for finding virtual objects or characters based on search criteria such as names of virtual objects, names of object owners, names of people or characters associated with the virtual object, position data, keywords in connection with virtual objects, descriptions for virtual objects, names for other virtual objects located in or on the virtual objects, keywords for other virtual objects located in or on the virtual objects, descriptions of other virtual objects located in or on the virtual objects. Procedure according to one of the Claims 1 to 9 , in which the first user can change his position to a position adjacent to the selected virtual object by selecting a virtual object. Procedure according to one of the Claims 1 to 10th , in which a routing server (360) is used to determine which information out of the total number of all matches between all users is network-relevant for which other users and which of these information is to be sent to a user involved at which point in time. Computer program with program code means for all steps of a method according to one of the Claims 1 to 11 to be carried out when the computer program is executed on a computer, a (mobile) terminal or a corresponding computing unit. Terminal (310) with a first display device of a first user for displaying virtual characters in an interactive virtual online environment, in which a large number of users are integrated via their clients (310A, 310B, ..., 310F), which is set up for this purpose , a method according to one of the Claims 1 to 11 to execute. Terminal after Claim 13 whose interactive virtual online environment is a server-client network arrangement, a peer-to-peer network arrangement or a hybrid mixed form thereof.

Images