CN113032885B - Vision relation analysis method, device and computer storage medium - Google Patents

Vision relation analysis method, device and computer storage medium Download PDF

Info

Publication number
CN113032885B
CN113032885B CN202110376074.5A CN202110376074A CN113032885B CN 113032885 B CN113032885 B CN 113032885B CN 202110376074 A CN202110376074 A CN 202110376074A CN 113032885 B CN113032885 B CN 113032885B
Authority
CN
China
Prior art keywords
grid
reachable
grids
visible
topology
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related
Application number
CN202110376074.5A
Other languages
Chinese (zh)
Other versions
CN113032885A (en
Inventor
王浩锋
金珊
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shenzhen University
Original Assignee
Shenzhen University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shenzhen University filed Critical Shenzhen University
Priority to CN202110376074.5A priority Critical patent/CN113032885B/en
Publication of CN113032885A publication Critical patent/CN113032885A/en
Application granted granted Critical
Publication of CN113032885B publication Critical patent/CN113032885B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00Computer-aided design [CAD]
    • G06F30/10Geometric CAD
    • G06F30/13Architectural design, e.g. computer-aided architectural design [CAAD] related to design of buildings, bridges, landscapes, production plants or roads
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T7/00Image analysis
    • G06T7/50Depth or shape recovery
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T2207/00Indexing scheme for image analysis or image enhancement
    • G06T2207/10Image acquisition modality
    • G06T2207/10004Still image; Photographic image
    • G06T2207/10012Stereo images

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Geometry (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Computer Hardware Design (AREA)
  • Structural Engineering (AREA)
  • Computational Mathematics (AREA)
  • Civil Engineering (AREA)
  • Mathematical Analysis (AREA)
  • Mathematical Optimization (AREA)
  • Pure & Applied Mathematics (AREA)
  • Evolutionary Computation (AREA)
  • General Engineering & Computer Science (AREA)
  • Architecture (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Processing Or Creating Images (AREA)

Abstract

The invention discloses a visual field relation analysis method, equipment and a computer storage medium, wherein the method comprises the following steps: generating reachable relation data and visible relation data of each grid in the building plan; calculating the average visible depth and the average observed depth of each grid according to the reachable relation data and the visible relation data based on the reachable space of the building plan, and completing the view relation analysis of each grid; the invention solves the problem that the analysis method for splitting the two space experience modes of motion and vision in the prior art cannot truly describe the motion perception experience of classical gardens in China and the space characteristics of 'seen' and 'seen' of scenes, and better reveals the space perception characteristics of different parts of classical gardens in China through the quantitative analysis method for 'seen' and 'seen' space experience.

Description

视域关系分析方法、设备及计算机存储介质Viewshed relationship analysis method, device and computer storage medium

技术领域Technical Field

本发明涉及古典园林与视域关系分析,尤其涉及一种视域关系分析方法、设备及计算机存储介质。The present invention relates to the analysis of the relationship between classical gardens and visual fields, and in particular to a visual field relationship analysis method, device and computer storage medium.

背景技术Background Art

一般建筑中,可视与可达的关系几乎是一致的,即,能看到的地方大多可以直接走过去。然而,中国古典园林的空间存在着普遍的可达与可视关系分离错位的现象,即视线所及之处无法直接可达,往往需要经过曲折的路径才能到达。可达和可视关系的非对称性带来了古典园林独特的“看”与“被看”的空间体验:有些地方很容易走过去并有很好的视野,另一些地方不容易走过去但却很容易被看到。对于这种体验,大多数研究仅仅是通过文学语言描述或照片示意,而无法从定量角度进行客观描述。In general buildings, the relationship between visibility and accessibility is almost the same, that is, most places that can be seen can be walked directly to. However, there is a common phenomenon of separation and dislocation between accessibility and visibility in the space of Chinese classical gardens, that is, the places within sight cannot be directly reached, and often require a tortuous path to reach. The asymmetry of the relationship between accessibility and visibility brings about a unique spatial experience of "seeing" and "being seen" in classical gardens: some places are easy to walk to and have a good view, while other places are not easy to walk to but are easy to see. For this experience, most studies are only described through literary language or photos, and cannot be objectively described from a quantitative perspective.

虽然空间句法(Space Syntax)理论的视域关系分析(VGA:Visibility GraphAnalysis)试图通过可见视野的连续描述来模拟运动中的视觉关系变化,但目前的方法对于古典园林可达与可视关系存在显著错位的空间系统基本无能为力。因此,在应用中不得不将这两种关系割裂,将“运动和视觉”作为两个独立系统分别建模分析:一个是可达层视域模型,另一个则是可视层视域模型。单独的可视分析或可达分析都难以真实反应空间的视觉关系:单纯的可视分析忽略了透明墙体(如窗户等)或低矮障碍物对运动的阻障而高估了空间的可视程度,人无法从一个位置“飞”过上述障碍移动到其他位置观看其它看不到的地方;单纯的可达分析则视透明边界与实体边界无异,由于未考虑“视线先行”的作用导致分析结果难免低估了空间的可视性。Although the visual graph analysis (VGA) of the Space Syntax theory attempts to simulate the changes in visual relationships during movement by continuously describing the visible visual field, the current methods are basically powerless for the spatial system where the accessibility and visual relationships of classical gardens are significantly misaligned. Therefore, in the application, these two relationships have to be separated, and "movement and vision" are modeled and analyzed as two independent systems: one is the accessibility layer visual graph model, and the other is the visual graph model. It is difficult for a single visual analysis or accessibility analysis to truly reflect the visual relationship of the space: a simple visual analysis ignores the obstacles to movement caused by transparent walls (such as windows, etc.) or low obstacles and overestimates the visibility of the space. People cannot "fly" from one position to another position to see other invisible places through the above obstacles; a simple accessibility analysis regards the transparent boundary as the same as the physical boundary. Because the role of "sight first" is not considered, the analysis results inevitably underestimate the visibility of the space.

这种人为将“运动和视觉”两种空间体验方式割裂开来的方法自然无法真实地描述中国古典园林的运动感知经验和景物的“看”与“被看”空间特点。因此在实际应用中有着较多的局限,难以应对复杂空间的分析。This method of artificially separating the two spatial experience modes of "movement and vision" is naturally unable to truly describe the movement perception experience and the spatial characteristics of "seeing" and "being seen" in Chinese classical gardens. Therefore, it has many limitations in practical applications and is difficult to deal with the analysis of complex spaces.

发明内容Summary of the invention

有鉴于此,本申请实施例提供一种视域关系分析方法、设备及计算机存储介质,解决现有技术中运动和视觉两种空间体验方式割裂开来的分析方法无法真实描述中国古典园林的运动感知经验和景物的“看”与“被看”的空间特点的问题。In view of this, the embodiments of the present application provide a visual field relationship analysis method, device and computer storage medium to solve the problem that the analysis method in the prior art that separates the two spatial experience modes of movement and vision cannot truly describe the motion perception experience of Chinese classical gardens and the spatial characteristics of "seeing" and "being seen" of the scenery.

本申请实施例提供了一种视域关系分析方法,所述方法包括:The present application provides a method for analyzing visual relations, the method comprising:

生成建筑平面图中每个栅格的可达关系数据以及可视关系数据;Generate reachability relationship data and visual relationship data for each grid in the building plan;

基于所述建筑平面图的可达空间,根据所述可达关系数据以及所述可视关系数据计算每个栅格的平均可视深度以及平均被视深度,完成对每个栅格的视域关系分析。Based on the accessible space of the building plan, the average visible depth and the average viewed depth of each grid are calculated according to the accessible relationship data and the visual relationship data, and the visual relationship analysis of each grid is completed.

在一实施例中,所述生成建筑平面中每个栅格的可达关系数据以及可视关系数据,包括:In one embodiment, generating reachable relationship data and visible relationship data for each grid in the building plane includes:

获取建筑平面图;Get building plans;

将所述建筑平面图绘制为空间句法分析底图,并将所述空间句法分析底图划分为第一数量且大小相等的栅格;Drawing the building plan as a space syntax analysis base map, and dividing the space syntax analysis base map into a first number of grids of equal size;

基于所述空间句法分析底图,按照栅格的编号顺序依次将每个栅格的可达属性数据存储至第一数据表中,生成可达图层空间关系图解数据表;Based on the spatial syntax analysis base map, the reachable attribute data of each grid is stored in the first data table in sequence according to the grid numbering sequence, and a reachable layer spatial relationship diagram data table is generated;

基于所述空间句法分析底图,按照栅格的编号顺序依次将每个栅格的可视属性数据存储至第二数据表中,生成可视图层空间关系图解数据表。Based on the spatial syntax analysis base map, the visual attribute data of each grid is stored in the second data table in sequence according to the grid numbering sequence, and a visual layer spatial relationship diagram data table is generated.

在一实施例中,所述基于所述建筑平面图的可达空间,根据所述可达关系数据以及可视关系数据计算每个栅格的平均可视深度以及平均被视深度,完成对每个栅格的视域关系分析包括:In one embodiment, the reachable space based on the building plan, calculating the average visible depth and the average viewed depth of each grid according to the reachable relationship data and the visual relationship data, and completing the visual relationship analysis of each grid includes:

基于所述可达图层空间关系图解数据表以及所述可视图层空间关系图解数据表,通过所述栅格的编号获取每个栅格的可达栅格矩阵以及可视栅格矩阵;Based on the reachable layer spatial relationship diagram data table and the visible layer spatial relationship diagram data table, obtaining the reachable grid matrix and the visible grid matrix of each grid by the number of the grid;

基于所述可达栅格矩阵以及所述可视栅格矩阵,利用第一预设方法计算每个栅格的平均可视深度;Based on the reachable grid matrix and the visible grid matrix, calculating the average visible depth of each grid using a first preset method;

基于所述可达栅格矩阵以及所述可视栅格矩阵,利用第二预设方法计算每个栅格的平均被视深度。Based on the reachable grid matrix and the visible grid matrix, an average viewed depth of each grid is calculated using a second preset method.

在一实施例中,所述基于所述可达栅格矩阵以及所述可视栅格矩阵,利用第一预设方法计算每个栅格的平均可视深度,包括:In one embodiment, the calculating the average visible depth of each grid using a first preset method based on the reachable grid matrix and the visible grid matrix includes:

选定起点栅格,则所述起点栅格对应的可视栅格数量为V0;其中,所述起点栅格为所述空间句法分析底图中的任意一个栅格;A starting grid is selected, and the number of visible grids corresponding to the starting grid is V 0 ; wherein the starting grid is any grid in the space syntax analysis base map;

从所述起点栅格出发,执行第一次可达拓扑,获得所述第一次可达拓扑的直接可达栅格与所述直接可达栅格对应的直接可视栅格的总数量,记为所述第一次可达拓扑的新增可视栅格数量V1Starting from the starting grid, executing the first reachable topology, obtaining the total number of directly reachable grids of the first reachable topology and directly visible grids corresponding to the directly reachable grids, recorded as the number of newly added visible grids V 1 of the first reachable topology;

从上一次可达拓扑的任意新增可视栅格出发,执行第i次可达拓扑,获得所述第i次可达拓扑的直接可达栅格与所述直接可达栅格对应的直接可视栅格的总数量,记为所述第i次可达拓扑的新增可视栅格数量Vi;其中,i为正整数;Starting from any newly added visible grid of the last reachable topology, execute the i-th reachable topology, obtain the total number of directly reachable grids of the i-th reachable topology and the directly reachable grids corresponding to the directly reachable grids, and record it as the number of newly added visible grids V i of the i-th reachable topology; wherein i is a positive integer;

重复执行上述操作,直至所述起点栅格的可视栅格数量达到总栅格数量减1,则停止拓扑操作;其中,所述总栅格数量为所述第一数量;Repeat the above operation until the number of visible grids of the starting grid reaches the total number of grids minus 1, and then stop the topological operation; wherein the total number of grids is the first number;

基于所述起点栅格对应的可视栅格数量V0、当前的可达拓扑深度i、所述第i次可达拓扑的新增可视栅格数量Vi、进行可达拓扑的总次数以及总栅格数量,计算所述起点栅格的的平均可视深度。Based on the number of visible grids V 0 corresponding to the starting grid, the current reachable topology depth i, the number of newly added visible grids V i of the i-th reachable topology, the total number of reachable topology operations and the total number of grids, the average visible depth of the starting grid is calculated.

在一实施例中,所述每个栅格的平均可视深度为所述空间句法分析底图中的任意一个起点栅格可达或者可视其他栅格的平均拓扑深度。In one embodiment, the average visible depth of each grid is the average topological depth of other grids that can be reached or viewed by any starting grid in the space syntax analysis base map.

在一实施例中,所述基于所述可达栅格矩阵以及所述可视栅格矩阵,利用第二预设方法计算每个栅格的平均被视深度,包括:In one embodiment, the calculating the average viewed depth of each grid using a second preset method based on the reachable grid matrix and the visible grid matrix includes:

以起点栅格为目标,在所述第一数量的栅格中,获取直接可视起点栅格的栅格,记为可视栅格区域且所述可视栅格区域的栅格数量为D0Taking the starting grid as the target, among the first number of grids, the grids of the directly visible starting grid are obtained, which are recorded as a visible grid area, and the number of grids in the visible grid area is D 0 ;

在所述第一数量的栅格中剔除所述可视栅格区域的栅格,获得剩余栅格;Eliminate grids in the visible grid area from the first number of grids to obtain remaining grids;

在所述剩余栅格中执行第一次可达拓扑,获得所述剩余栅格中可达所述可视栅格区域的栅格数量,记为所述第一次可达拓扑的新增可达栅格数量D1Execute the first reachable topology in the remaining grids to obtain the number of grids in the remaining grids that can reach the visible grid area, which is recorded as the number of newly added reachable grids D 1 of the first reachable topology;

将上一次可达拓扑获得的所述新增可达栅格加入所述可视栅格区域,生成新的可视栅格区域;Adding the newly added reachable grid obtained from the last reachable topology to the visible grid area to generate a new visible grid area;

在剩余栅格中剔除所述新的可视栅格区域,获得新的剩余栅格;Eliminate the new visible grid area from the remaining grids to obtain a new remaining grid;

在所述新的剩余栅格中执行第i次可达拓扑,获得所述新的剩余栅格中可达所述新的可视栅格区域的栅格数量,记为所述第i次可达拓扑的新增可达栅格数量Di;其中,i为正整数;Execute the i-th reachable topology in the new remaining grids, obtain the number of grids in the new remaining grids that can reach the new visible grid area, and record it as the number of newly added reachable grids D i of the i-th reachable topology; wherein i is a positive integer;

重复执行上述操作,直至所述新的剩余栅格数量减少为零,则停止拓扑操作;Repeat the above operation until the number of the new remaining grids is reduced to zero, and then stop the topological operation;

基于所述可视栅格区域的栅格数量D0、当前的可达拓扑深度i、所述第i次可达拓扑的新增可达栅格数量Di、进行可达拓扑的总次数以及总栅格数量,计算所述起点栅格的的平均被视深度。The average visible depth of the starting grid is calculated based on the number of grids D 0 in the visible grid area, the current reachable topology depth i, the number of newly added reachable grids D i of the i-th reachable topology, the total number of reachable topology operations and the total number of grids.

在一实施例中,所述每个栅格的平均被视深度为所述空间句法分析底图中的任意一个栅格可达或者可视起点栅格的平均拓扑深度。In one embodiment, the average viewed depth of each grid is the average topological depth of any grid-reachable or visible starting point grid in the space syntax analysis base map.

在一实施例中,所述方法,还包括:In one embodiment, the method further includes:

基于每个栅格的视域关系分析结果,执行可视化操作。Perform visualization operations based on the results of the viewshed relationship analysis for each raster.

为实现上述目的,还提供一种计算机存储介质,所述计算机存储介质上存储有视域关系分析方法的程序,所述视域关系分析方法的程序被处理器执行时实现上述任一所述的视域关系分析方法的步骤。In order to achieve the above-mentioned purpose, a computer storage medium is also provided, on which a program of the viewshed relationship analysis method is stored. When the program of the viewshed relationship analysis method is executed by a processor, the steps of any of the above-mentioned viewshed relationship analysis methods are implemented.

为实现上述目的,还提供一种视域关系分析设备,包括存储器,处理器及存储在所述存储器上并可在所述处理器上运行的视域关系分析方法的程序,所述处理器执行所述视域关系分析方法的程序时实现上述任一所述的视域关系分析方法的步骤。To achieve the above-mentioned purpose, a visual relationship analysis device is also provided, comprising a memory, a processor, and a program of a visual relationship analysis method stored in the memory and executable on the processor, wherein the processor implements any of the steps of the visual relationship analysis method described above when executing the program of the visual relationship analysis method.

本申请实施例中提供的一个或多个技术方案,至少具有如下技术效果或优点:One or more technical solutions provided in the embodiments of the present application have at least the following technical effects or advantages:

生成建筑平面图中每个栅格的可达关系数据以及可视关系数据;通过软件的计算,生成准确的建筑平面图中每个栅格的可达关系数据以及可视关系数据,保证后续计算每个栅格的平均可视深度以及平均被视深度的正确性;Generate the reachability relationship data and visual relationship data of each grid in the building plan; through the calculation of the software, generate accurate reachability relationship data and visual relationship data of each grid in the building plan, to ensure the correctness of the subsequent calculation of the average visual depth and average viewed depth of each grid;

基于所述建筑平面图的可达空间,根据所述可达关系数据以及所述可视关系数据计算每个栅格的平均可视深度以及平均被视深度,完成对每个栅格的视域关系分析;在建筑面积的可达空间中,即人可进入的空间(可达图层界定的范围),其它空间被排除在外;此处的限定避免了增加模型的空间量(平面的栅格数量),从而避免了数据分布的偏斜带来的计学上的误差;通过量化的平均可视深度以及平均被视深度,精确的对每个栅格进行关系分析,从而揭示建筑的空间特点。Based on the accessible space of the building plan, the average visible depth and the average viewed depth of each grid are calculated according to the accessible relationship data and the visual relationship data, and the visual relationship analysis of each grid is completed; in the accessible space of the building area, that is, the space accessible to people (the range defined by the accessible layer), other spaces are excluded; the limitation here avoids increasing the spatial volume of the model (the number of grids in the plane), thereby avoiding the mathematical errors caused by the skewness of the data distribution; through the quantified average visible depth and average viewed depth, the relationship analysis of each grid is accurately performed, thereby revealing the spatial characteristics of the building.

本申请解决了现有技术中运动和视觉两种空间体验方式割裂开来的分析方法无法真实描述中国古典园林的运动感知经验和景物的“看”与“被看”的空间特点的问题,通过“看”与“被看”空间体验的量化分析方法,更好的揭示了中国古典园林不同部分的空间感知特点。The present application solves the problem that the analysis methods in the prior art that separate the two spatial experience modes of movement and vision cannot truly describe the motion perception experience of Chinese classical gardens and the spatial characteristics of "seeing" and "being seen" of the scenery. Through the quantitative analysis method of the spatial experience of "seeing" and "being seen", the spatial perception characteristics of different parts of Chinese classical gardens are better revealed.

附图说明BRIEF DESCRIPTION OF THE DRAWINGS

图1为本申请视域关系分析方法的第一实施例的流程示意图;FIG1 is a flow chart of a first embodiment of a method for analyzing visual relations in the present application;

图2为本申请视域关系分析方法第一实施例中步骤S110的具体流程示意图;FIG. 2 is a schematic diagram of a specific flow chart of step S110 in the first embodiment of the view relation analysis method of the present application;

图3为示例网师园平面图以及对应的可达层底图与可视层底图;Figure 3 is an example of the Wangshiyuan plan and the corresponding accessible layer base map and visible layer base map;

图4为本申请视域关系分析方法第一实施例中步骤S120的具体流程示意图;FIG4 is a schematic diagram of a specific flow chart of step S120 in the first embodiment of the view relation analysis method of the present application;

图5为本申请视域关系分析方法步骤S122的具体流程示意图;FIG5 is a schematic diagram of a specific flow chart of step S122 of the view relation analysis method of the present application;

图6为本申请视域关系分析方法中“看”(左图)与“被看”(右图)度量方法示意FIG6 is a schematic diagram of the measurement method of “seeing” (left picture) and “being seen” (right picture) in the visual field relationship analysis method of this application

图7为本申请视域关系分析方法步骤S123的具体流程示意图;FIG. 7 is a schematic diagram of a specific flow chart of step S123 of the view relation analysis method of the present application;

图8为本申请视域关系分析方法的第二实施例的流程示意图;FIG8 is a flow chart of a second embodiment of the view relationship analysis method of the present application;

图9为现有技术与本方法分析结果对比示意图;FIG9 is a schematic diagram comparing the analysis results of the prior art and the present method;

图10为本申请实施例中涉及的视域关系分析设备的硬件架构示意图;FIG10 is a schematic diagram of the hardware architecture of a visual relationship analysis device involved in an embodiment of the present application;

具体实施方式DETAILED DESCRIPTION

应当理解,此处所描述的具体实施例仅仅用以解释本发明,并不用于限定本发明。It should be understood that the specific embodiments described herein are only used to explain the present invention, and are not used to limit the present invention.

本发明实施例的主要解决方案是:生成建筑平面图中每个栅格的可达关系数据以及可视关系数据;基于所述建筑平面图的可达空间,根据所述可达关系数据以及所述可视关系数据计算每个栅格的平均可视深度以及平均被视深度,完成对每个栅格的视域关系分析;本发明解决了现有技术中运动和视觉两种空间体验方式割裂开来的分析方法无法真实描述中国古典园林的运动感知经验和景物的“看”与“被看”的空间特点的问题,通过“看”与“被看”空间体验的量化分析方法,更好的揭示了中国古典园林不同部分的空间感知特点。The main solution of the embodiment of the present invention is: generating reachable relationship data and visual relationship data for each grid in the building plan; based on the reachable space of the building plan, calculating the average visual depth and the average viewed depth of each grid according to the reachable relationship data and the visual relationship data, and completing the visual field relationship analysis of each grid; the present invention solves the problem that the analysis method in the prior art that separates the two spatial experience modes of movement and vision cannot truly describe the motion perception experience of Chinese classical gardens and the spatial characteristics of "seeing" and "being seen" of the scenery, and better reveals the spatial perception characteristics of different parts of Chinese classical gardens through the quantitative analysis method of the spatial experience of "seeing" and "being seen".

为了更好的理解上述技术方案,下面将结合说明书附图以及具体的实施方式对上述技术方案进行详细的说明。In order to better understand the above technical solution, the above technical solution will be described in detail below in conjunction with the accompanying drawings and specific implementation methods.

参照图1,图1为本申请视域关系分析方法的第一实施例,所述方法包括:Referring to FIG. 1 , FIG. 1 is a first embodiment of the view relation analysis method of the present application, the method comprising:

步骤S110:生成建筑平面图中每个栅格的可达关系数据以及可视关系数据。Step S110: Generate reachable relationship data and visible relationship data for each grid in the building plan.

具体地,可以通过预设方法,生成建筑平面图中每个栅格的可达关系数据以及可视关系数据,其中,所述预设方法可以是使用相关软件,在本实施例中,空间句法分析底图可以由CAD软件或者其他方法生成;栅格的生成以及可达关系图解数据表与可视关系图解数据表,则利用的是DepthmapX软件。Specifically, the reachable relationship data and the visible relationship data of each grid in the building plan can be generated by a preset method, wherein the preset method can be the use of relevant software. In this embodiment, the spatial syntax analysis base map can be generated by CAD software or other methods; the generation of grids and the reachable relationship diagram data table and the visual relationship diagram data table utilize DepthmapX software.

具体地,可达关系数据可以为可达图层空间关系图解数据表;可视关系数据可以为可视图层空间关系图解数据表;在此并不限定于上述数据表,也可以包含其他的可达或者可视关系的数据。Specifically, the reachable relationship data may be a reachable layer spatial relationship diagram data table; the visual relationship data may be a visible layer spatial relationship diagram data table; this is not limited to the above data tables, and may also include other reachable or visual relationship data.

步骤S120:基于所述建筑平面图的可达空间,根据所述可达关系数据以及所述可视关系数据计算每个栅格的平均可视深度以及平均被视深度,完成每个栅格的视域关系分析。Step S120: Based on the accessible space of the building plan, the average visible depth and the average viewed depth of each grid are calculated according to the accessible relationship data and the visible relationship data, and the visual relationship analysis of each grid is completed.

具体地,在本实施例中,所述建筑平面图的可达空间仅包括人可进入的空间,即可达图层界定的范围,其它空间被排除在外;此处的限定可以避免增加模型的空间量(平面的栅格数量)数值,从而减少误差;因为平均拓扑深度的计算明显受到空间量数值的影响,进而可能因为数据分布的偏斜带来统计学上的误差。Specifically, in this embodiment, the accessible space of the building plan only includes the space that can be entered by people, that is, the range defined by the accessible layer, and other spaces are excluded; the limitation here can avoid increasing the value of the spatial quantity of the model (the number of grids in the plane), thereby reducing errors; because the calculation of the average topological depth is obviously affected by the value of the spatial quantity, it may cause statistical errors due to the skewness of the data distribution.

具体地,分析生成的每个栅格的平均可视深度以及平均被视深度,可以更好的度量视觉关系的“深”与“浅”。Specifically, analyzing the average visible depth and average viewed depth of each generated grid can better measure the “depth” and “shallowness” of the visual relationship.

具体地,空间句法(Space Syntax)理论的视域关系分析(VGA:Visibility GraphAnalysis)方法是建筑学领域空间研究的一种重要技术手段,并形成了一系列计算机软件工具,如DepthmapX,Isovist,DecodingSpaceToolbox,Syntax2D等。以其中最有影响力的空间句法软件DepthmapX为例,该方法以一定密度的均匀栅格覆盖所分析的建筑平面,绘制每个栅格(中心点)的等视域图(Isovists,即从该点360度视野看出去的视区范围以及由于受墙体遮挡形成的视域多边形的形态构成属性);除了度量等视域的几何形态属性外,另外通过连接度(Connectivity)、平均深度(Mean Depth)等指标来度量栅格之间等视域的重叠程度和视觉关系的拓扑深度变化。受建筑平面布局中墙体等空间划分物体的影响,等视域的形状和大小随建筑平面中观察点的不同而变化,反应了人在运动过程中经历的视野变化。一系列连续的等视域构成了连续的景象,体现了诸如在建筑中漫步的情景。国内外大量实证研究揭示了建筑布局的视域拓扑连接模式影响了人的认知过程和行为,如动线组织或静态的空间占用模式等。Specifically, the Visibility Graph Analysis (VGA) method of Space Syntax theory is an important technical means for spatial research in the field of architecture, and has formed a series of computer software tools, such as DepthmapX, Isovist, DecodingSpaceToolbox, Syntax2D, etc. Taking the most influential space syntax software DepthmapX as an example, this method covers the analyzed building plane with a uniform grid of a certain density, and draws the isovists (i.e., the range of the view area from the 360-degree field of view of the point and the morphological composition properties of the view polygon formed by the wall occlusion) of each grid (center point); in addition to measuring the geometric morphological properties of the isovists, the degree of overlap of the isovists between grids and the topological depth change of the visual relationship are measured by indicators such as connectivity and mean depth. Affected by the space dividing objects such as walls in the building plane layout, the shape and size of the isovists vary with the different observation points in the building plane, reflecting the changes in vision experienced by people during movement. A series of continuous equal horizons form a continuous scene, reflecting scenes such as walking in a building. A large number of empirical studies at home and abroad have revealed that the topological connection pattern of the horizon of the building layout affects people's cognitive process and behavior, such as the organization of movement lines or the static space occupancy pattern.

上述实施例中,存在的有益效果为:通过量化每个栅格的平均可视深度以及平均被视深度,使“看”与“被看”空间体验更加明显,量化描述复杂建筑空间(如古典园林)的“看”与“被看”的空间体验特点与差别,从而更好地理解古典园林的空间设计方法,从而更好的揭示了中国古典园林不同部分的空间感知特点。In the above embodiment, the beneficial effect is as follows: by quantifying the average visible depth and the average viewed depth of each grid, the spatial experience of "seeing" and "being seen" is made more obvious, and the spatial experience characteristics and differences of "seeing" and "being seen" in complex architectural spaces (such as classical gardens) are quantitatively described, so as to better understand the spatial design methods of classical gardens, thereby better revealing the spatial perception characteristics of different parts of Chinese classical gardens.

参照图2,图2为本申请视域关系分析方法第一实施例中步骤S110的具体实施步骤,所述生成建筑平面中每个栅格的可达关系数据以及可视关系数据,包括:Referring to FIG. 2 , FIG. 2 is a specific implementation step of step S110 in the first embodiment of the viewshed relationship analysis method of the present application, wherein the generation of reachable relationship data and visible relationship data of each grid in the building plane includes:

步骤S111:获取建筑平面图。Step S111: Obtain a building plan.

具体地,建筑平面图又可简称平面图,是将新建建筑物或构筑物的墙、门窗、楼梯、地面及内部功能布局等建筑情况,以水平投影方法和相应的图例所组成的图纸。Specifically, an architectural floor plan, also known as a floor plan, is a drawing that uses a horizontal projection method and corresponding legends to show the walls, doors, windows, stairs, floors, internal functional layout and other construction conditions of a new building or structure.

需要另外说明的是,本申请中以园林平面图(jpg或矢量测绘图,请确保平面有比例尺或绘图单位)为主要研究对象,但并不限定于园林平面图,适用于包含可达空间与可视空间相结合的复杂建筑空间。在本申请中,以苏州园林的网师园为例,说明具体的实施例,但本方法并不限定于网师园。It should be noted that the application mainly uses the garden plan (jpg or vector mapping, please ensure that the plane has a scale or drawing unit) as the research object, but it is not limited to the garden plan, and is applicable to complex architectural spaces that combine accessible space with visible space. In this application, the Master of Nets Garden of Suzhou Garden is taken as an example to illustrate a specific embodiment, but this method is not limited to the Master of Nets Garden.

步骤S112:将所述建筑平面图绘制为空间句法分析底图,并将所述空间句法分析底图划分为第一数量且大小相等的栅格。Step S112: drawing the building plan as a space syntax analysis base map, and dividing the space syntax analysis base map into a first number of grids of equal size.

具体地,安装Windows系统的CAD软件以及DepthmapX(DepthmapX最新版本为v0.8);在CAD绘图软件如Autocad中,导入所述网师园平面图的jpg图片或者矢量测绘图,然后绘制空间句法VGA分析底图;绘图中务必区分平面中的两类边界:可视边界和可达边界。可视边界指眼睛高度以上、阻挡视线的不透明实体如墙体;可达边界指阻挡人身体移动的边界,除了前者之外,还包括一些高度较低(眼睛高度以下)或透明的边界,诸如栏杆、绿化、水面、落地玻璃等(图3,图3中图左为网师园平面图,图中为足部高度可达层VGA底图(依据人足部高度(Knee-level)的建筑平面边界条件绘制的),图右为足部高度可视层VGA(依据人眼睛高度(Eye-level)的边界条件绘制的))。参见住建部十三五规划教材《空间句法教程》第四章的说明,将可视边界与可达边界分别绘制在两个图层(如分别命名为“Visualboundary”和“Access boundary”),并确保各自图层的外围边界闭合,然后将绘制好的图形存储为dxf文件格式。Specifically, install CAD software and DepthmapX (the latest version of DepthmapX is v0.8) for Windows system; import the jpg picture or vector mapping map of the Wangshiyuan plan in CAD drawing software such as Autocad, and then draw the spatial syntax VGA analysis base map; be sure to distinguish between two types of boundaries in the plane during drawing: visible boundaries and reachable boundaries. The visible boundary refers to an opaque entity such as a wall that blocks the line of sight above the eye level; the reachable boundary refers to a boundary that blocks the movement of the human body. In addition to the former, it also includes some low-height (below the eye level) or transparent boundaries, such as railings, greenery, water surface, floor-to-ceiling glass, etc. (Figure 3, the left figure in Figure 3 is the Wangshiyuan plan, the figure is the foot-level reachable layer VGA base map (drawn according to the architectural plane boundary conditions of the human foot level (Knee-level)), and the right figure is the foot-level visible layer VGA (drawn according to the boundary conditions of the human eye level (Eye-level))). Refer to the instructions in Chapter 4 of the Ministry of Housing and Urban-Rural Development's 13th Five-Year Plan textbook "Space Syntax Tutorial", draw the visible boundary and the accessible boundary on two layers (such as "Visualboundary" and "Access boundary") respectively, and ensure that the outer boundaries of each layer are closed, and then save the drawn graphics in dxf file format.

步骤S113:基于所述空间句法分析底图,按照栅格的编号顺序依次将每个栅格的可达属性数据存储至第一数据表中,生成可达图层空间关系图解数据表。Step S113: Based on the spatial syntax analysis base map, the reachable attribute data of each grid is stored in the first data table in sequence according to the grid numbering sequence, and a reachable layer spatial relationship diagram data table is generated.

具体地,将前面存储的dxf文件导入DepthmapX。确保Drawing Layers中的可达图层和可视图层均处于打开的状态。参照《空间句法教程》第四章4.2.2的说明,将VGA分析网格尺寸设置为0.6米,填充可达空间的范围,再生成可达图层的空间关系图解。然后,可达图层的空间关系图解输出为CSV文件,DepthmapX的菜单路径为:Map→Export→VisibilityGraph Connections as CSV…。输出的CSV文件以栅格的ID编号方式存储每个栅格直接相连的其它栅格的信息,为便于区分,可将此文件命名为“AccessLinks.csv”。Specifically, import the dxf file stored previously into DepthmapX. Make sure that the accessible layers and visible graph layers in Drawing Layers are both turned on. Referring to the instructions in Chapter 4, 4.2.2 of the Spatial Syntax Tutorial, set the VGA analysis grid size to 0.6 meters, fill the range of the accessible space, and then generate the spatial relationship diagram of the accessible layer. Then, the spatial relationship diagram of the accessible layer is output as a CSV file. The menu path of DepthmapX is: Map→Export→VisibilityGraph Connections as CSV… The output CSV file stores the information of other grids directly connected to each grid in the form of grid ID numbers. For easy distinction, this file can be named "AccessLinks.csv".

具体地,可达属性数据可以包括可达栅格矩阵、连接关系以及平均深度等,在此并不限定。Specifically, the reachable attribute data may include a reachable grid matrix, a connection relationship, an average depth, etc., which are not limited here.

步骤S114:基于所述空间句法分析底图,按照栅格的编号顺序依次将每个栅格的可视属性数据存储至第二数据表中,生成可视图层空间关系图解数据表。Step S114: Based on the spatial syntax analysis base map, the visual attribute data of each grid is stored in the second data table in sequence according to the grid numbering sequence, and a visual layer spatial relationship diagram data table is generated.

具体地,将前面存储的dxf文件导入DepthmapX。确保Drawing Layers中的可达图层和可视图层均处于打开的状态。参照《空间句法教程》第四章4.2.2的说明,将VGA分析网格尺寸设置为0.6米,填充可达空间的范围,参考《空间句法教程》第四章4.3.2的说明,切换到Drawing Layers为当前工作图层,关闭导入的dxf文件的可达图层,确保仅可视图层处于打开状态,然后再生成的空间关系图解即为可视图层的关系图解。随后,将可视图层的空间关系图解输出为CSV文件,DepthmapX的菜单路径如上所示;为便于区分,可将可视图层的数据表命名为“VisibilityLinks.csv”。Specifically, import the dxf file stored previously into DepthmapX. Make sure that both the reachable layer and the visible layer in Drawing Layers are turned on. Refer to the instructions in Chapter 4, 4.2.2 of the Spatial Syntax Tutorial to set the VGA analysis grid size to 0.6 meters to fill the range of the reachable space. Refer to the instructions in Chapter 4, 4.3.2 of the Spatial Syntax Tutorial to switch to Drawing Layers as the current working layer, close the reachable layer of the imported dxf file, and make sure that only the visible layer is turned on. The spatial relationship diagram generated is the relationship diagram of the visible layer. Subsequently, the spatial relationship diagram of the visible layer is exported as a CSV file. The menu path of DepthmapX is shown above. For easy distinction, the data table of the visible layer can be named "VisibilityLinks.csv".

具体地,可视属性数据可以包括可视栅格矩阵、连接关系以及平均深度等,在此并不限定。Specifically, the visual attribute data may include a visual grid matrix, a connection relationship, an average depth, etc., which are not limited here.

上述实施例中,存在的有益效果为:通过上述步骤,正确生成可达图层空间关系图解数据表以及可视图层空间关系图解数据表,从而保证后续栅格的平均可视深度以及平均被视深度计算的正确性,从而保证建筑园林的空间特点被正确的分析。In the above embodiment, the beneficial effect is: through the above steps, the spatial relationship diagram data table of the reachable layer and the spatial relationship diagram data table of the visible layer are correctly generated, thereby ensuring the correctness of the subsequent calculation of the average visible depth and the average viewed depth of the grid, thereby ensuring that the spatial characteristics of the building garden are correctly analyzed.

参照图4,图4为本申请视域关系分析方法第一实施例中步骤S120的具体实施步骤,所述基于所述建筑平面图的可达空间,根据所述可达关系数据以及可视关系数据计算每个栅格的平均可视深度以及平均被视深度,完成对每个栅格的视域关系分析,包括:Referring to FIG. 4 , FIG. 4 is a specific implementation step of step S120 in the first embodiment of the viewshed relationship analysis method of the present application, wherein the reachable space based on the building plan, the average visible depth and the average viewed depth of each grid are calculated according to the reachable relationship data and the visual relationship data, and the viewshed relationship analysis of each grid is completed, including:

步骤S121:基于所述可达图层空间关系图解数据表以及所述可视图层空间关系图解数据表,通过所述栅格的编号获取每个栅格的可达栅格矩阵以及可视栅格矩阵。Step S121: Based on the reachable layer spatial relationship diagram data table and the visible layer spatial relationship diagram data table, obtain the reachable grid matrix and the visible grid matrix of each grid through the grid numbering.

具体地,在生成可达图层空间关系图解数据表以及生成可视图层关系图解数据表的过程中,栅格的位置没有发生改变,则两个图层中栅格的编号完全一样,则同一位置的空间获得了可视属性数据以及可达属性数据。Specifically, in the process of generating a reachable layer spatial relationship diagram data table and generating a visible layer relationship diagram data table, if the position of the grid does not change, the grid numbers in the two layers are exactly the same, and the space at the same position obtains visible attribute data and reachable attribute data.

步骤S122:基于所述可达栅格矩阵以及所述可视栅格矩阵,利用第一预设方法计算每个栅格的平均可视深度。Step S122: Based on the reachable grid matrix and the visible grid matrix, calculate the average visible depth of each grid using a first preset method.

具体地,在本实施例中,通过C++语言计算每个栅格的平均可视深度,并将计算结果以txt文件存储,但在此并不限定于上述语言以及上述文件存储方式,可以根据需求动态调整。Specifically, in this embodiment, the average visible depth of each grid is calculated by C++ language, and the calculation result is stored in a txt file, but it is not limited to the above language and the above file storage method, and can be dynamically adjusted according to needs.

步骤S123:基于所述可达栅格矩阵以及所述可视栅格矩阵,利用第二预设方法计算每个栅格的平均被视深度。Step S123: Based on the reachable grid matrix and the visible grid matrix, calculate the average viewed depth of each grid using a second preset method.

具体地,在步骤S122中已进行阐述,在此不再赘述。Specifically, it has been explained in step S122 and will not be repeated here.

上述实施例中,存在的有益效果为:通过第一预设方法以及第二预设方法正确计算每个栅格的平均可视深度以及平均被视深度,从而保证每个栅格的空间信息能够准确的被分析。In the above embodiment, the beneficial effect is that the average visible depth and the average viewed depth of each grid are correctly calculated by the first preset method and the second preset method, thereby ensuring that the spatial information of each grid can be accurately analyzed.

参照图5,图5为本申请视域关系分析方法中步骤S122的具体实施步骤,所述基于所述可达栅格矩阵以及所述可视栅格矩阵,利用第一预设方法计算每个栅格的平均可视深度,包括:Referring to FIG. 5 , FIG. 5 is a specific implementation step of step S122 in the viewshed relationship analysis method of the present application, wherein the average visible depth of each grid is calculated using a first preset method based on the reachable grid matrix and the visible grid matrix, including:

步骤S1221:选定起点栅格,则所述起点栅格对应的可视栅格数量为V0;其中,所述起点栅格为所述空间句法分析底图中的任意一个栅格。Step S1221: Select a starting grid, and the number of visible grids corresponding to the starting grid is V 0 ; wherein the starting grid is any grid in the space syntax analysis base map.

步骤S1222:从所述起点栅格出发,执行第一次可达拓扑,获得所述第一次可达拓扑的直接可达栅格与所述直接可达栅格对应的直接可视栅格的总数量,记为所述第一次可达拓扑的新增可视栅格数量V1Step S1222: Starting from the starting grid, execute the first reachable topology, obtain the total number of directly reachable grids of the first reachable topology and directly visible grids corresponding to the directly reachable grids, and record it as the number of newly added visible grids V 1 of the first reachable topology.

步骤S1223:从上一次可达拓扑的任意新增可视栅格出发,执行第i次可达拓扑,获得所述第i次可达拓扑的直接可达栅格与所述直接可达栅格对应的直接可视栅格的总数量,记为所述第i次可达拓扑的新增可视栅格数量Vi;其中,i为正整数。Step S1223: Starting from any newly added visible grid of the last reachable topology, execute the i-th reachable topology, obtain the total number of directly reachable grids of the i-th reachable topology and the directly reachable grids corresponding to the directly reachable grids, and record it as the number of newly added visible grids V i of the i-th reachable topology; wherein i is a positive integer.

步骤S1224:重复执行上述操作,直至所述起点栅格的可视栅格数量达到总栅格数量减1,则停止拓扑操作;其中,所述总栅格数量为所述第一数量。Step S1224: Repeat the above operation until the number of visible grids of the starting grid reaches the total number of grids minus 1, and then stop the topological operation; wherein the total number of grids is the first number.

步骤S1225:基于所述起点栅格对应的可视栅格数量V0、当前的可达拓扑深度i、所述第i次可达拓扑的新增可视栅格数量Vi、进行可达拓扑的总次数以及总栅格数量,计算所述起点栅格的平均可视深度。Step S1225: Calculate the average visual depth of the starting grid based on the number of visible grids V 0 corresponding to the starting grid, the current reachable topology depth i, the number of newly added visible grids V i of the i-th reachable topology, the total number of reachable topology operations and the total number of grids.

具体地,“看”(view analysis)的拓扑深度算法(平均可视深度)如下:Specifically, the topological depth algorithm (average visible depth) of "view analysis" is as follows:

Figure BDA0003010154050000101
Figure BDA0003010154050000101

Figure BDA0003010154050000111
Figure BDA0003010154050000111

上述代码的计算思路是:The calculation idea of the above code is:

对起点栅格当前可视栅格集合做可达拓扑,每次拓扑会增加新的可视栅格,直至起点栅格的可视栅格数达到(总栅格数-1)。Make a reachable topology for the current visible grid set of the starting grid. Each topology will add new visible grids until the number of visible grids of the starting grid reaches (total number of grids - 1).

设当前的可达拓扑深度为i,且第i次可达拓扑的新增可视栅格数目Vi,进行可达拓扑的总次数为n,位于起点栅格处的可视栅格数目为V0,总栅格数目为C,那么平均可视深度的计算公式为:Assume that the current reachable topology depth is i, and the number of newly added visible grids of the i-th reachable topology is V i , the total number of reachable topology is n, the number of visible grids at the starting grid is V 0 , and the total number of grids is C. Then the calculation formula for the average visible depth is:

Figure BDA0003010154050000112
Figure BDA0003010154050000112

上述算法代码的具体步骤:The specific steps of the above algorithm code are:

1)从起点栅格出发,做一次可达拓扑,第一次可达拓扑的直接可达栅格和这些可达栅格直接可视的栅格总数目,记为第一次拓扑的新增可视栅格数V11) Starting from the starting grid, make a reachable topology. The total number of directly reachable grids of the first reachable topology and the grids directly visible to these reachable grids is recorded as the number of newly added visible grids V 1 of the first topology;

2)从第一次拓扑的可视栅格出发,做第二次可达拓扑,本次拓扑的直接可达栅格数据和这些可达栅格直接可视的栅格总数目,减去上次可达拓扑的可视栅格数V1,得到第二次拓扑的新增可视栅格数V22) Starting from the visible grids of the first topology, make a second reachable topology. The directly reachable grid data of this topology and the total number of directly visible grids of these reachable grids are subtracted from the number of visible grids V 1 of the previous reachable topology to obtain the number of newly added visible grids V 2 of the second topology;

