Generalization of 2D city layouts is a relevant operation common to Computer Graphics and GIS, whose goal is to generate simplified representations of street networks. However, most of the contributions in this area belong to the GIS literature, which we intend to bring closer to the CG community. In this paper we propose a threefold characterization of the algorithms dedicated to generic generalization and we also analyze the techniques proposed for the generation of personalized route maps in CG. We examine their data structures, simplification criteria and theoretical basis. To enable a comparative comprehension, we propose unified terminology and we refer the graphs used in the GIS literature to their name used in graph theory. From our analysis of the generalization techniques, we propose four research lines for further investigation to design new generalization algorithms, either from original ideas or by combining/extending some of the reviewed techniques.

二维城市布局的概括是计算机图形学和GIS的一项相关操作，其目标是生成街道网络的简化表示。但是，这方面的大部分贡献都属于GIS文献，我们打算将其与CG社区联系起来。在本文中，我们提出了专用于泛化泛化的算法的三重特征，并且我们还分析了为生成CG中的个性化路线图而提出的技术。我们检查了它们的数据结构，简化标准和理论基础。为了能够进行比较理解，我们提出了统一的术语，并将GIS文献中使用的图形参考其在图形理论中使用的名称。根据我们对归纳技术的分析，