检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王新文[1] 刘晴 杜婷婷 WANG Xin-wen;LIU Qing;DU Ting-ting(College of Architecture,Xian Univ.of Arch.&Tech.,Xi'an 710055,China)
机构地区:[1]西安建筑科技大学建筑学院,陕西西安710055
出 处:《西安建筑科技大学学报(社会科学版)》2023年第5期29-36,共8页Journal of Xi'an University of Architecture & Technology(Social Science Edition)
基 金:国家社科基金项目“国家考古遗址公园文化效能评估与价值提升策略研究”(23BKG039)。
摘 要:当前大遗址展示存在空间记忆感流失、展示空间缺乏联系性、观众体验感差等问题,亟待寻求新的理论体系以提供解决问题的思路与方法。基于空间叙事理论逻辑性、整体性和弹性规划方法动态性、灵活性的内涵特征,探讨空间叙事视角下大遗址展示的弹性规划策略,架构以“展示问题识别-解决方法研究-弹性策略提出”为逻辑主线的研究框架。以统万城遗址展示为具体案例,将理论策略应用于实践,从叙事载体确定、叙事主题与线索梳理、叙事结构搭建、叙事体验设计四个方面探索空间叙事弹性展示方法,以期为我国大遗址展示规划提供更加丰富的视角和方法。Currently,there are some problems in the exhibition of great sites,such as loss of spatial memory,lack of connectivity in the display space and poorer audience experience.There is a urgent need to seek a new theoretical system that would provides ideas and methods for addressing these issues.Based on the logic and integrity of spatial narrative theory and the dynamic and flexible connotation of flexible planning methods as well,this paper discusses the flexible planning strategy of great sites exhibition in light of spatial narrative and establishes a research framework with the main logical line of “problem identification-solution research-flexible strategy proposal”.Finally,taking the exhibition of the Tongwancheng Site as a specific case and applying the theoretical strategy in practice,the paper explores the flexible display method based on spatial narrative in four aspects of determining the narrative carrier,sorting out the narrative theme and clues,building the narrative structure,and designing the narrative experience,with a view to providing a richer perspective and method for the exhibition planning of great sites in China.
分 类 号:K878[历史地理—考古学及博物馆学] TP391.9[历史地理—历史学]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49