3)从第二次拓扑的可视栅格出发,做第三次可达拓扑,本次拓扑的直接可达栅格数据和这些可达栅格直接可视的栅格总数目,减去上次可达拓扑的可视栅格数V2,得到第二次拓扑的新增可视栅格数V33) Starting from the visible grids of the second topology, make the third reachable topology. The directly reachable grid data of this topology and the total number of directly visible grids of these reachable grids are subtracted from the number of visible grids V 2 of the previous reachable topology to obtain the number of newly added visible grids V 3 of the second topology.

4)依次类推,直至起点栅格的可视栅格数目达到地图中的总栅格数,拓扑停止;4) And so on, until the number of visible grids of the starting grid reaches the total number of grids in the map, the topology stops;

5)根据公式1,计算起点栅格的平均可视拓扑深度。5) According to formula 1, calculate the average visual topological depth of the starting grid.

上述实施例中,存在的有益效果为:保证每个栅格的平均可视深度的正确计算,从而更好的量化“看”的空间体验。In the above embodiment, the beneficial effect is: ensuring the correct calculation of the average visible depth of each grid, so as to better quantify the spatial experience of "seeing".

其中一个实施例中,所述每个栅格的平均可视深度为所述空间句法分析底图中的任意一个起点栅格可达或者可视其他栅格的平均拓扑深度。In one of the embodiments, the average visible depth of each grid is the average topological depth of other grids that can be reached or viewed by any starting grid in the space syntax analysis base map.

