...
首页> 外文期刊>Journal of visualization >Streamline querying based on finite substructures
【24h】

Streamline querying based on finite substructures

机译:基于有限子结构的简化查询

获取原文
获取原文并翻译 | 示例
           

摘要

Streamline querying is one of the important research directions in flow visualization, which can be widely used in streamline clustering, feature detection, etc. And the querying accuracy is the key to this field. So this paper proposes a new querying method with higher accuracy for streamlines in 3D flow visualization than the state-of-the-art methods. We define the finite substructures which are constructed by four neighboring equidistant sampling points from the streamlines. Firstly, we propose a new uniform segmentation method to transform the streamline to substructure sets. Then, by regarding the substructure as the character' and the substructure sets as string,' we evaluate the similarity of each streamline with the edit distance of strings. Finally, we specially design an algorithm for streamline querying by control functions so as to demonstrate the effectiveness of our new method.
机译:Streamline查询是流量可视化中的重要研究方向之一,可以广泛用于Streamline聚类,功能检测等,并且查询精度是该字段的关键。因此,本文提出了一种新的查询方法,具有比最先进的方法在3D流量可视化中的精度更高的精度。我们定义由来自流线的四个相邻等距采样点构成的有限子结构。首先,我们提出了一种新的统一分段方法来将流线转换为子结构集。然后,通过将子结构视为字符'和子结构集作为字符串,'我们评估每个流线的相似性与字符串的编辑距离。最后,我们专门设计了一种通过控制功能的简化查询算法,以证明我们新方法的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号