Method and apparatus for displaying object identifiers, device and medium

Abstract

Provided are a method and apparatus for displaying object identifiers, a device and a medium. The method comprises: determining a plurality of objects corresponding to a target event, the plurality of objects comprising a first set of objects of a first type and a second set of objects of a second type; on the basis of the number of the plurality of objects, determining in a predetermined region a plurality of candidate regions for presenting object identifiers of the plurality of objects, a target candidate region among the plurality of candidate regions being used for presenting a target object identifier of a target object among the plurality of objects; and presenting the plurality of object identifiers of the plurality of objects on the basis of the plurality of candidate regions, a first set of object identifiers of the first set of objects being presented using a first display mode, and a second set of object identifiers of the second set of objects being presented using a second display mode. In this way, according to the number of objects participating in an event, the present application can determine modes for presenting object identifiers, so as to distinguish objects of different types more clearly.

Description

Method, apparatus, device and medium for displaying object identification

[0001] The present application claims priority to the Chinese patent application No. 202410433875.4, filed on April 10, 2024, entitled “Method, apparatus, device and medium for displaying object identification”, the whole content of which is incorporated herein by reference. TECHNICAL FIELD

[0002] Exemplary implementations of the present disclosure generally relate to object management, and in particular, to a method, apparatus, device and computer readable storage medium for displaying object identification in an interactive application. BACKGROUND

[0003] With the development of computer technology and network technology, a variety of interactive applications have been developed. In a multi-user interactive application, multiple users can participate in an event such as a singing competition, a debate competition, etc. in the interactive application. For example, in a singing competition, group A and group B can each include one or more users, and at this time, the identification of each user in group A and group B can be presented in the interactive application respectively. However, the number of groups and the number of users in each group can vary. Therefore, it is desirable to present the identification of the users in each group in a more flexible and effective manner. SUMMARY

[0004] In a first aspect of the present disclosure, a method for displaying object identification is provided. In the method, a plurality of objects corresponding to a target event is determined, the plurality of objects including a first group of objects having a first type and a second group of objects having a second type. Based on the number of objects of the plurality of objects, a plurality of candidate regions for presenting object identification of the plurality of objects in a predetermined region is determined, a target candidate region in the plurality of candidate regions being used for presenting target object identification of a target object in the plurality of objects. The plurality of object identifications of the plurality of objects is presented based on the plurality of candidate regions, wherein the first group of object identifications of the first group of objects is presented by using a first display manner, and the second group of object identifications of the second group of objects is presented by using a second display manner.

[0005] In a second aspect of the disclosure, an apparatus for displaying object identifications is provided. The apparatus includes: an object determining module configured to determine a plurality of objects corresponding to a target event, the plurality of objects including a first group of objects having a first type and a second group of objects having a second type; an area determining module configured to determine, based on a number of objects of the plurality of objects, a plurality of candidate areas in a predetermined area for presenting object identifications of the plurality of objects, a target candidate area of the plurality of candidate areas being for presenting a target object identification of a target object of the plurality of objects; and a presenting module configured to present the plurality of object identifications of the plurality of objects based on the plurality of candidate areas, wherein the first group of object identifications of the first group of objects are presented with a first display manner, and the second group of object identifications of the second group of objects are presented with a second display manner.

[0006] In a third aspect of the disclosure, an electronic device is provided. The electronic device includes: at least one processing unit; and at least one memory coupled to the at least one processing unit and storing instructions for execution by the at least one processing unit, the instructions when executed by the at least one processing unit cause the electronic device to perform the method according to the first aspect of the disclosure.

[0007] In a fourth aspect of the disclosure, a computer-readable storage medium is provided, having stored thereon a computer program which, when executed by a processor, causes the processor to implement the method according to the first aspect of the disclosure.

[0008] In a fifth aspect of the disclosure, a computer program product is provided, tangibly stored in a computer storage medium and comprising computer-executable instructions that, when executed by a device, cause the device to perform the method according to the first aspect of the disclosure.

[0009] It is to be understood that the particulars shown herein are by way of example and for purposes of illustrative discussion of the present implementations of the present disclosure only and are presented in the cause of providing what is believed to be the most useful and readily understood description of the principles and conceptual aspects of various implementations of the present disclosure. In this regard, no requirement exists for the details of construction, arrangement or combination of the described components to be limiting since other implementations having different details are also within the scope of the present disclosure. BRIEF DESCRIPTION OF DRAWINGS

[0010] In the following detailed description, reference will be made to the accompanying drawings, of which:

[0011] FIG. 1 shows a block diagram of an application environment according to one example implementation of the present disclosure;

[0012] FIG. 2 shows a block diagram for displaying object identifications according to some implementations of the present disclosure;

[0013] FIG. 3 illustrates a block diagram of a candidate region, according to some implementations of the present disclosure;

[0014] FIG. 4 illustrates a block diagram of a profile position of a first set of object identifications, according to some implementations of the present disclosure;

[0015] FIG. 5 illustrates a block diagram of an object identification, according to some implementations of the present disclosure;

[0016] FIG. 6 illustrates a block diagram of a process for processing one boundary, according to some implementations of the present disclosure;

[0017] FIGS. 7A and 7B respectively illustrate a block diagram of a gap between a first boundary and a second boundary, according to some implementations of the present disclosure;

[0018] FIG. 7C illustrates a block diagram of a connecting line between a first boundary and a second boundary, according to some implementations of the present disclosure;

[0019] FIG. 8 illustrates a block diagram of a page of an interactive application, according to some implementations of the present disclosure;

[0020] FIG. 9 illustrates a block diagram of a page of an interactive application, according to some implementations of the present disclosure;

[0021] FIG. 10 illustrates a flowchart of a method for displaying object identifications, according to some implementations of the present disclosure;

[0022] FIG. 11 illustrates a block diagram of an apparatus for displaying object identifications, according to some implementations of the present disclosure; and

[0023] FIG. 12 illustrates a block diagram of a device capable of implementing a number of implementations of the present disclosure. DETAILED DESCRIPTION

[0024] Implementations of the present disclosure will be described below in detail with reference to the accompanying drawings. While certain implementations of the present disclosure are shown in the drawings, it should be understood that the present disclosure can be implemented in various forms and should not be construed as being limited to the implementations set forth herein, but should be construed to cover all modifications, equivalents, and alternatives falling within the spirit and scope of the present disclosure. It should be understood that the drawings and implementations of the present disclosure are only for illustrative purposes and should not be construed as limiting the scope of protection of the present disclosure.