具体地,参照图6左图,为位置J点的平均可视拓扑深度的度量方法示意图,以图6左图为示例,位置J点“看”的平均拓扑深度:Specifically, referring to the left figure of FIG6 , a schematic diagram of a method for measuring the average visual topological depth of a point at position J is shown. Taking the left figure of FIG6 as an example, the average topological depth of “seeing” at point J is:

Depth 1(可视):1080个栅格;Depth 1 (visible): 1080 grids;

Depth 2(可达+可视):2234个栅格;Depth 2 (reachable + visible): 2234 grids;

Depth 3(可达+可视):835个栅格;Depth 3 (reachable + visible): 835 grids;

Depth 4(可达+可视):298个栅格;Depth 4 (reachable + visible): 298 grids;

Depth 5(可达+可视):139个栅格;Depth 5 (reachable + visible): 139 grids;

Depth 6(可达+可视):679个栅格;Depth 6 (reachable + visible): 679 grids;

Depth 7(可达+可视):1438个栅格;Depth 7 (reachable + visible): 1438 grids;

Depth 8(可达+可视):611个栅格;Depth 8 (reachable + visible): 611 grids;

Depth 9(可达+可视):76个栅格;Depth 9 (reachable + visible): 76 grids;

Depth 10(可达+可视):194个栅格;Depth 10 (reachable + visible): 194 grids;

