Partial entity structure: a compact non-manifold boundary representation based on partial topological entities

Sang Hun Lee, Kunwoo Lee
{"title":"Partial entity structure: a compact non-manifold boundary representation based on partial topological entities","authors":"Sang Hun Lee, Kunwoo Lee","doi":"10.1145/376957.376976","DOIUrl":null,"url":null,"abstract":"Non-manifold boundary representations have gained a great deal of popularity in recent years and various representation schemes have been proposed because they allow an even wider range of objects for various applications than conventional manifold representations. However, since these schemes are mainly interested in describing sufficient adjacency relationships of topological entities, the models represented in these schemes occupy too much storage space redundantly although they are very efficient in answering queries on topological adjacency relationships. Storage requirement can arise as a crucial problem in models in which topological data is more dominant than geometric data, such as tessellated or mesh models.\nTo solve this problem, in this paper, we propose a compact non-manifold boundary representation, called the partial entity structure, which allows the reduction of the storage size to half that of the radial edge structure, which is known as a time efficient non-manifold data structure, while allowing full topological adjacency relationships to be derived without loss of efficiency. This representation contains not only the conventional primitive entities like the region, face, edge, and vertex, but also the partial topological entities such as the partial-face, partial-edge, and partial-vertex for describing non-manifold conditions at vertices, edges, and faces. In order to verify the time and storage efficiency of the partial entity structure, the time complexity of basic query procedures and the storage requirement for typical geometric models are derived and compared with those of existing schemes. Furthermore, a set of the generalized Euler operators and typical high-level modeling capabilities such as Boolean operations are also implemented to confirm that our data structure is sound and easy to be manipulated.","PeriodicalId":286112,"journal":{"name":"International Conference on Smart Media and Applications","volume":"113 3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"91","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Smart Media and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/376957.376976","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 91

Abstract

Non-manifold boundary representations have gained a great deal of popularity in recent years and various representation schemes have been proposed because they allow an even wider range of objects for various applications than conventional manifold representations. However, since these schemes are mainly interested in describing sufficient adjacency relationships of topological entities, the models represented in these schemes occupy too much storage space redundantly although they are very efficient in answering queries on topological adjacency relationships. Storage requirement can arise as a crucial problem in models in which topological data is more dominant than geometric data, such as tessellated or mesh models. To solve this problem, in this paper, we propose a compact non-manifold boundary representation, called the partial entity structure, which allows the reduction of the storage size to half that of the radial edge structure, which is known as a time efficient non-manifold data structure, while allowing full topological adjacency relationships to be derived without loss of efficiency. This representation contains not only the conventional primitive entities like the region, face, edge, and vertex, but also the partial topological entities such as the partial-face, partial-edge, and partial-vertex for describing non-manifold conditions at vertices, edges, and faces. In order to verify the time and storage efficiency of the partial entity structure, the time complexity of basic query procedures and the storage requirement for typical geometric models are derived and compared with those of existing schemes. Furthermore, a set of the generalized Euler operators and typical high-level modeling capabilities such as Boolean operations are also implemented to confirm that our data structure is sound and easy to be manipulated.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
部分实体结构:基于部分拓扑实体的紧凑非流形边界表示
近年来,非流形边界表示获得了很大的普及,并且提出了各种表示方案,因为它们比传统的流形表示允许更广泛的对象用于各种应用。然而,由于这些方案主要关注描述拓扑实体的充分邻接关系,尽管这些方案在回答拓扑邻接关系的查询方面非常有效,但它们所表示的模型占用了过多的冗余存储空间。存储需求在拓扑数据比几何数据更占主导地位的模型(如镶嵌模型或网格模型)中可能成为一个关键问题。为了解决这个问题,在本文中,我们提出了一种紧凑的非流形边界表示,称为部分实体结构,它允许将存储大小减少到径向边缘结构的一半,径向边缘结构被称为时间高效的非流形数据结构,同时允许在不损失效率的情况下导出完整的拓扑邻接关系。这种表示不仅包含传统的基本实体,如区域、面、边和顶点,而且还包含部分拓扑实体,如部分面、部分边和部分顶点,用于描述顶点、边和面处的非流形条件。为了验证部分实体结构的时间和存储效率,推导了基本查询过程的时间复杂度和典型几何模型的存储需求,并与现有方案进行了比较。此外,还实现了一组广义欧拉算子和典型的高级建模功能,如布尔运算,以确认我们的数据结构是健全的,易于操作。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Application of feature technology to modeling and dimensioning the intermediate geometry of automotive powertrain components Discrete models for geometric objects Sketch- and constraint-based design of B-spline surfaces Solving spatial basic geometric constraint configurations with locus intersection Reconstruction of feature volumes and feature suppression
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1