[0025] In the description of the implementations of the present disclosure, the term "comprising" and its similar terms are understood to be open-ended, i.e., "including but not limited to". The term "based on" is understood to mean "based, at least in part, on". The term "one implementation" or "an implementation" is understood to mean "at least one implementation". The term "some implementations" is understood to mean "at least some implementations". Other explicit or implicit definitions can also be included below. As used herein, the term "model" can represent the association relationship between various data. For example, the above association relationship can be obtained based on various technical solutions that are currently known and / or will be developed in the future.

[0026] It can be understood that the data involved in the technical solutions of the present disclosure (including but not limited to the data itself, the acquisition or use of the data) should comply with the requirements of the corresponding laws and regulations and relevant provisions.

[0027] It can be understood that, before using the technical solutions disclosed by the embodiments of the present disclosure, the type of personal information involved in the present disclosure, the use range, the use scenario, etc. should be informed to the user and the authorization of the user should be obtained through appropriate means according to relevant laws and regulations.

[0028] For example, in response to receiving the active request of the user, prompt information is sent to the user to explicitly prompt the user that the operation requested to be performed will require the acquisition and use of personal information of the user. Thus, the user can voluntarily choose whether to provide personal information to the software or hardware such as electronic devices, application programs, servers or storage media that perform the operation of the technical solutions of the present disclosure according to the prompt information.

[0029] As an optional but non-limiting implementation, in response to receiving the active request of the user, the way of sending prompt information to the user may, for example, be a pop-up window manner, and the prompt information can be presented in the form of text in the pop-up window. In addition, the pop-up window can also carry selection controls for the user to select "agree" or "disagree" to provide personal information to the electronic device.

[0030] It can be understood that the above notification and user authorization process is only illustrative and does not limit the implementations of the present disclosure, and other ways that meet the relevant laws and regulations can also be applied to the implementations of the present disclosure.

[0031] The term "in response to" used herein indicates the state that the corresponding event occurs or the condition is met. It will be understood that the execution time of the subsequent action performed in response to the event or condition is not necessarily strongly associated with the time when the event occurs or the condition is established. For example, in some cases, the subsequent action can be performed immediately when the event occurs or the condition is established; while in other cases, the subsequent action can be performed after a period of time after the event occurs or the condition is established.

[0032] Example Environment

[0033] In a multi-user interactive application, multiple users can participate in an event, such as a singing competition, a debate competition, etc., in the interactive application. Referring to FIG. 1, an application environment is described according to one example implementation of the present disclosure, which shows a block diagram 100 of an application environment according to one example implementation of the present disclosure. As shown in FIG. 1, an interactive application 110 can be, for example, an application capable of providing audio and / or video live streaming functions. For example, the interactive application 110 can provide a live confrontation event, such as a singing competition event, and users can join Group A or Group B to participate in the competition. In the context of the present disclosure, a specific application environment of displaying object identities will be described taking the singing competition as an example. Here, an object can represent a user in the interactive application 110, and an object identity can represent an identity of the user, such as a name of the user, an avatar, or a real-time video participating in the event, etc.

[0034] To facilitate the differentiation of users in Group A and Group B, the user identities in Group A and Group B can be presented in different display manners (e.g., different colors) in a page of the interactive application. For example, each user in Group A can be represented in red in a left region, and each user in Group B can be represented in blue in a right region. However, users can quit the competition, or new users can participate in the competition, which causes the number of users in each group to change constantly. Alternatively and / or additionally, another group (e.g., Group C) can participate in the competition. However, the regions for representing each group are fixed (e.g., the Group A region on the left and the Group B region on the right each accommodate a maximum of 4 users), which severely limits the number of groups participating in the event and the number of users in each group.

[0035] For example, when more users desire to join Group A or Group B, or new users desire to form another Group C to participate in the singing competition, the status of each group cannot be presented in the interactive application. Thus, it is desirable to present the identities of users in each group in a more flexible and efficient manner.

[0036] Summary of Displaying Object Identities

[0037] To at least partially address the deficiencies in the prior art, according to one example implementation of the present disclosure, a method for displaying object identities is proposed. Referring to FIG. 2, a summary is described according to one example implementation of the present disclosure, which shows a block diagram 200 for displaying object identities according to some implementations of the present disclosure. As shown in FIG. 2, a plurality of objects 230 corresponding to a target event can be determined. Here, the plurality of objects can have different types, for example, the plurality of objects can include a first group of objects 210 having a first type and a second group of objects 220 having a second type.

[0038] In the following, only a singing competition is taken as a specific example of a target event, alternatively and / or additionally, the event can be a debate competition, or other talent competition, etc. Here the objects can be users in the interactive application, and the type of object can be a group that the user belongs to, e.g. group A or group B, etc. A plurality of candidate regions for presenting object identities of a plurality of objects in a predetermined region can be determined based on an object number 232. Here the object number 232 represents a number of all users participating in the event, and the predetermined region can be a region with a predetermined position and size in a page of the interactive application.

[0039] Here a target candidate region in the plurality of candidate regions is for presenting a target object identity of a target object in the plurality of objects. Assuming that the object number is represented as N, the number of the plurality of candidate regions can be greater than or equal to the object number N. In this way, the object identity of each object can be presented in one candidate region. The number of candidate regions can be determined based on a plurality of ways, and the predetermined region can be divided in a way of a rectangular grid.