Depth 11(可达+可视):349个栅格;Depth 11 (reachable + visible): 349 grids;

Depth 12(可达+可视):96个栅格;Depth 12 (reachable + visible): 96 grids;

Depth 13(可达+可视):51个栅格;Depth 13 (reachable + visible): 51 grids;

平均拓扑深度=37246(总深度)/8080(总栅格数)=4.610。Average topological depth = 37246 (total depth) / 8080 (total number of grids) = 4.610.

每次可视关系的拓扑搜索都建立在前一次新增的可达空间位置上进行,直到穷尽所有栅格。如此便可以得到从位置J点“看”其他栅格的平均拓扑深度。Each topological search of visual relationships is based on the newly added reachable spatial position in the previous search until all grids are exhausted. In this way, the average topological depth of other grids "viewed" from position J can be obtained.

参照图7,图7为本申请视域关系分析方法步骤S123的具体实施步骤,所述基于所述可达栅格矩阵以及所述可视栅格矩阵,利用第二预设方法计算每个栅格的平均被视深度,包括:Referring to FIG. 7 , FIG. 7 is a specific implementation step of step S123 of the viewshed relationship analysis method of the present application, wherein the average viewed depth of each grid is calculated using a second preset method based on the reachable grid matrix and the visible grid matrix, including:

