Abstract: This application provides a map rendering method performed by a computer device. The method includes: obtaining an initial filling result of a plurality of resource objects in a target container; moving, based on the initial filling result, at least one resource object to a center location of an available space corresponding to the resource object in the target container; obtaining symmetry attribute information and inclusion relationship information of the at least one resource object; determining an extension type of the at least one resource object based on the symmetry attribute information and the inclusion relationship information of the at least one resource object; and extending the at least one resource object in the target container based on the extension type of the at least one resource object.

Abstract: An object information processing method includes: acquiring N resource objects to be added to a target container; performing grouping processing on the N resource objects to obtain a grouping processing result, the grouping processing result including at least two object groups and the cumulative area of each object group, the cumulative area of any object group being a sum of the area of all resource objects in the any object group, and a difference between the cumulative area of any two of the object groups being less than an area difference threshold; dividing the target container into at least two regions based on the grouping processing result, one object group corresponding to one region; and adding the N resource objects to the target container according to a corresponding relationship between the object groups and the regions.

Abstract: A data processing method performed by a computer device is disclosed. The method includes: obtaining N graphs, N being an integer greater than 2; determining a reference graph from the N graphs based on a graphic attribute of each graph; determining a placement rule corresponding to the N graphs according to a relationship between a graphic attribute of the reference graph and an attribute threshold; and placing the N graphs in a container according to the placement rule corresponding to the N graphs.