[0040] For example, the predetermined region can be divided into W*H candidate regions, where W represents a number of columns in a width direction, and H represents a number of rows in a height direction. Specifically, the specific values of W and H can be determined based on a ratio of the width and height of the predetermined region 240; alternatively and / or additionally, the number of rows and columns can have the same value. As shown in FIG. 2, the predetermined region 240 can be divided into 9 candidate regions (e.g. candidate regions #1 to #9) represented in a rectangular manner. For example, the candidate region 250 can represent the first candidate region. Alternatively and / or additionally, the rows and columns of candidate regions can have different values.

[0041] After the plurality of candidate regions have been determined, the plurality of object identities of the plurality of objects can be presented based on the plurality of candidate regions. For example, the first group of object identities of the first group of objects can be presented with a first display manner, and the second group of object identities of the second group of objects can be presented with a second display manner. As shown in FIG. 2, the first group of objects (i.e. users of group A are displayed in candidate regions #2, #3, #5, #9) can be represented in red, and the second group of objects (i.e. users of group B are displayed in candidate regions #1, #4, #6, #7, #8) can be represented in blue. Alternatively and / or additionally, a boundary between group A and group B can be divided with a dashed line, thereby distinguishing the two groups in a more explicit manner.

[0042] With the example implementation of the present disclosure, without setting an upper limit on the number of different types of objects participating in the event, or without setting an upper limit on the number of objects of each type, the manner of presenting the object identifiers can be determined in a more flexible manner in real time according to the number of objects participating in the event. In this manner, the object identifiers can be presented in a manner that is more conducive to distinguishing different types of objects according to the number of types of objects participating in the event, and the number of objects of each type.

[0043] Detailed process of displaying object identifiers

[0044] Having described an example implementation according to the present disclosure, more details regarding displaying object identifiers will be described below. According to an example implementation of the present disclosure, the shape of the candidate region can include a rectangle, a square, a hexagon, a triangle, a circle, etc. In this manner, richer visual information can be presented in the interactive application. For ease of description, the specific presentation process will be described below only with a rectangle as an example.

[0045] According to an example implementation of the present disclosure, the candidate regions can be determined based on the total number of objects. For example, a predetermined region can be divided into W*H candidate regions, where W*H≥N, i.e., the number of candidate regions should be higher than the number of objects. In this manner, it can be ensured that the predetermined region 240 includes sufficient candidate regions, and each object identifier can be presented in one candidate region.

[0046] The correspondence between the object identifiers of the plurality of objects and the plurality of candidate regions can be determined based on a variety of manners. For a target object in the plurality of objects, the presentation position of the identifier of the target object can be determined based on the time when the target object participates in the event. As shown in FIG. 2, the object identifiers can be presented in candidate regions #1 to #9 in a time order from early to late. In the environment of a live application, the candidate regions can represent a “mic position”, i.e., the microphone position of the user participating in the event.

[0047] Here, the object identifier can include at least any of the following, for example: the ID, name, avatar, or video of the user, etc. The object identifiers of different types of objects can be presented in different display manners. For example, for a user in group A, a red semi-transparent layer can be displayed on top of the ID, name, avatar, video, etc. of the user; for a user in group B, a blue semi-transparent layer can be displayed on top. In this manner, the users in different groups can be explicitly distinguished by using different display manners.

[0048] According to one example implementation of the present disclosure, the identification of each user can be updated in real time based on the latest data of the users currently participating in the event. The number of users participating in the event can change, for example, a user at candidate position #7 can quit the event, at which time a different display manner (e.g., black, etc.) can be utilized to represent the idle candidate region. For another example, a new user can join the event, at which time the identification of the new user can be presented in the idle candidate region in the predetermined region. Assuming that the new user joins another new group (group C), at which time the identification of the new user can be presented at candidate position #7, and a different display manner can be utilized to distinguish the user. For example, a semi-transparent layer of yellow color can be superimposed on top of the identification of the new user. In this way, more types of users can be presented without changing the layout of the predetermined region.

[0049] According to one example implementation of the present disclosure, the presentation position of a target object can be determined based on a distance between the target candidate region and another candidate region in the plurality of candidate regions that has another target object of the same type as the target object. In a case where the predetermined region includes a plurality of idle candidate regions, the type of the object at the adjacent candidate region adjacent to the idle candidate region in the predetermined region can be determined, and then one idle candidate region is selected from the plurality of idle candidate regions. Specifically, it is expected that the type at the adjacent candidate region of the selected idle candidate region is the same as the type of the new user. For example, if there is one or more idle regions around the A group users, one idle region can be selected to present the user identification of another user in the A group. In this way, the new user can form a larger connected region with other users in the same group, so that each user in the same group can be presented in a more concentrated manner.

[0050] According to one example implementation of the present disclosure, the presentation position of a target object can be determined based on a distance between the target candidate region and another candidate region in the plurality of candidate regions that has another target object of a different type as the target object. For example, an idle candidate region far away from the users in the B group can be selected as much as possible to present the user identification of the users in the A group. In this way, the distance of the users in different groups can be pulled away, so that the users in different groups can be separated in a more obvious manner.

[0051] Specifically, in the presence of W*H candidate regions, the top-left candidate region #1 can be selected for the first user of the A group, and the free candidate regions can be selected for the other users of the A group in a diffused manner around the candidate region #1. Similarly, the bottom-right candidate region #(W*H) can be selected for the first user of the B group, and the candidate regions can be selected for the other users of the B group in a diffused manner around the candidate region #(W*H). When a new group (e.g., the C group) appears, a free candidate region near the top-right or bottom-left corner can be selected for the first user of the C group, and so on.

[0052] According to one example implementation of the present disclosure, the plurality of candidate regions can be determined again when the change of the object quantity of the plurality of objects satisfies a predetermined condition. For example, if the object quantity increases and exceeds the number of candidate regions, the number of candidate regions can be increased and the plurality of candidate regions can be determined again. For example, the number of candidate regions can be changed from the current 3*3 to 3*4 or 4*4 so as to accommodate more users.

[0053] For another example, if a user exits the game and causes the object quantity to decrease and a large number of free regions to be generated in the predetermined region, the number of candidate regions can be decreased and the plurality of candidate regions can be determined again. Assuming that there are currently only 2 users participating in the event, the number of candidate regions can be changed from the current 3*3 to 3*2 or 2*3, and so on. In this way, the number and layout of candidate regions can be adjusted in time with the change of the number of users participating in the event, and thus the users in different groups can be distinguished in a more explicit and concise manner.

[0054] According to one example implementation of the present disclosure, at the boundary position between each user in different groups, a separation line can be presented in a different display manner (e.g., referred to as a third display manner). As shown in FIG. 2, the boundary between the A group and the B group can be represented by a dashed line so as to distinguish the users in different groups in a more prominent visual effect. Specifically, each boundary of the object identifiers of each object in a group of objects can be traversed. In the case of a rectangular candidate region, each object identifier is represented in a rectangular manner, and at this time, the boundary (e.g., referred to as a first boundary) of the candidate region can correspond to at least any one of the following in the rectangular region: an upper side boundary, a lower side boundary, a left side boundary, and a right side boundary.

[0055] FIG. 3 illustrates a block diagram 300 of a candidate region, according to some implementations of the present disclosure. As shown in FIG. 3, a candidate region 310 can be represented by four vertices P0, P1, P2, and P3 of a rectangular region. According to one example implementation of the present disclosure, the coordinates of each vertex can include a horizontal coordinate and a vertical coordinate, and various programming languages can be utilized to construct data structures to store the relevant information of a candidate region. For example, a data structure of a candidate region can be defined by the four vertices of a rectangle. To facilitate computation, a line segment can also be defined by two vertices at the two ends of the line segment. Further, the specific direction of a line segment (e.g., horizontal and / or vertical) can not be perceived, and only one vertex coordinate can be utilized to represent a vertex (i.e., the other coordinate of the horizontal and / or vertical direction is ignored).

[0056] According to one example implementation of the present disclosure, a set of contour boundaries associated with the first set of object identifiers can be determined. Specifically, for a certain object identifier in the first set of object identifiers (e.g., referred to as a first object identifier), if it is determined that a first boundary of the first object identifier is located at a contour position of the first set of object identifiers, the first boundary is added to the set of contour boundaries. After each boundary has been processed, the set of contour boundaries will include all boundaries that are located at contour positions. Further, each boundary in the set of contour boundaries can be presented by the third display mode. In this way, the process of determining the dividing line between different types of object identifiers can be converted to a simple comparison process, thereby improving processing efficiency.

[0057] According to one example implementation of the present disclosure, any set of object identifiers can be traversed, and boundaries located at contour positions are sought. Alternatively and / or additionally, based on the number of each type of object, it can be determined at which type of object identifier the dividing line is presented at a contour position. For example, the type corresponding to a smaller number of objects can be selected, and in the example above where Group A includes 4 users and Group B includes 5 users, the contours of the object identifiers in Group A can be presented by the third display mode. In this way, the amount of computation involved in the traversal process can be reduced, thereby improving processing efficiency.

[0058] According to one example implementation of the present disclosure, the third display mode can be associated with the first display mode. For example, the contour line of the object identifiers in Group A can be highlighted by red color with higher brightness. In this way, the color of the contour line of Group A matches the color of the object identifiers in Group A (e.g., dark red color with lower brightness), and thus the boundary between different types of objects can be distinguished in a more visually harmonious manner.

[0059] According to one example implementation of the present disclosure, the contour position can involve a plurality of cases: an adjacent boundary between different types of object identifications, or a boundary of a predetermined region. Specifically, if it is determined that the first boundary corresponds to an adjacent boundary between a first object identification and a second object identification of a second object in the second group of object identifications, it can be determined that the first boundary is located at the contour position.

[0060] For ease of calculation, the boundaries of the object identifications can be represented by line segments between four vertices of the candidate region. For example, the candidate region 310 can be filled in order to present an object identification, and four boundaries of the object identification can be represented as P0P1, P1P2, P2P3, P0P3, respectively. Each boundary of each object identification can be represented in a similar manner, and further, whether a certain boundary is an adjacent boundary between two different types of object identifications can be determined by comparing the boundaries.

[0061] More details are described with reference to FIG. 4, which shows a block diagram 400 of contour positions of the first group of object identifications according to some implementations of the present disclosure. As shown in FIG. 4, each object identification of each object in the group A can be traversed. The left boundary of the object identification at the candidate region #2 is processed first. By comparison, it is known that the object identification at the candidate region #1 belongs to the group B, and the object identification at the candidate region #2 belongs to the group A. At this time, the boundary 411 is an adjacent boundary between two different types of object identifications, and thus the boundary 411 is located at the contour position of the object identification of the group A. Other boundaries (e.g., the upper boundary, the right boundary, and the lower boundary) of the object identification at the candidate region #2 can be processed in a similar manner. With the example implementation of the present disclosure, the adjacent boundary between different types of object identifications can be determined by simple boundary comparison, so as to improve processing efficiency.

[0062] Alternatively and / or additionally, if it is determined that the first boundary is located at a boundary of a predetermined region, it can be determined that the first boundary is located at the contour position. As shown in FIG. 4, by comparison, it is known that the upper boundary 410 of the object identification at the candidate region #2 is located at a boundary of a predetermined region, and thus the boundary 410 can be added to the contour boundary set. Each boundary of each object identification in the group A can be processed one by one in a similar manner, so as to add all boundaries located at the contour position to the contour boundary set. At this time, the contour boundary set can include the boundaries 411, 410, 412, 413, 414, 415, 416, 417, 420, 421, 422, 423.

[0063] It should be appreciated that the above merely illustrates one specific example, alternatively and / or additionally, a portion inside the candidate region can be filled in order to present the object identification. More details are described with reference to FIG. 5, which illustrates a block diagram 500 of object identification according to some implementations of the present disclosure. As shown in FIG. 5, the vertices Q0, Q1, Q2, Q3 of the object identification 510 can be located inside the candidate region 310, for example, indented by one or more pixels towards the center of the candidate region 310. In this way, there will be gaps between the presented individual object identifications, which can avoid the situation that the boundaries of the object identifications are displayed overlapped, thereby providing better visual effects.

[0064] At this time, when determining whether a certain boundary is located at a contour position, the indented distance should be considered. Specifically, for the upper side boundary of an object identification, the condition that satisfies the lower side boundary of the object identification parallelly adjacent thereto is that the y value of the upper side line segment of the object identification is equal to the y value of the lower side of the other object identification + diff. Wherein diff is the interval between the bins. The lower side boundary, the left side boundary and the right side boundary of the object identification can be processed in a similar manner.

[0065] According to one example implementation of the present disclosure, in order to simplify the judgment logic, for all parallel line segments, the specific direction of the line segment can not be perceived, only the values of the start point and the end point are retained, thereby achieving simplified processing. For example, for a horizontal line segment with a start coordinate of (5, 10) and an end coordinate of (5, 20), the simplified data structure {10, 20} can be used to represent the boundary, at this time it is not necessary to record the horizontal coordinate it is located in. According to one example implementation of the present disclosure, a conversion function can be written to simplify the data structure of each boundary of the object identification, thereby improving the efficiency of subsequent processing.

[0066] According to one example implementation of the present disclosure, the bins adjacent to the boundary of the target bin (the upper side / left side / lower side / right side boundary of the bin) can be screened (i.e., corresponding to the lower side / right side / upper side / left side boundary of the other bin). Specifically, if the difference between the upper side boundary of one bin and the lower side boundary of another bin satisfies diff, then the two bins are adjacent. Similarly, if the difference between the left side boundary of one bin and the right side boundary of another bin satisfies diff, then the two bins are adjacent, and so on. In this way, the contours of different types of object identifications can be determined in a simpler and more effective manner.

[0067] FIG. 6 illustrates a block diagram 600 of a process for processing one boundary according to some implementations of the present disclosure. As shown in FIG. 6, at block 610, an array of line segments of a target type (also referred to as a first array) can be input. At block 611, the line segments in the first array can be sorted according to the position relationship of the start points of the line segments. At block 612, an empty array of line segments (also referred to as a second array) can be created. At block 613, a first temporary variable can be defined with a value of the start point of the first line segment. Further, a second temporary variable can be defined with a value of the start point of the first line segment. At block 614, a third temporary variable i can be defined and set to 0 for traversing each line segment in the first array.

[0068] At block 615, the third temporary variable can be compared with the length of the first array. If the third temporary variable is less than the length (i.e., the result of the determination is YES), the process proceeds to block 630; otherwise, the process proceeds to block 616 (i.e., the result of the determination is NO). At block 630, the third temporary variable can be increased by 1 for processing the next line segment in the first array. At block 631, the line segment at position i in the first array can be obtained, which can be denoted as a second line segment. At block 632, a relationship between the end point of the second line segment and the first temporary variable can be determined. If the end point of the second line segment is less than or equal to the first temporary variable (i.e., the result of the determination at block 632 is YES), the process proceeds to block 615, where the processing of the line segment b is completed. Otherwise, if the result of the determination at block 632 is NO, the process proceeds to block 633 to determine whether a distance between the end point of the second line segment and the line segment at position i-1 (i.e., the previous line segment in the second array) is a predetermined distance (e.g., denoted as diff).

[0069] If the result of the determination at block 633 is YES, the process proceeds to block 634 to shift the start point of the second line segment forward by the predetermined distance. If the result of the determination at block 633 is NO, the process proceeds to block 635 to determine whether the value of the first temporary variable is less than the end point of the second line segment. If the result of the determination at block 635 is YES, the process proceeds to block 636 to set the value of the second temporary variable to the end point of the second line segment. At block 637, the value of the second temporary variable can be modified. If the result of the determination at block 635 is NO, the process directly proceeds to block 637.

[0070] At block 638, it can be determined whether the value of the second temporary variable is less than the end point of the first line segment. If the determination at block 638 is "yes", the process proceeds to block 620; otherwise, the process proceeds to block 639 to set the second temporary variable to the start point of the first line segment. Further, at block 620, it can be determined whether the first temporary variable is less than the second temporary variable. If the determination at block 620 is "yes", the process proceeds to block 621; otherwise, the process proceeds to block 624. At block 621, a third line segment is created with the start point being the first temporary variable and the end point being the second temporary variable. At block 622, the third line segment is stored in a line segment array (e.g., a third array). At block 623, the first temporary variable is set to the end point of the second line segment and the second temporary variable is set to the end point of the second line segment.

[0071] Further, at block 624, it can be determined whether the first temporary variable is greater than the end point of the first line segment. If the determination is "yes", the process proceeds to block 616; otherwise, the process proceeds to block 615. At block 616, the first temporary variable can be compared to the end point of the first line segment. If the comparison is "less than", the process proceeds to block 617. At block 617, a fourth line segment can be created with the start point being equal to the first temporary variable and the end point being equal to the end point of the second line segment. At block 618, the fourth line segment is stored in the third array. At block 619, the third array includes line segments that lie within the contour region that need to be drawn. Further, the third array can be output. At this point, the third array includes all the boundaries to be drawn.

[0072] According to one example implementation of the present disclosure, each boundary in the set of contour boundaries can be determined in the manner described above. For example, after each boundary of the object identification in the A group has been traversed, each boundary in the set of contour boundaries can be drawn one by one. It should be appreciated that when the object identification is represented in a nested manner, the end points of the determined boundaries can not be continuous and thus a connecting line can need to be added at the discontinuous portion.

[0073] As the object-identified regions are smaller than the predetermined regions, there can be a gap between the boundaries of two adjacent object-identified regions. See FIGS. 7A and 7B for more details, which show a block diagram 700A of a gap between a first boundary and a second boundary, according to some implementations of the present disclosure. As shown in FIG. 7A, assume that boundary 710 and boundary 712 are two boundaries of two horizontally adjacent object-identified regions, there can be a gap 714 between the end point E1 of boundary 710 and the boundary E2 of boundary 720. For another example, FIG. 7B shows a block diagram 700B of a gap between a first boundary and a second boundary, according to some implementations of the present disclosure. As shown in FIG. 7B, assume that boundary 720 and boundary 722 are two boundaries of two vertically adjacent object-identified regions, there can be a gap 724 between the end point E4 of boundary 720 and the boundary E3 of boundary 722.

[0074] It should be appreciated that FIGS. 7A and 7B are merely illustrative, and there can be gaps located at other positions. According to one example implementation of the present disclosure, the gap between the boundaries can be detected, and a connecting line can be added at the gap. Specifically, if it is determined that the distance between the first end point of the first boundary and the second end point of the second boundary satisfies a predetermined condition, a connecting line can be presented between the first boundary and the second boundary using a third display mode. Here, the predetermined condition can represent, for example, that the distance between the first end point and the second end point is equal to diff (as shown in FIG. 7A). Alternatively and / or additionally, the predetermined condition can represent that the distance between the first end point and the second end point is equal to diff multiplied by a predetermined number (as shown in FIG. 7B). In this way, the gap to be filled can be determined by simple mathematical operations.

[0075] According to one example implementation of the present disclosure, in presenting the connecting line, if it is determined that the first direction of the first boundary is consistent with the second direction of the second boundary, a straight line segment connecting the first boundary and the second boundary can be used as the connecting line. As shown in FIG. 7A, the line segment can be filled at the gap 714 between points E1 and E2, so as to make the boundaries 710 and 712 present a continuous visual effect.

[0076] According to one example implementation of the present disclosure, in presenting the connecting line, if it is determined that the first direction of the first boundary is perpendicular to the second direction of the second boundary, an arc line segment connecting the first boundary and the second boundary can be used as the connecting line. See FIG. 7C for more details, which shows a block diagram 700C of a connecting line between a first boundary and a second boundary, according to some implementations of the present disclosure.

[0077] ​As shown in FIG. 7C, assuming that the vertical boundary is located at the left side of the horizontal boundary, there can be eight position relationships between the two boundaries perpendicular to each other, denoted as position relationships 730, 731, 732, 733, 734, 735, 736 and 737 respectively. At this time, a connecting line represented by an arc segment (e.g., 1 / 4 of a circle) can be drawn between the two boundaries perpendicular to each other. For example, the drawing process can be implemented by using the following process. It should be understood that the position relationships in FIG. 7C and the following drawing process are merely illustrative, and the vertical boundary can be located at the right side of the horizontal boundary, and the corresponding process can be performed based on similar principles described above.

[0078] Referring to FIG. 7C, as shown in position relationship 730, a 1 / 4 circle arc is drawn at the upper left, or no circle arc is drawn; as shown in position relationship 731, a 1 / 4 circle arc is drawn at the upper left; as shown in position relationship 732, a 1 / 4 circle arc is drawn at the upper left; as shown in position relationship 733, a 1 / 4 circle arc is drawn at the lower left; as shown in position relationship 734, a 1 / 4 circle arc is drawn at the lower left, or no circle arc is drawn; as shown in position relationship 735, a 1 / 4 circle arc is drawn at the lower left; as shown in position relationship 736, a 1 / 4 circle arc is drawn at the lower left; and as shown in position relationship 737, a 1 / 4 circle arc is drawn at the upper left.

[0079] According to one example implementation of the present disclosure, there can be an intersection point between the target boundary and the arc segment in the first boundary and the second boundary, at this time, the part corresponding to the intersection point needs to be removed from the target boundary. Referring to position relationship 731 in FIG. 7C, the intersection point of the arc segment and the horizontal boundary is R1, at this time, the part 740 left to the intersection point R1 can be removed from the horizontal boundary.

[0080] As shown in position relationship 732, the intersection point of the arc segment and the vertical boundary is R2, at this time, the part 742 above the intersection point R2 can be removed from the vertical boundary. As shown in position relationship 733, the intersection point of the arc segment and the horizontal boundary is R3, at this time, the part 744 left to the intersection point R3 can be removed from the vertical boundary. As shown in position relationship 735, the intersection point of the arc segment and the vertical boundary is R4, at this time, the part 746 below the intersection point R4 can be removed from the vertical boundary. In other words, the redundant part on the same side of the intersection point of the arc segment can be removed from the target boundary. By using the example implementation of the present disclosure, a more smooth contour line can be presented, thereby providing a better visual effect.

[0081] It should be appreciated that the above merely illustrates the process of determining the contour line in an example manner. The position of the contour line can be adjusted based on the principles described above. For example, the position of the contour line can be expanded outwardly by a distance of diff / 2 so as to present the contour line at a position in the middle between two adjacent object identifications. In this way, the boundary between different types of object identifications can be presented in a more obvious manner, facilitating the differentiation of different types of objects. FIG. 8 illustrates a block diagram 800 of a page of an interactive application according to some implementations of the present disclosure. As shown in FIG. 8, the multiple users of Group A are divided into two areas, a contour line 810 can surround the microphone positions #2, #3 and #5, and a contour line 820 can surround the microphone position #9.

[0082] According to one example implementation of the present disclosure, the predetermined area in an interactive application can have different positions and / or shapes, and the shape and layout of the candidate area in different interactive applications can be different. FIG. 9 illustrates a block diagram 900 of a page of an interactive application according to some implementations of the present disclosure. As shown in FIG. 9, in the interactive application 910, the predetermined area 912 can be a square area, and multiple microphone positions can be presented in the predetermined area 912 in a square grid manner. In the interactive application 920, the predetermined area 922 can be a rectangular area, and multiple microphone positions can be presented in the predetermined area 922 in a rectangular sequence manner. In the interactive application 930, the predetermined area 932 can be a hexagonal area, and multiple microphone positions can be presented in the predetermined area 932 in a hexagonal grid manner, and so on.

[0083] According to one example implementation of the present disclosure, the method is implemented in a live application, the target event is a live confrontation event (e.g., a singing competition) in the live application, and the object identification is the identification of a user participating in the live confrontation event. In this way, different types of users participating in the competition event can be clearly distinguished, and different groups of songs can be distinguished in a more explicit manner.

[0084] With the example implementations of the present disclosure, the manner of presenting each object identification can be determined in a more flexible manner according to the number of objects participating in the event in real time. In this way, the object identifications can be presented in a manner that is more conducive to distinguishing different types of objects according to the number of types of objects participating in the event and the number of each type of object.

[0085] Example process

[0086] FIG. 10 shows a flowchart of a method 1000 for displaying object identifiers, according to some implementations of the present disclosure. At block 1010, a plurality of objects corresponding to a target event is determined, the plurality of objects including a first group of objects having a first type and a second group of objects having a second type. A plurality of candidate regions for presenting object identifiers of the plurality of objects in a predetermined region is determined based on a number of objects of the plurality of objects, a target candidate region of the plurality of candidate regions being for presenting a target object identifier of a target object of the plurality of objects. A plurality of object identifiers of the plurality of objects is presented based on the plurality of candidate regions, wherein a first group of object identifiers of the first group of objects is presented with a first display manner, and a second group of object identifiers of the second group of objects is presented with a second display manner.

[0087] According to one example implementation of the present disclosure, the method further includes determining a set of contour boundaries associated with the first group of object identifiers, and presenting at least one boundary of the set of contour boundaries with a third display manner.

[0088] According to one example implementation of the present disclosure, determining the set of contour boundaries associated with the first group of object identifiers includes, for a first object identifier of the first group of object identifiers, adding a first boundary of the first object identifier to the set of contour boundaries in response to determining that the first boundary is located at a contour position of the first object identifier.

[0089] According to one example implementation of the present disclosure, determining that the first boundary of the first object identifier is located at the contour position includes determining that the first boundary is located at the contour position in response to at least one of: the first boundary corresponding to an adjacent boundary between the first object identifier and a second object identifier of a second object of the second group of objects; and the first boundary being located at a boundary of the predetermined region.

[0090] According to one example implementation of the present disclosure, the plurality of candidate regions are rectangular regions, and the first boundary corresponds to at least one of: an upper side boundary, a lower side boundary, a left side boundary, and a right side boundary of the rectangular regions.

[0091] According to one example implementation of the present disclosure, the set of contour boundaries further includes a second boundary, and presenting at least one boundary of the set of contour boundaries includes, in response to determining that a distance between a first end point of the first boundary and a second end point of the second boundary satisfies a predetermined condition, presenting a connection line between the first boundary and the second boundary with the third display manner.

[0092] According to one example implementation of the present disclosure, presenting the connection line includes, in response to determining that a first direction of the first boundary is consistent with a second direction of the second boundary, presenting a straight line segment connecting the first boundary and the second boundary as the connection line.

[0093] According to one example implementation of the present disclosure, for a target object in the plurality of objects, a target candidate region in the plurality of candidate regions for presenting the target object is determined based on at least one of: a time at which the target object participates in the target event; a distance between the target candidate region and another candidate region in the plurality of candidate regions for another target object in the plurality of objects that has a same type as the target object; and a distance between the target candidate region and another candidate region in the plurality of candidate regions for another target object in the plurality of objects that has a different type than the target object.

[0094] According to one example implementation of the present disclosure, the third display manner is associated with the first display manner, and a first object quantity of the first group of objects is not higher than a second object quantity of the second group of objects.

[0095] According to one example implementation of the present disclosure, determining the plurality of candidate regions comprises: in response to determining that a change in the object quantity of the plurality of objects satisfies a predetermined condition, determining the plurality of candidate regions.

[0096] According to one example implementation of the present disclosure, the method is implemented in a live application, the target event is a live confrontation event in the live application, and the object identifier is an identifier of a user participating in the live confrontation event.

[0097] Example apparatuses and devices

[0098] FIG. 11 shows a block diagram of an apparatus 1100 for displaying object identifiers according to some implementations of the present disclosure. The apparatus 1100 includes: an object determination module 1110 configured to determine a plurality of objects corresponding to a target event, the plurality of objects including a first group of objects having a first type and a second group of objects having a second type; a region determination module 1120 configured to determine, based on an object quantity of the plurality of objects, a plurality of candidate regions in a predetermined region for presenting object identifiers of the plurality of objects, a target candidate region in the plurality of candidate regions being for presenting a target object identifier of a target object in the plurality of objects; and a presentation module 1130 configured to present the plurality of object identifiers of the plurality of objects based on the plurality of candidate regions, wherein a first group of object identifiers of the first group of objects are presented with a first display manner, and a second group of object identifiers of the second group of objects are presented with a second display manner.

[0099] According to one example implementation of the present disclosure, the apparatus further includes: a set determination module configured to determine a set of contour boundaries associated with the first group of object identifiers; and a boundary presentation module configured to present at least one boundary in the set of contour boundaries with a third display manner.

[0100] According to one example implementation of the present disclosure, the set determination module further includes an adding module configured to, for the first object identification in the first set of object identifications, add a first boundary of the first object identification to the set of contour boundaries in response to a determination that the first boundary is located at a contour position of the first object identification.

[0101] According to one example implementation of the present disclosure, the adding module includes a boundary determination module configured to determine that the first boundary is located at the contour position in response to at least one of: the first boundary corresponding to an adjacent boundary between the first object identification and a second object identification of a second object in the second set of objects; and the first boundary being located at a boundary of a predetermined region.

[0102] According to one example implementation of the present disclosure, the plurality of candidate regions are rectangular regions, and the first boundary corresponds to at least one of: an upper side boundary, a lower side boundary, a left side boundary, and a right side boundary in the rectangular regions.

[0103] According to one example implementation of the present disclosure, the set of contour boundaries further includes a second boundary, and the presenting module includes a connection line presenting module configured to, in response to a determination that a distance between a first end point of the first boundary and a second end point of the second boundary satisfies a predetermined condition, present a connection line between the first boundary and the second boundary using a third display manner.

[0104] According to one example implementation of the present disclosure, the connection line presenting module includes a straight line presenting module configured to, in response to a determination that a first direction of the first boundary is consistent with a second direction of the second boundary, use a straight line segment connecting the first boundary and the second boundary as the connection line.

[0105] According to one example implementation of the present disclosure, for a target object in the plurality of objects, a target candidate region in the plurality of candidate regions for presenting the target object is determined based on at least one of: a time at which the target object participates in a target event; a distance between the target candidate region and another candidate region in the plurality of candidate regions for another target object in the plurality of objects that has a same type as the target object; and a distance between the target candidate region and another candidate region in the plurality of candidate regions for another target object in the plurality of objects that has a different type from the target object.

[0106] According to one example implementation of the present disclosure, the third display manner is associated with the first display manner, and a first number of objects in the first set of objects is not higher than a second number of objects in the second set of objects.

[0107] According to one example implementation of the present disclosure, the region determination module includes a triggering module configured to determine the plurality of candidate regions in response to a determination that a change in a number of objects in the plurality of objects satisfies a predetermined condition.

[0108] According to one example implementation of the present disclosure, the apparatus is implemented in a live application, the target event is a live confrontation event in the live application, and the object identification is an identification of a user participating in the live confrontation event.

[0109] FIG. 12 illustrates a block diagram of a device 1200 that is capable of implementing the various implementations of the present disclosure. It should be appreciated that the computing device 1200 illustrated in FIG. 12 is merely an example and should not be construed to limit the functionality and scope of the implementations described herein. The computing device 1200 illustrated in FIG. 12 can be used to implement the methods described above.

[0110] As shown in FIG. 12, the computing device 1200 is in the form of a general- purpose computing device. The components of the computing device 1200 can include, but are not limited to, one or more processors or processing units 1210, a memory 1220, a storage device 1230, one or more communication units 1240, one or more input devices 1250, and one or more output devices 1260. The processing unit 1210 can be a real or virtual processor and is capable of executing various processing in accordance with programs stored in the memory 1220. In a multi-processing system, multiple processing units execute computer-executable instructions in parallel to improve the processing power of the computing device 1200.

[0111] The computing device 1200 typically includes a plurality of computer storage media. Such media can be volatile and nonvolatile media and removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules, and other data. The memory 1220 can be volatile memory (such as registers, cache, random access memory (RAM)), non-volatile memory (such as read only memory (ROM), electrically erasable programmable read only memory (EEPROM), flash memory), or some combination thereof. The storage device 1230 can be a removable or non-removable media and can include machine readable media such as flash drives, disks, or any other media capable of storing information and / or data (e.g., training data for training) and accessible by the computing device 1200.

[0112] The computing device 1200 can further include additional removable / non-removable, volatile / non-volatile storage devices. Although not shown, a floppy disk drive for reading from or writing to a removable, non-removable, and volatile memory disk (e.g., a "floppy disk"), and an optical disk drive for reading from or writing to a removable, non-removable, and volatile memory disk (e.g., a "floppy disk"), can be provided. In such instances, each drive can be connected to the bus by one or more data media interfaces. The storage device 1220 can include a computer-program product 1225 that has one or more program modules configured to carry out the various methods or actions of the various implementations of the present disclosure.

[0113] The communication unit 1240 enables communications with other computing devices over a communication medium. Additionally, the functionality of the components of the computing device 1200 can be implemented in a single computing cluster or a plurality of computer machines that are capable of communicating over a communication connection. Thus, the computing device 1200 can operate in a networked environment using logical connections to one or more other servers, network personal computers (PCs), or another network nodes in the networking environment.

[0114] The input device 1250 can be one or more input devices, such as a mouse, a keyboard, a trackball, etc. The output device 1260 can be one or more output devices, such as a display, a speaker, a printer, etc. The computing device 1200 can also communicate with one or more external devices (not shown) such as a storage device, a display device, etc. through the communication unit 1240, as needed, one or more devices that enable a user to interact with the computing device 1200, or any devices (e.g., a network card, a modem, etc.) that enable the computing device 1200 to communicate with one or more other computing devices. Such communication can be carried out through an input / output (I / O) interface (not shown).

[0115] According to an example implementation of the present disclosure, a computer-readable storage medium is provided having computer-executable instructions stored thereon, where the computer-executable instructions are executed by a processor to implement the method described above. According to an example implementation of the present disclosure, a computer program product is also provided that is tangibly stored on a non-transitory computer-readable medium and includes computer-executable instructions, where the computer-executable instructions are executed by a processor to implement the method described above. According to an example implementation of the present disclosure, a computer program product is provided having a computer program stored thereon, which when executed by a processor implements the method described above.

[0116] The computer readable program instructions can be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions / acts specified in the flowchart and / or block diagram block or blocks. These computer readable program instructions can also be stored in a computer readable storage medium that can include a non-transitory computer readable storage medium that can be a computer- readable storage medium having no data, programs, program modules, e.g., instructions for operation, or digital content stored thereon or therein for a short time or not at all.

[0117] These computer readable program instructions can be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions / acts specified in the flowchart and / or block diagram block or blocks. These computer readable program instructions can also be stored in a computer readable storage medium that can include a non-transitory computer readable storage medium that can be a computer- readable storage medium having no data, programs, program modules, e.g., instructions for operation, or digital content stored thereon or therein for a short time or not at all.

[0118] These computer readable program instructions can be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions / acts specified in the flowchart and / or block diagram block or blocks. These computer readable program instructions can also be stored in a computer readable storage medium that can include a non-transitory computer readable storage medium that can be a computer- readable storage medium having no data, programs, program modules, e.g., instructions for operation, or digital content stored thereon or therein for a short time or not at all.

[0119] The computer readable program instructions can also be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable apparatus or other device to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions / acts specified in the flowchart and / or block diagram block or blocks.

[0120] Having described various implementations of the disclosure above, the descriptions are not exhaustive and do not limit the disclosure to the disclosed implementations. Numerous modifications and adaptations thereof will be apparent to those skilled in the art without departing from the scope and spirit of the described implementations. The scope of the disclosure includes all the implementations of which an equivalent would be apparent to those skilled in the art from the disclosure given and the associated drawings. The selection of the terms to be used in the written description is not intended to limit the scope of the present disclosure, but rather to best describe the principles of various implementations in preference to a detailed inventory of all technical terms.

Claims

1. A method for displaying an object identification, comprising: determining a plurality of objects corresponding to a target event, the plurality of objects comprising a first group of objects of a first type and a second group of objects of a second type; Based on the number of the multiple objects, determining multiple candidate areas in a predetermined area for presenting object identifications of the multiple objects, wherein a target candidate area in the multiple candidate areas is used to present a target object identification of a target object among the multiple objects; as well as A plurality of object identifiers of the plurality of objects are presented based on the plurality of candidate regions, wherein a first group of object identifiers of the first group of objects are presented using a first display manner, and a second group of object identifiers of the second group of objects are presented using a second display manner.

2. The method according to claim 1, further comprising: determining a set of contour boundaries associated with the first set of object identifiers; as well as At least one boundary in the contour boundary set is presented using a third display mode.

3. The method of claim 2, wherein determining the set of contour boundaries associated with the first set of object identifiers comprises: For a first object identifier in the first group of object identifiers, in response to determining that a first boundary of the first object identifier is located at a contour position of the first group of object identifiers, the first boundary is added to a contour boundary set.

4. The method according to claim 3, wherein determining that the first boundary of the first object identifier is located in the contour area comprises determining that the first boundary is located at the contour position in response to at least any one of the following: The first boundary corresponds to an adjacent boundary between the first object identifier and a second object identifier of a second object in the second group of objects; and The first boundary is located at a boundary of the predetermined area. The method according to claim 3 , wherein the plurality of candidate regions are rectangular regions, and the first boundary corresponds to at least any one of the following in the rectangular region: an upper boundary, a lower boundary, a left boundary, and a right boundary.

6. The method of claim 5, wherein the set of contour boundaries further comprises a second boundary, and rendering the at least one boundary in the set of contour boundaries comprises: In response to determining that the distance between the first endpoint of the first boundary and the second endpoint of the second boundary meets a predetermined condition, a connecting line is presented between the first boundary and the second boundary using the third display mode.

7. The method according to claim 6, wherein presenting the connection line comprises: In response to determining that the first direction of the first boundary is consistent with the second direction of the second boundary, a straight line segment connecting the first boundary and the second boundary is used as the connecting line.

8. The method according to claim 1, wherein for a target object among the multiple objects, a target candidate region for presenting the target object among the multiple candidate regions is determined based on at least any one of the following: The time when the target object participates in the target event; a distance between the target candidate region and another candidate region of another target object of the same type as the target object among the plurality of candidate regions; and a distance between the target candidate region and another candidate region of another target object of a different type from the target object among the multiple candidate regions. 9 . The method according to claim 3 , wherein the third display mode is associated with the first display mode, and a first number of objects in the first group of objects is not greater than a second number of objects in the second group of objects.

10. The method according to claim 1, wherein determining the plurality of candidate regions comprises: In response to determining that a change in the number of objects of the plurality of objects satisfies a predetermined condition, the plurality of candidate regions are determined.

11. The method according to claim 1, wherein the method is implemented in a live broadcast application, the target event is a live broadcast confrontation event in the live broadcast application, and the object identifier is an identifier of a user participating in the live broadcast confrontation event.

12. A device for displaying an object identification, comprising: an object determination module configured to determine a plurality of objects corresponding to a target event, the plurality of objects comprising a first group of objects of a first type and a second group of objects of a second type; an area determination module configured to determine, based on the number of the plurality of objects, a plurality of candidate areas in a predetermined area for presenting object identifications of the plurality of objects, wherein a target candidate area in the plurality of candidate areas is used to present a target object identification of a target object among the plurality of objects; as well as The presenting module is configured to present a plurality of object identifiers of the plurality of objects based on the plurality of candidate regions, wherein a first group of object identifiers of the first group of objects is presented using a first format, and a second group of object identifiers of the second group of objects is presented using a second format.

13. An electronic device comprising: at least one processing unit; as well as At least one memory coupled to the at least one processing unit and storing instructions for execution by the at least one processing unit, the instructions causing the electronic device to perform the method according to any one of claims 1 to 11 when executed by the at least one processing unit.

14. A computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, causes the processor to implement the method according to any one of claims 1 to 11.

15. A computer program product tangibly stored in a computer storage medium and comprising computer executable instructions which, when executed by a device, cause the device to perform the method according to any one of claims 1 to 11.

Images