步骤S1231:以起点栅格为目标,在所述第一数量的栅格中,获取直接可视起点栅格的栅格,记为可视栅格区域且所述可视栅格区域的栅格数量为D0Step S1231: Taking the starting grid as the target, among the first number of grids, obtain the grids of the directly visible starting grid, record them as visible grid area, and the number of grids in the visible grid area is D 0 .

步骤S1232:在所述第一数量的栅格中剔除所述可视栅格区域的栅格,获得剩余栅格。Step S1232: Eliminate grids in the visible grid area from the first number of grids to obtain remaining grids.

步骤S1233:在所述剩余栅格中执行第一次可达拓扑,获得所述剩余栅格中可达所述可视栅格区域的栅格数量,记为所述第一次可达拓扑的新增可达栅格数量D1Step S1233: Execute the first reachable topology in the remaining grids to obtain the number of grids in the remaining grids that can reach the visible grid area, which is recorded as the newly added reachable grid number D 1 of the first reachable topology.

步骤S1234:将上一次可达拓扑获得的所述新增可达栅格加入所述可视栅格区域,生成新的可视栅格区域。Step S1234: adding the newly added reachable grid obtained from the last reachable topology to the visible grid area to generate a new visible grid area.

步骤S1235:在剩余栅格中剔除所述新的可视栅格区域,获得新的剩余栅格。Step S1235: Eliminate the new visible grid area from the remaining grids to obtain a new remaining grid.

步骤S1236:在所述新的剩余栅格中执行第i次可达拓扑,获得所述新的剩余栅格中可达所述新的可视栅格区域的栅格数量,记为所述第i次可达拓扑的新增可达栅格数量Di;其中,i为正整数。Step S1236: Execute the i-th reachable topology in the new remaining grids to obtain the number of grids in the new remaining grids that can reach the new visible grid area, recorded as the number of newly added reachable grids D i of the i-th reachable topology; wherein i is a positive integer.

步骤S1237:重复执行上述操作,直至所述新的剩余栅格数量减少为零,则停止拓扑操作。Step S1237: Repeat the above operation until the number of new remaining grids is reduced to zero, and then stop the topological operation.

步骤S1238:基于所述可视栅格区域的栅格数量D0、当前的可达拓扑深度i、所述第i次可达拓扑的新增可达栅格数量Di、进行可达拓扑的总次数以及总栅格数量,计算所述起点栅格的平均被视深度。Step S1238: Calculate the average visible depth of the starting grid based on the number of grids D 0 in the visible grid area, the current reachable topology depth i, the number of newly added reachable grids D i of the i-th reachable topology, the total number of reachable topology operations and the total number of grids.

