Pub Date : 1997-06-09DOI: 10.1109/DAGSTUHL.1997.1423116
R. Mencl, H. Müller
There is a wide range of applications for which surface interpolation or approximation from scattered data points in space is important. Dependent on the field of application and the related properties of the data, many algorithms were developed in the past. This contribution gives a survey of existing algorithms, and identifies basic methods common to independently developed solutions. We distinguish surface construction based on spatial subdivision, distance functions, warping, and incremental surface growing. The systematic analysis of existing approaches leads to several interesting open questions for further research.
{"title":"Interpolation and Approximation of Surfaces from Three-Dimensional Scattered Data Points","authors":"R. Mencl, H. Müller","doi":"10.1109/DAGSTUHL.1997.1423116","DOIUrl":"https://doi.org/10.1109/DAGSTUHL.1997.1423116","url":null,"abstract":"There is a wide range of applications for which surface interpolation or approximation from scattered data points in space is important. Dependent on the field of application and the related properties of the data, many algorithms were developed in the past. This contribution gives a survey of existing algorithms, and identifies basic methods common to independently developed solutions. We distinguish surface construction based on spatial subdivision, distance functions, warping, and incremental surface growing. The systematic analysis of existing approaches leads to several interesting open questions for further research.","PeriodicalId":268314,"journal":{"name":"Scientific Visualization Conference (dagstuhl '97)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127513826","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1997-06-09DOI: 10.1109/DAGSTUHL.1997.1423126
J. J. Wijk, R. V. Liere, J. D. Mulder
The aim of computational steering is to provide researchers more insight in simulations by enabling them to change parameters on the fly and to observe the result immediately. In practice, however, the development of computational steering applications requires considerable expertise in a wide variety of disciplines. In this paper we present a computational steering environment that simplifies this task. Changes to the code are limited to adding a few procedure calls, graphical user interfaces can be defined and connected easily. The effectiveness of this approach is shown by a range of different applications.
{"title":"Bringing Computational Steering to the User","authors":"J. J. Wijk, R. V. Liere, J. D. Mulder","doi":"10.1109/DAGSTUHL.1997.1423126","DOIUrl":"https://doi.org/10.1109/DAGSTUHL.1997.1423126","url":null,"abstract":"The aim of computational steering is to provide researchers more insight in simulations by enabling them to change parameters on the fly and to observe the result immediately. In practice, however, the development of computational steering applications requires considerable expertise in a wide variety of disciplines. In this paper we present a computational steering environment that simplifies this task. Changes to the code are limited to adding a few procedure calls, graphical user interfaces can be defined and connected easily. The effectiveness of this approach is shown by a range of different applications.","PeriodicalId":268314,"journal":{"name":"Scientific Visualization Conference (dagstuhl '97)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124031737","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The Web has grown from being a global information repository into a worldwide distributed computing environment. This offers the opportunity to carry out data visualization as a Web-based application. In this paper we look at the different players involved in the creation of a Web-based visualization service, and hence build a reference model for Web-based visualization. we then use this model to identify three distinct system architectures for Web-based visualization. We illustrate each architecture with corresponding examples of visualization services.
{"title":"Visualization over the World Wide Web","authors":"K. Brodlie","doi":"10.1109/IV.1997.626485","DOIUrl":"https://doi.org/10.1109/IV.1997.626485","url":null,"abstract":"The Web has grown from being a global information repository into a worldwide distributed computing environment. This offers the opportunity to carry out data visualization as a Web-based application. In this paper we look at the different players involved in the creation of a Web-based visualization service, and hence build a reference model for Web-based visualization. we then use this model to identify three distinct system architectures for Web-based visualization. We illustrate each architecture with corresponding examples of visualization services.","PeriodicalId":268314,"journal":{"name":"Scientific Visualization Conference (dagstuhl '97)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115243232","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1997-06-09DOI: 10.1109/DAGSTUHL.1997.1423118
H. Muller
The goal of surface reconstruction is to find a surface from a given finite set of geometric sample values. In many applications, the sample values are points. But other types of samples, like curves occurring e.g. in tactile sampling by an adapted milling machine, or volume densities occurring for instance in X-ray based computer tomography, are also possible. We illuminate different aspects of the problem and give a brief survey of the work performed in the past.
{"title":"Surface Reconstruction - An Introduction","authors":"H. Muller","doi":"10.1109/DAGSTUHL.1997.1423118","DOIUrl":"https://doi.org/10.1109/DAGSTUHL.1997.1423118","url":null,"abstract":"The goal of surface reconstruction is to find a surface from a given finite set of geometric sample values. In many applications, the sample values are points. But other types of samples, like curves occurring e.g. in tactile sampling by an adapted milling machine, or volume densities occurring for instance in X-ray based computer tomography, are also possible. We illuminate different aspects of the problem and give a brief survey of the work performed in the past.","PeriodicalId":268314,"journal":{"name":"Scientific Visualization Conference (dagstuhl '97)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128582379","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1997-06-09DOI: 10.1109/DAGSTUHL.1997.1423111
Kwansik Kim, A. Pang
We present a new method for comparing direct volume rendering (DVR) algorithms. The motivations for this work are: the prevalence of DVR algorithms that produce slightly different images from the same data set and viewing parameters, and the limitations of existing image level comparison methods. In this paper, we describe and demonstrate the effectiveness of several ray-based metrics for data level comparison of direct volume rendering (DVR) algorithms. Unlike other papers on DVR, the focus of this paper is not on speed ups from approximations or implementations with parallel or specialized hardware, but rather on methods for comparison. However, unlike image level comparisons, where the starting point is 2D images, the main distinction of data level comparison is the use of intermediate 3D information to produce the individual pixel values during the rendering process. In addition to identifying the location and extent of differences in DVR images, these data level comparisons allow us to explain why these differences arise from different DVR algorithms. Because of the rich variety of DVR algorithms, finding a common framework for developing data level comparison metrics is one of the main challenges and contribution of this paper. In this paper, we report on how ray tracing can be used as a common framework for comparing a class of DVR algorithms.
{"title":"Ray-Based Data Level Comparisons of Direct Volume Rendering Algorithms","authors":"Kwansik Kim, A. Pang","doi":"10.1109/DAGSTUHL.1997.1423111","DOIUrl":"https://doi.org/10.1109/DAGSTUHL.1997.1423111","url":null,"abstract":"We present a new method for comparing direct volume rendering (DVR) algorithms. The motivations for this work are: the prevalence of DVR algorithms that produce slightly different images from the same data set and viewing parameters, and the limitations of existing image level comparison methods. In this paper, we describe and demonstrate the effectiveness of several ray-based metrics for data level comparison of direct volume rendering (DVR) algorithms. Unlike other papers on DVR, the focus of this paper is not on speed ups from approximations or implementations with parallel or specialized hardware, but rather on methods for comparison. However, unlike image level comparisons, where the starting point is 2D images, the main distinction of data level comparison is the use of intermediate 3D information to produce the individual pixel values during the rendering process. In addition to identifying the location and extent of differences in DVR images, these data level comparisons allow us to explain why these differences arise from different DVR algorithms. Because of the rich variety of DVR algorithms, finding a common framework for developing data level comparison metrics is one of the main challenges and contribution of this paper. In this paper, we report on how ray tracing can be used as a common framework for comparing a class of DVR algorithms.","PeriodicalId":268314,"journal":{"name":"Scientific Visualization Conference (dagstuhl '97)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134396312","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1997-06-09DOI: 10.1109/DAGSTUHL.1997.1423096
Michael Bender, A. Ebert, Hans-Christian Rodrian, R. Klein
Modern web-based Scientific Visualization applications try to overcome common limitations imposed by limited internet bandwidth, server bottlenecks or network latency. A further aspect is the desire to gain platform independence by solely using instruments which are platform independent by conception: the programming language Java, the Virtual Reality Modeling Language (VRML), or the 3D API Java3D.We present a prototype of a hybrid web-based Scientific Visualization system which makes use of the increasing computational power of modern desktop workstations and personal computers on the client side, and the superior performance provided by a powerful machine on the server side. In order to achieve high interaction rates and to balance computational load the user can dynamically assign selected tasks to his client or to the server.Within the scientific field of human modeling we have implemented a hybrid web-based toolkit for the modeling of human muscles and skin. Our application allows the on-line generation and manipulation of three-dimensional implicit muscle models in a heterogeneous network and it offers various parameters to adjust computation and response time versus rendering quality.
现代基于web的科学可视化应用程序试图克服有限的互联网带宽、服务器瓶颈或网络延迟所带来的常见限制。另一个方面是希望通过单独使用在概念上与平台无关的工具来获得平台独立性:编程语言Java、虚拟现实建模语言(VRML)或3D API Java3D。我们提出了一个基于web的混合科学可视化系统的原型，该系统在客户端利用了现代桌面工作站和个人计算机日益增长的计算能力，在服务器端利用了强大的机器提供的优越性能。为了实现高交互率和平衡计算负载，用户可以动态地将选定的任务分配给他的客户端或服务器。在人体建模的科学领域，我们已经实现了一个基于网络的混合工具包，用于人体肌肉和皮肤的建模。我们的应用程序允许在异构网络中在线生成和操作三维隐式肌肉模型，并提供各种参数来调整计算和响应时间与渲染质量。
{"title":"A Hybrid Web-Based Toolkit for Human Modeling","authors":"Michael Bender, A. Ebert, Hans-Christian Rodrian, R. Klein","doi":"10.1109/DAGSTUHL.1997.1423096","DOIUrl":"https://doi.org/10.1109/DAGSTUHL.1997.1423096","url":null,"abstract":"Modern web-based Scientific Visualization applications try to overcome common limitations imposed by limited internet bandwidth, server bottlenecks or network latency. A further aspect is the desire to gain platform independence by solely using instruments which are platform independent by conception: the programming language Java, the Virtual Reality Modeling Language (VRML), or the 3D API Java3D.We present a prototype of a hybrid web-based Scientific Visualization system which makes use of the increasing computational power of modern desktop workstations and personal computers on the client side, and the superior performance provided by a powerful machine on the server side. In order to achieve high interaction rates and to balance computational load the user can dynamically assign selected tasks to his client or to the server.Within the scientific field of human modeling we have implemented a hybrid web-based toolkit for the modeling of human muscles and skin. Our application allows the on-line generation and manipulation of three-dimensional implicit muscle models in a heterogeneous network and it offers various parameters to adjust computation and response time versus rendering quality.","PeriodicalId":268314,"journal":{"name":"Scientific Visualization Conference (dagstuhl '97)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132894154","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1997-06-09DOI: 10.1109/DAGSTUHL.1997.1423115
S. Lodha, R. Franke
This survey presents several techniques for solving variants of the following scattered data interpolation problem: given a finite set of N points in R3, find a surface that interpolates the given set of points. Problems of this variety arise in numerous areas of applications such as geometric modeling and scientific visualization. A large class of solutions exists for these problems and many excellent surveys exist as well.The focus of this survey is on presenting techniques that are relatively recent. Some discussion of two popular variants of the scattered data interpolation problem -- trivariate (or volumetric) case and surface-on-surface -- is also included.Solutions are classified into one of the five categories: piecewise polynomial or rational parametric solutions, algebraic solutions, radial basis function methods, Shepard's methods and subdivision surfaces. Discussion on parametric solutions includes global interpolation by a single polynomial, interpolants based on data dependent triangulations, piecewise linear solutions such as alpha-shapes, and interpolants on irregular mesh.Algebraic interpolants based on cubic A-patches are described. Interpolants based on radial basis functions include Hardy's multiquadrics, inverse multiquadrics and thin plate splines. Techniques for blending local solutions and natural neighbor interpolants are described as variations of Shepard's methods. Subdivision techniques include Catmull-Clark subdivision technique and its variants and extensions. A brief discussion on surface interrogation techniques and visualization techniques is also included.
{"title":"Scattered Data Techniques for Surfaces","authors":"S. Lodha, R. Franke","doi":"10.1109/DAGSTUHL.1997.1423115","DOIUrl":"https://doi.org/10.1109/DAGSTUHL.1997.1423115","url":null,"abstract":"This survey presents several techniques for solving variants of the following scattered data interpolation problem: given a finite set of N points in R3, find a surface that interpolates the given set of points. Problems of this variety arise in numerous areas of applications such as geometric modeling and scientific visualization. A large class of solutions exists for these problems and many excellent surveys exist as well.The focus of this survey is on presenting techniques that are relatively recent. Some discussion of two popular variants of the scattered data interpolation problem -- trivariate (or volumetric) case and surface-on-surface -- is also included.Solutions are classified into one of the five categories: piecewise polynomial or rational parametric solutions, algebraic solutions, radial basis function methods, Shepard's methods and subdivision surfaces. Discussion on parametric solutions includes global interpolation by a single polynomial, interpolants based on data dependent triangulations, piecewise linear solutions such as alpha-shapes, and interpolants on irregular mesh.Algebraic interpolants based on cubic A-patches are described. Interpolants based on radial basis functions include Hardy's multiquadrics, inverse multiquadrics and thin plate splines. Techniques for blending local solutions and natural neighbor interpolants are described as variations of Shepard's methods. Subdivision techniques include Catmull-Clark subdivision technique and its variants and extensions. A brief discussion on surface interrogation techniques and visualization techniques is also included.","PeriodicalId":268314,"journal":{"name":"Scientific Visualization Conference (dagstuhl '97)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125189035","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1997-06-09DOI: 10.1109/DAGSTUHL.1997.1423103
I. Fujishiro, Yuriko Takeshima
In previous reports, the concept of solid fitting has been presented as a new indirect approach to volume visualization. Solid fitting relies on a simple, but powerful geometric data model, termed interval volume, that allows one to represent a three-dimensional subvolume for which the associated scalar values lie within a specified closed interval. This paper combines the latest results obtained through the course of the solid fitting project. After reviewing the salient features of interval volume and the fundamentals of solid fitting in the first two sections, Section 3 discusses improvements to the original solid fitting algorithm so as to extract interval volumes in a topologically-consistent manner. Also, the octree-based acceleration mechanism incorporated into the algorithm is analyzed further with a complex, time-evolving, volumetric data set. Section 4 is devoted to the presentation of several representative operations related to interval volume, including focusing and measurement-coupled visualization. In addition, a candidate for the volumetric coherence measure is introduced for adaptive solid fitting and its application to multi-scalar visualization. Lastly, Section 5 summarized the paper with some remarks on a hybrid volume exploration environment, in which solid fitting plays various roles.
{"title":"Solid Fitting: Field Interval Analysis for Effective Volume Exploration","authors":"I. Fujishiro, Yuriko Takeshima","doi":"10.1109/DAGSTUHL.1997.1423103","DOIUrl":"https://doi.org/10.1109/DAGSTUHL.1997.1423103","url":null,"abstract":"In previous reports, the concept of solid fitting has been presented as a new indirect approach to volume visualization. Solid fitting relies on a simple, but powerful geometric data model, termed interval volume, that allows one to represent a three-dimensional subvolume for which the associated scalar values lie within a specified closed interval. This paper combines the latest results obtained through the course of the solid fitting project. After reviewing the salient features of interval volume and the fundamentals of solid fitting in the first two sections, Section 3 discusses improvements to the original solid fitting algorithm so as to extract interval volumes in a topologically-consistent manner. Also, the octree-based acceleration mechanism incorporated into the algorithm is analyzed further with a complex, time-evolving, volumetric data set. Section 4 is devoted to the presentation of several representative operations related to interval volume, including focusing and measurement-coupled visualization. In addition, a candidate for the volumetric coherence measure is introduced for adaptive solid fitting and its application to multi-scalar visualization. Lastly, Section 5 summarized the paper with some remarks on a hybrid volume exploration environment, in which solid fitting plays various roles.","PeriodicalId":268314,"journal":{"name":"Scientific Visualization Conference (dagstuhl '97)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131167093","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1997-06-09DOI: 10.1109/DAGSTUHL.1997.1423106
A. Hanson, E. Wernert, Stephen B. Hughes
Finding one's way through a complex virtual environment is a standard task in 3D graphics and virtual reality applications. Constrained navigation is a method that appropriately restricts the user's degrees of freedom when there is a poor match between the goal of an exploration activity, the control device, and the user's familiarity with the exploration domain. The fundamental prerequisite for the adoption of constrained navigation is that the designer can significantly improve the quality of the user's experience by choosing a predetermined parametric set of viewing parameters or algorithms. We discuss families of constrained navigation methods appropriate to desktop and immersive virtual reality applications. We illustrate the approach with a variety of examples, emphasizing the possibility of topologically nontrivial navigation spaces, and present the results of a preliminary user study.
{"title":"Constrained Navigation Environments","authors":"A. Hanson, E. Wernert, Stephen B. Hughes","doi":"10.1109/DAGSTUHL.1997.1423106","DOIUrl":"https://doi.org/10.1109/DAGSTUHL.1997.1423106","url":null,"abstract":"Finding one's way through a complex virtual environment is a standard task in 3D graphics and virtual reality applications. Constrained navigation is a method that appropriately restricts the user's degrees of freedom when there is a poor match between the goal of an exploration activity, the control device, and the user's familiarity with the exploration domain. The fundamental prerequisite for the adoption of constrained navigation is that the designer can significantly improve the quality of the user's experience by choosing a predetermined parametric set of viewing parameters or algorithms. We discuss families of constrained navigation methods appropriate to desktop and immersive virtual reality applications. We illustrate the approach with a variety of examples, emphasizing the possibility of topologically nontrivial navigation spaces, and present the results of a preliminary user study.","PeriodicalId":268314,"journal":{"name":"Scientific Visualization Conference (dagstuhl '97)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115179662","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1997-06-09DOI: 10.1109/DAGSTUHL.1997.1423128
P. C. Wong, R. Bergeron
Our work involves the establishment of a standard multiresolution data hierarchy of large scientific datasets. In additional to a conventional level-of-detail design, our model provides a meaningful localized error estimation for each level of the representation. This paper describes a computational study that examines our multiresolution data representation model and evaluates its performance using real life volume datasets. A C++ wavelet library implements the multidimensional transformations and recursive data projections. We explore the space/time tradeoffs of approximation construction within a multiresolution hierarchy for volume data.
{"title":"Performance Evaluation of Multiresolution Isosurface Rendering","authors":"P. C. Wong, R. Bergeron","doi":"10.1109/DAGSTUHL.1997.1423128","DOIUrl":"https://doi.org/10.1109/DAGSTUHL.1997.1423128","url":null,"abstract":"Our work involves the establishment of a standard multiresolution data hierarchy of large scientific datasets. In additional to a conventional level-of-detail design, our model provides a meaningful localized error estimation for each level of the representation. This paper describes a computational study that examines our multiresolution data representation model and evaluates its performance using real life volume datasets. A C++ wavelet library implements the multidimensional transformations and recursive data projections. We explore the space/time tradeoffs of approximation construction within a multiresolution hierarchy for volume data.","PeriodicalId":268314,"journal":{"name":"Scientific Visualization Conference (dagstuhl '97)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127375261","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：