Figure BDA0003010154050000131
Figure BDA0003010154050000131

Figure BDA0003010154050000141
Figure BDA0003010154050000141

上述代码的计算思路是:The calculation idea of the above code is:

从图中找到可以直接看见起点栅格的栅格,记为当前可视栅格区域,每次从剩余栅格中找出能够通过一次可达拓扑可以到达当前可视栅格区域的栅格数目,将搜索出的可达栅格加入可视栅格区域,并在剩余栅格中剔除;继续从剩余栅格寻找通过一次可达拓扑到达的栅格,直至地图中所有栅格均被搜索到。Find the grid that can directly see the starting grid from the graph, record it as the current visible grid area, find out the number of grids that can reach the current visible grid area through a reachable topology from the remaining grids each time, add the searched reachable grids to the visible grid area, and remove them from the remaining grids; continue to search for grids that can be reached through a reachable topology from the remaining grids until all grids in the map are searched.

设当前的可达拓扑深度为i,且第i次可达拓扑的可达栅格数目Di,进行可达拓扑的总次数为n,地图中能够直接看见起点栅格的栅格数目为D0,总栅格数目为C,那么平均被视深度的计算公式为:Assume that the current reachable topology depth is i, and the number of reachable grids of the i-th reachable topology is D i , the total number of reachable topology is n, the number of grids that can directly see the starting grid in the map is D 0 , and the total number of grids is C, then the calculation formula for the average visible depth is:

Figure BDA0003010154050000142
Figure BDA0003010154050000142

上述算法代码的具体步骤:The specific steps of the above algorithm code are:

1)从地图中找出可以直接看见起点栅格的栅格,对应栅格数目记为D01) Find the grid from the map that can directly see the starting grid, and the corresponding grid number is recorded as D 0 ;

2)从地图中找到可以直接看见起点栅格的栅格,记为当前可视栅格区域;2) Find the grid from the map that can directly see the starting grid, and record it as the current visible grid area;

3)在剔除可视栅格的剩余栅格中,搜索剩余栅格中经过一次可达拓扑可达的栅格数目,记为第一次拓扑的新增可达栅格数目为D13) After removing the visible grids, search for the number of grids that are reachable through the first reachable topology in the remaining grids, and record it as the number of newly added reachable grids of the first topology as D 1 ;

4)将D1加入到可视栅格区域,并在剩余栅格中剔除上次的可达栅格D1,再搜索剩余栅格中经过一次可达拓扑可达的栅格数目,记为第二次拓扑的可达栅格数目为D24) Add D 1 to the visible grid area, and remove the last reachable grid D 1 from the remaining grids, and then search the number of grids reachable by the first reachable topology in the remaining grids, and record it as the number of reachable grids of the second topology as D 2 ;

5)将D2加入到可视栅格区域,并在剩余栅格中剔除上次的可达栅格D2,再搜索剩余栅格中经过一次可达拓扑可达的栅格数目,记为第二次拓扑的可达栅格数目为D35) Add D 2 to the visible grid area, and remove the last reachable grid D 2 from the remaining grids, and then search the number of grids that are reachable through the first reachable topology in the remaining grids, and record it as the number of reachable grids of the second topology as D 3 ;

6)依次类推,直至剩余栅格数目减为零,拓扑停止;6) And so on, until the number of remaining grids is reduced to zero, and the topology stops;

7)根据公式2,计算起点栅格的平均被视拓扑深度。7) According to formula 2, calculate the average viewed topological depth of the starting point grid.

上述实施例中,存在的有益效果为:保证每个栅格的平均被视深度的正确计算,从而更好的量化“被看”的空间体验。In the above embodiment, the beneficial effect is: ensuring the correct calculation of the average viewed depth of each grid, thereby better quantifying the spatial experience of “being viewed”.

在其中一个实施例中,所述每个栅格的平均被视深度为所述空间句法分析底图中的任意一个栅格可达或者可视起点栅格的平均拓扑深度。In one of the embodiments, the average visible depth of each grid is the average topological depth of any grid reachable or visible starting point grid in the space syntax analysis base map.

具体地,参照图6右图,为位置J点的平均被视拓扑深度的度量方法示意图,如图6右图,位置J点“被看”的平均拓扑深度。Specifically, referring to the right figure of FIG6 , which is a schematic diagram of a method for measuring the average viewed topological depth of point J at position, as shown in the right figure of FIG6 , the average topological depth of point J at position “being viewed”.

Depth 1(可视):1080个栅格;Depth 1 (visible): 1080 grids;

Depth 2(可达):1598个栅格;Depth 2 (reachable): 1598 grids;

Depth 3(可达):879个栅格;Depth 3 (reachable): 879 grids;

Depth 4(可达):1930个栅格;Depth 4 (reachable): 1930 grids;

Depth 5(可达):1243个栅格;Depth 5 (reachable): 1243 grids;

Depth 6(可达):929个栅格;Depth 6 (reachable): 929 grids;

Depth 7(可达):326个栅格;Depth 7 (reachable): 326 grids;

Depth 8(可达):95个栅格;Depth 8 (reachable): 95 grids;

平均拓扑深度=29464(总深度)/8080(总栅格数)=3.647。Average topological depth = 29464 (total depth) / 8080 (total number of grids) = 3.647.

从图6右图可以看出,对于“被看”的指标计算,有且只有第一个拓扑深度的连接是可视关系连接,其它拓扑深度上全部为可达关系连接。As can be seen from the right figure of Figure 6, for the calculation of the "viewed" indicator, only the connections at the first topological depth are visible relationship connections, and all connections at other topological depths are reachable relationship connections.

参照图8,图8为本申请视域关系分析方法的第二实施例,所述方法,还包括:Referring to FIG. 8 , FIG. 8 is a second embodiment of the view relation analysis method of the present application, the method further includes:

步骤S210:通过预设方法获得建筑平面图中每个栅格的可达关系数据以及可视关系数据。Step S210: Obtain the reachable relationship data and visible relationship data of each grid in the building plan through a preset method.

步骤S220:基于所述建筑平面图的可达空间,根据所述可达关系数据以及所述可视关系数据计算每个栅格的平均可视深度以及平均被视深度,完成对每个栅格的视域关系分析。Step S220: Based on the accessible space of the building plan, the average visible depth and the average viewed depth of each grid are calculated according to the accessible relationship data and the visible relationship data, and the visual relationship analysis of each grid is completed.

步骤S230:基于每个栅格的视域关系分析结果,执行可视化操作。Step S230: Perform visualization operations based on the viewshed relationship analysis results of each grid.

第二实施例与第一实施例相比,包含步骤S230,其他步骤在第一实施例中已经进行了阐述,在此不再赘述。Compared with the first embodiment, the second embodiment includes step S230, and the other steps have been described in the first embodiment and will not be repeated here.

具体地,计算结果的txt文件可以导入DepthmapX的VGA分析文件并可视化,具体实现步骤参见《空间句法教程》第四章4.5.3章节的介绍,在此不再赘述。网师园空间的可达图层的平均深度、可视图层的平均深度,以及“看”与“被看”的平均深度的对比见图9;如图9所示,为可视图分析(VGA)新旧方法对比,左面两张图片为空间句法现有技术VGA方法分析的网师园的可达层与可视层两个系统的平均深度;右边两张图片为本实施例中“看”与“被看”的空间深度分析;其中需要另外说明的是,图9中栅格颜色越深,则代表平均拓扑深度越小。Specifically, the txt file of the calculation results can be imported into the VGA analysis file of DepthmapX and visualized. For the specific implementation steps, please refer to the introduction of Chapter 4, Section 4.5.3 of the "Spatial Syntax Tutorial", which will not be repeated here. The average depth of the accessible layer of the Wangshiyuan space, the average depth of the visible layer, and the average depth of "seeing" and "being seen" are compared in Figure 9; as shown in Figure 9, it is a comparison of the old and new methods of visible graph analysis (VGA). The two pictures on the left are the average depths of the two systems of the accessible layer and the visible layer of Wangshiyuan analyzed by the VGA method of the prior art of spatial syntax; the two pictures on the right are the spatial depth analysis of "seeing" and "being seen" in this embodiment; it should be noted that the darker the grid color in Figure 9, the smaller the average topological depth.

在上述实施例中,存在的有益效果为:执行可视化操作后,可以很容易的看出本方法能更好揭示园林不同部分的空间感知特点。In the above embodiment, there is a beneficial effect that after performing the visualization operation, it can be easily seen that the method can better reveal the spatial perception characteristics of different parts of the garden.

本申请还提供一种计算机存储介质,所述计算机存储介质上存储有视域关系分析方法的程序,所述视域关系分析方法的程序被处理器执行时实现上述任一所述的视域关系分析方法的步骤。The present application also provides a computer storage medium, on which a program of a viewshed relationship analysis method is stored. When the program of the viewshed relationship analysis method is executed by a processor, the steps of any of the above-mentioned viewshed relationship analysis methods are implemented.

本申请还提供一种视域关系分析设备,包括存储器,处理器及存储在所述存储器上并可在所述处理器上运行的视域关系分析方法的程序,所述处理器执行所述视域关系分析方法的程序时实现上述任一所述的视域关系分析方法的步骤。The present application also provides a visual relationship analysis device, comprising a memory, a processor, and a program of a visual relationship analysis method stored in the memory and executable on the processor, wherein the processor implements any of the steps of the visual relationship analysis method described above when executing the program of the visual relationship analysis method.

本申请涉及一种视域关系分析设备010包括如图10所示:至少一个处理器012、存储器011。The present application relates to a visual relationship analysis device 010 including: as shown in FIG10 , at least one processor 012 and a memory 011 .

处理器012可能是一种集成电路芯片,具有信号的处理能力。在实现过程中,上述方法的各步骤可以通过处理器012中的硬件的集成逻辑电路或者软件形式的指令完成。上述的处理器012可以是通用处理器、数字信号处理器(DSP)、专用集成电路(ASIC)、现场可编程门阵列(FPGA)或者其他可编程逻辑器件、分立门或者晶体管逻辑器件、分立硬件组件。可以实现或者执行本发明实施例中的公开的各方法、步骤及逻辑框图。通用处理器可以是微处理器或者该处理器也可以是任何常规的处理器等。软件模块可以位于随机存储器,闪存、只读存储器,可编程只读存储器或者电可擦写可编程存储器、寄存器等本领域成熟的存储介质中。该存储介质位于存储器011,处理器012读取存储器011中的信息,结合其硬件完成上述方法的步骤。The processor 012 may be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method can be completed by the hardware integrated logic circuit in the processor 012 or the instruction in the form of software. The above processor 012 can be a general processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components. The disclosed methods, steps and logic block diagrams in the embodiments of the present invention can be implemented or executed. The general processor can be a microprocessor or the processor can also be any conventional processor. The software module can be located in a mature storage medium in the field such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory or an electrically erasable programmable memory, a register, etc. The storage medium is located in the memory 011, and the processor 012 reads the information in the memory 011 and completes the steps of the above method in combination with its hardware.

可以理解,本发明实施例中的存储器011可以是易失性存储器或非易失性存储器,或可包括易失性和非易失性存储器两者。其中,非易失性存储器可以是只读存储器(ReadOnly Memory,ROM)、可编程只读存储器(Programmable ROM,PROM)、可擦除可编程只读存储器(Erasable PROM,EPROM)、电可擦除可编程只读存储器(Electrically EPROM,EEPROM)或闪存。易失性存储器可以是随机存取存储器(Random Access Memory,RAM),其用作外部高速缓存。通过示例性但不是限制性说明,许多形式的RAM可用,例如静态随机存取存储器(Static RAM,SRAM)、动态随机存取存储器(Dynamic RAM,DRAM)、同步动态随机存取存储器(Synchronous DRAM,SDRAM)、双倍数据速率同步动态随机存取存储器(Double DataRateSDRAM,DDRSDRAM)、增强型同步动态随机存取存储器(Enhanced SDRAM,ESDRAM)、同步连接动态随机存取存储器(Synch link DRAM,SLDRAM)和直接内存总线随机存取存储器(DirectRambus RAM,DRRAM)。本发明实施例描述的系统和方法的存储器011旨在包括但不限于这些和任意其它适合类型的存储器。It can be understood that the memory 011 in the embodiment of the present invention can be a volatile memory or a non-volatile memory, or can include both volatile and non-volatile memories. Among them, the non-volatile memory can be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), or a flash memory. The volatile memory can be a random access memory (RAM), which is used as an external cache. By way of example but not limitation, many forms of RAM are available, such as static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDRSDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous link dynamic random access memory (SLDRAM) and direct RAM bus random access memory (DRRAM). The memory 011 of the system and method described in the embodiments of the present invention is intended to include, but is not limited to, these and any other suitable types of memory.

本领域内的技术人员应明白,本发明的实施例可提供为方法、系统、或计算机程序产品。因此,本发明可采用完全硬件实施例、完全软件实施例、或结合软件和硬件方面的实施例的形式。而且,本发明可采用在一个或多个其中包含有计算机可用程序代码的计算机可用存储介质(包括但不限于磁盘存储器、CD-ROM、光学存储器等)上实施的计算机程序产品的形式。Those skilled in the art will appreciate that embodiments of the present invention may be provided as methods, systems, or computer program products. Therefore, the present invention may take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the present invention may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

本发明是参照根据本发明实施例的方法、设备(系统)、和计算机程序产品的流程图和/或方框图来描述的。应理解可由计算机程序指令实现流程图和/或方框图中的每一流程和/或方框、以及流程图和/或方框图中的流程和/或方框的结合。可提供这些计算机程序指令到通用计算机、专用计算机、嵌入式处理机或其他可编程数据处理设备的处理器以产生一个机器,使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的装置。The present invention is described with reference to the flowchart and/or block diagram of the method, device (system), and computer program product according to the embodiment of the present invention. It should be understood that each process and/or box in the flowchart and/or block diagram, as well as the combination of the process and/or box in the flowchart and/or block diagram can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device produce a device for implementing the functions specified in one or more processes in the flowchart and/or one or more boxes in the block diagram.

这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理设备以特定方式工作的计算机可读存储器中,使得存储在该计算机可读存储器中的指令产生包括指令装置的制造品,该指令装置实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能。These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing device to work in a specific manner, so that the instructions stored in the computer-readable memory produce a manufactured product including an instruction device that implements the functions specified in one or more processes in the flowchart and/or one or more boxes in the block diagram.

这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上,使得在计算机或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理,从而在计算机或其他可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的步骤。These computer program instructions may also be loaded onto a computer or other programmable data processing device so that a series of operational steps are executed on the computer or other programmable device to produce a computer-implemented process, whereby the instructions executed on the computer or other programmable device provide steps for implementing the functions specified in one or more processes in the flowchart and/or one or more boxes in the block diagram.

应当注意的是,在权利要求中,不应将位于括号之间的任何参考符号构造成对权利要求的限制。单词“包含”不排除存在未列在权利要求中的部件或步骤。位于部件之前的单词“一”或“一个”不排除存在多个这样的部件。本发明可以借助于包括有若干不同部件的硬件以及借助于适当编程的计算机来实现。在列举了若干装置的单元权利要求中,这些装置中的若干个可以是通过同一个硬件项来具体体现。单词第一、第二、以及第三等的使用不表示任何顺序。可将这些单词解释为名称。It should be noted that in the claims, any reference signs placed between brackets shall not be construed as limiting the claims. The word "comprising" does not exclude the presence of components or steps not listed in the claim. The word "a" or "an" preceding a component does not exclude the presence of a plurality of such components. The invention may be implemented by means of hardware comprising several different components and by means of a suitably programmed computer. In a unit claim enumerating several means, several of these means may be embodied by the same item of hardware. The use of the words first, second, and third etc. does not indicate any order. These words may be interpreted as names.

尽管已描述了本发明的优选实施例,但本领域内的技术人员一旦得知了基本创造性概念,则可对这些实施例作出另外的变更和修改。所以,所附权利要求意欲解释为包括优选实施例以及落入本发明范围的所有变更和修改。Although the preferred embodiments of the present invention have been described, those skilled in the art may make other changes and modifications to these embodiments once they have learned the basic creative concept. Therefore, the appended claims are intended to be interpreted as including the preferred embodiments and all changes and modifications that fall within the scope of the present invention.

显然,本领域的技术人员可以对本发明进行各种改动和变型而不脱离本发明的精神和范围。这样,倘若本发明的这些修改和变型属于本发明权利要求及其等同技术的范围之内,则本发明也意图包含这些改动和变型在内。Obviously, those skilled in the art can make various changes and modifications to the present invention without departing from the spirit and scope of the present invention. Thus, if these modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include these modifications and variations.

Claims (6)

1. A method of view relationship analysis, the method comprising:
obtaining a building plan;
drawing the building plan into a space syntactic analysis base map, and dividing the space syntactic analysis base map into a first number of grids with equal size;
based on the space syntactic analysis base map, storing the reachable attribute data of each grid into a first data table in turn according to the serial number sequence of the grids, and generating a reachable layer space relation graphic data table;
based on the space syntax analysis base map, sequentially storing the visual attribute data of each grid into a second data table according to the serial number sequence of the grids, and generating a visual layer space relation graphic data table;
Acquiring an reachable grid matrix and a visible grid matrix of each grid through the serial number of the grid based on the reachable layer space relation graphic data table and the visible layer space relation graphic data table;
calculating the average visible depth of each grid by using a first preset method based on the reachable grid matrix and the visible grid matrix;
calculating the average perceived depth of each grid by using a second preset method based on the reachable grid matrix and the visible grid matrix;
completing analysis of the view relationship of each grid;
the method for calculating the average visual depth of each grid by using a first preset method based on the reachable grid matrix and the visual grid matrix comprises the following steps:
s1221: selecting a starting point grid, wherein the number of visible grids corresponding to the starting point grid isV 0 The method comprises the steps of carrying out a first treatment on the surface of the Wherein, the starting point grid is any grid in the space syntactic analysis base graph;
s1222: starting from the starting point grid, executing a first reachable topology, obtaining the total number of the directly reachable grids of the first reachable topology and the directly reachable grids corresponding to the directly reachable grids, and recording the total number as the newly added number of the directly reachable grids of the first reachable topology V 1
S1223: starting from any newly added visual grid of the last reachable topology, executing the firstiA secondary reachable topology, obtaining the firstiThe total number of directly reachable grids of the secondary reachable topology and the directly reachable grids corresponding to the directly reachable grids is recorded as the firstiNew incremental visual grid number for sub-reachable topologyV i; wherein ,iis a positive integer;
s1224: repeating steps S1221 to S1223 until the number of visible grids of the starting grid reaches the total number of grids minus 1, and stopping the topology operation; wherein the total grid number is the first number;
s1225: based on the number of visible grids corresponding to the starting gridV 0 Current reachable topology depthiSaid first stepiNew incremental visual grid number for sub-reachable topologyV i The total times of the reachable topology and the total grid quantity are carried out, and the average visible depth of the starting point grids is calculated;
the calculating the average depth of view of each grid by using a second preset method based on the reachable grid matrix and the visible grid matrix comprises the following steps:
s1231: the first number of grids is used as targets, grids of the direct visual starting point grids are obtained and marked as visual grid areas, and the number of grids of the visual grid areas is D 0
S1232: removing grids of the visible grid area from the first number of grids to obtain remaining grids;
s1233: executing a first reachable topology in the remaining grids, obtaining the number of grids in the remaining grids, which can reach the visible grid area, and recording the number of grids as a new reachable grid number of the first reachable topologyD 1
S1234: adding the newly added reachable grid obtained by the last reachable topology into the visible grid area to generate a new visible grid area;
s1235: removing the new visible grid area from the remaining grids to obtain new remaining grids;
s1236: executing the first in the new remaining gridiA sub-reachable topology, obtaining the number of grids in the new remaining grids, which can reach the new visible grid area, which is recorded as the firstiNewly added number of reachable grids of sub-reachable topologyD i; wherein ,iis a positive integer;
s1237: repeating steps S1231 to S1236 until the new remaining number of grids is reduced to zero, and stopping the topology operation;
s1238: grid number based on the visual grid areaD 0 Current reachable topology depthiSaid first stepiNewly added number of reachable grids of sub-reachable topology D i And carrying out the total times of the reachable topology and the total grid number, and calculating the average observed depth of the starting point grid.
2. The visual field relation analysis method of claim 1, wherein the average visual depth of each grid is an average topological depth at which any one starting grid in the space syntax analysis base map is reachable or at which other grids are visible.
3. The visual field relation analysis method of claim 1, wherein the average perceived depth of each grid is the average topological depth of any one of the grid reachable or visible starting point grids in the spatial syntactic analysis base.
4. The visual field relationship analysis method of claim 1, wherein the method further comprises:
based on the analysis result of the view relationship of each grid, a visualization operation is performed.
5. A computer storage medium, wherein a program of a visual field relation analysis method is stored on the computer storage medium, and the program of the visual field relation analysis method realizes the steps of the visual field relation analysis method according to any one of claims 1 to 4 when being executed by a processor.
6. A visual field relation analysis device comprising a memory, a processor and a program of visual field relation analysis methods stored on the memory and executable on the processor, the processor implementing the steps of the visual field relation analysis method of any one of claims 1 to 4 when executing the program of visual field relation analysis method.
CN202110376074.5A 2021-04-07 2021-04-07 Vision relation analysis method, device and computer storage medium Expired - Fee Related CN113032885B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110376074.5A CN113032885B (en) 2021-04-07 2021-04-07 Vision relation analysis method, device and computer storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110376074.5A CN113032885B (en) 2021-04-07 2021-04-07 Vision relation analysis method, device and computer storage medium

Publications (2)

Publication Number Publication Date
CN113032885A CN113032885A (en) 2021-06-25
CN113032885B true CN113032885B (en) 2023-04-28

Family

ID=76454175

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110376074.5A Expired - Fee Related CN113032885B (en) 2021-04-07 2021-04-07 Vision relation analysis method, device and computer storage medium

Country Status (1)

Country Link
CN (1) CN113032885B (en)

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108470103A (en) * 2018-03-22 2018-08-31 东南大学 A kind of pivot function space layout design method based on Space Syntax

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3078935A1 (en) * 2015-04-10 2016-10-12 The European Atomic Energy Community (EURATOM), represented by the European Commission Method and device for real-time mapping and localization
CN112435337B (en) * 2020-11-13 2024-09-10 郑亮 Landscape visual field analysis method and system

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108470103A (en) * 2018-03-22 2018-08-31 东南大学 A kind of pivot function space layout design method based on Space Syntax

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
曹玮 ; 王晓春 ; 薛白 ; 黄春华 ; .扬州园林复道回廊的空间句法解析――以何园、个园为例.扬州大学学报(农业与生命科学版).2020,(04),第122-129页. *
曹玮 ; 薛白 ; 王晓春 ; 胡立辉 ; .基于空间句法的扬州何园空间组织特征分析.风景园林.2018,(06),第120-125页. *

Also Published As

Publication number Publication date
CN113032885A (en) 2021-06-25

Similar Documents

Publication Publication Date Title
Vespa et al. Efficient octree-based volumetric SLAM supporting signed-distance and occupancy mapping
CN107004297B (en) Three-dimensional automatic stereo modeling method and program based on two-dimensional plane diagram
US20130271461A1 (en) Systems and methods for obtaining parameters for a three dimensional model from reflectance data
CN112465968B (en) Building map mixed data model construction method for positioning navigation
CN110941871A (en) An automatic labeling method and system based on room information in Revit 3D model
WO2023124160A1 (en) Method, system and apparatus for automatically generating three-dimensional house layout, and medium
CN109409318B (en) Statistical model training method, statistical device and storage medium
CN107689078A (en) A kind of bounding volume hierarchy (BVH) tree constructing method based on chain list sorting balanced binary tree
CN114821055B (en) Method, device, readable storage medium and electronic device for constructing house model
CN113032885B (en) Vision relation analysis method, device and computer storage medium
EP4459553A1 (en) Method and device for optimizing three-dimensional map display
WO2023125585A1 (en) Evacuation simulation method and apparatus, and electronic device and storage medium
CN113599808B (en) Method and device for constructing topography in virtual scene
JP6253053B2 (en) Data search device, data search device control method, and data search device control program
CN104376026B (en) Table lookup method based on grid and multidimensional tree mixed structure
CN114503166A (en) Three-dimensional volume data measurement method, measurement system, medical device and storage medium
CN117541695A (en) Rain cloud precipitation simulation method, device, equipment and medium
WO2023241517A1 (en) Lung deformation simulation method and apparatus, and server
Carabaño et al. Efficient implementation of a fast viewshed algorithm on SIMD architectures
CN112927350B (en) Method, device, equipment and storage medium for constructing multi-domain geological body model
CN115631320A (en) Precalculated cell display method, precalculated cell generation method and device
CN111368468B (en) A method for calculating the two-dimensional boundary of concentrated villages based on mathematical methods and programming algorithms
CN112669446A (en) Building scene modeling method and device
CN109377562B (en) A Viewpoint Planning Method for Automatic 3D Measurement
CN117828538B (en) Multi-source information comprehensive analysis method and system based on weight allocation

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
EE01 Entry into force of recordation of patent licensing contract
EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20210625

Assignee: SHENZHEN VIDENT TECHNOLOGY CO.,LTD.

Assignor: SHENZHEN University

Contract record no.: X2023980046281

Denomination of invention: Analysis methods, devices, and computer storage media for domain relationships

Granted publication date: 20230428

License type: Common License

Record date: 20231110

EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20210625

Assignee: Sankexiaocao (Shenzhen) Internet of Things Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980047154

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20231115

Application publication date: 20210625

Assignee: Shenzhen Pengyang Smart Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980047146

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20231115

Application publication date: 20210625

Assignee: Shenzhen Zhenbing intelligent Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980047136

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20231115

Application publication date: 20210625

Assignee: SHENZHEN SCILIT TECHNOLOGY Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980047129

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20231115

Application publication date: 20210625

Assignee: SHENZHEN KSY Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980046891

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20231114

Application publication date: 20210625

Assignee: Shenzhen Yingqi Consulting Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980047348

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20231116

Application publication date: 20210625

Assignee: Shenzhen Minghua Trading Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980047346

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20231116

Application publication date: 20210625

Assignee: Shenzhen Dongfang Huilian Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980047336

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20231116

Application publication date: 20210625

Assignee: Shenzhen Weigao Investment Development Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980047270

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20231116

Application publication date: 20210625

Assignee: Yuncheng Holding (Shenzhen) Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980047231

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20231116

Application publication date: 20210625

Assignee: Shenzhen Boosted Goal Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980047206

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20231115

EE01 Entry into force of recordation of patent licensing contract
EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20210625

Assignee: Shenzhen Xunming Trading Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980047343

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20231116

Application publication date: 20210625

Assignee: Shenzhen Haocai Digital Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980047340

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20231116

Application publication date: 20210625

Assignee: Changyuan Comprehensive Energy (Shenzhen) Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980047286

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20231116

EE01 Entry into force of recordation of patent licensing contract
EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20210625

Assignee: Shenzhen Kaixin Intelligent Control Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980048385

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20231124

Application publication date: 20210625

Assignee: Shenzhen Jiarun original Xinxian Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980048249

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20231123

Application publication date: 20210625

Assignee: SHENZHEN CHENGZI DIGITAL TECHNOLOGY Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980048050

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20231123

Application publication date: 20210625

Assignee: Shenzhen Xinsheng interconnected technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980048035

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20231123

Application publication date: 20210625

Assignee: Foshan Wanhu Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980048028

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20231123

Application publication date: 20210625

Assignee: Foshan Deyi Intelligent Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980048004

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20231123

Application publication date: 20210625

Assignee: SHENZHEN GEAZAN TECHNOLOGY Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980047959

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20231123

Application publication date: 20210625

Assignee: SHENZHEN MASTERCOM TECHNOLOGY Corp.

Assignor: SHENZHEN University

Contract record no.: X2023980047952

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20231123

EE01 Entry into force of recordation of patent licensing contract
EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20210625

Assignee: Langwei Supply Chain Management (Shenzhen) Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980048668

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20231128

EE01 Entry into force of recordation of patent licensing contract
EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20210625

Assignee: Shenzhen Tianyi Survey Engineering Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980049540

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20231201

Application publication date: 20210625

Assignee: Shenzhen Guangfeng Hongye Engineering Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980049510

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20231201

Application publication date: 20210625

Assignee: Shenzhen Fulongsheng Industrial Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980049215

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20231130

Application publication date: 20210625

Assignee: Shenzhen Dechangsheng Electromechanical Decoration Engineering Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980049197

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20231130

EE01 Entry into force of recordation of patent licensing contract
EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20210625

Assignee: Shenzhen Jinchengyu Decoration Engineering Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980050232

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20231205

Application publication date: 20210625

Assignee: Shenzhen Weitai Building Materials Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980049901

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20231204

Application publication date: 20210625

Assignee: Shenzhen Yajun Decoration Design Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980049899

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20231204

Application publication date: 20210625

Assignee: Shenzhen Yijia Construction Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980049897

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20231204

Application publication date: 20210625

Assignee: Shenzhen Yongji Construction Engineering Inspection Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980049891

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20231204

Application publication date: 20210625

Assignee: Zhenfeng Decoration Design Engineering (Shenzhen) Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980049887

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20231204

EE01 Entry into force of recordation of patent licensing contract
EE01 Entry into force of recordation of patent licensing contract
EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20210625

Assignee: Shenzhen everything Safety Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980050514

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20231207

EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20210625

Assignee: Shenzhen Yangxin Decoration Engineering Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980052132

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20231213

EE01 Entry into force of recordation of patent licensing contract
EE01 Entry into force of recordation of patent licensing contract
EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20210625

Assignee: AVIC intelligent construction (Shenzhen) Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980054566

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20231228

EE01 Entry into force of recordation of patent licensing contract
EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20210625

Assignee: SHENZHEN GENERAL BARCODE'S TECHNOLOGY DEVELOPMENT CENTER

Assignor: SHENZHEN University

Contract record no.: X2024980000040

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20240103

Application publication date: 20210625

Assignee: Shenzhen Subangbo Intelligent Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2024980000038

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20240103

Application publication date: 20210625

Assignee: Shenzhen Deep Sea Blue Ocean Technology Service Center

Assignor: SHENZHEN University

Contract record no.: X2024980000036

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20240104

EE01 Entry into force of recordation of patent licensing contract
EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20210625

Assignee: Luoding Zhongda Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2024980000187

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20240105

EE01 Entry into force of recordation of patent licensing contract
EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20210625

Assignee: SHENZHEN HONGHUI INDUSTRIAL Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2024980000463

Denomination of invention: Analysis methods, devices, and computer storage media for field of view relationships

Granted publication date: 20230428

License type: Common License

Record date: 20240110

CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20230428

CF01 Termination of patent right due to non-payment of annual fee