用于平铺的语义数据库方法

N. Prabhakaran, D. Tal, M. Lenart
{"title":"用于平铺的语义数据库方法","authors":"N. Prabhakaran, D. Tal, M. Lenart","doi":"10.1109/PARBSE.1990.77175","DOIUrl":null,"url":null,"abstract":"An effort to develop computer programs that can assist or support the design process of manufacturing products having tiling structure is described. The main concept is to have a library of generic graphic programs that generate pictures of repeating patterns independently of their applications and then to modify them according to their given design task. The problem of finding feasible tilings is complex and computationally intensive. Thus, several heuristic approaches have been proposed in the literature. An efficient approach is to store constraints and graphic patterns for all known tilings in a database and use this information to simplify the feasibility problem of a new tiling. A group of constraints specifies the criteria that bound the corresponding tiling pattern. A semantic binary model is chosen to represent the graphic patterns, constraints, and relationships among them. The choice of this model is based on its unambiguous logical representation and its efficient access to data. The authors present a logical schema design to specify the information about known tilings in the database.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"2016 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A semantic database approach for tilings\",\"authors\":\"N. Prabhakaran, D. Tal, M. Lenart\",\"doi\":\"10.1109/PARBSE.1990.77175\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An effort to develop computer programs that can assist or support the design process of manufacturing products having tiling structure is described. The main concept is to have a library of generic graphic programs that generate pictures of repeating patterns independently of their applications and then to modify them according to their given design task. The problem of finding feasible tilings is complex and computationally intensive. Thus, several heuristic approaches have been proposed in the literature. An efficient approach is to store constraints and graphic patterns for all known tilings in a database and use this information to simplify the feasibility problem of a new tiling. A group of constraints specifies the criteria that bound the corresponding tiling pattern. A semantic binary model is chosen to represent the graphic patterns, constraints, and relationships among them. The choice of this model is based on its unambiguous logical representation and its efficient access to data. The authors present a logical schema design to specify the information about known tilings in the database.<<ETX>>\",\"PeriodicalId\":389644,\"journal\":{\"name\":\"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications\",\"volume\":\"2016 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-03-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PARBSE.1990.77175\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PARBSE.1990.77175","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文描述了开发计算机程序以协助或支持具有平铺结构的制造产品的设计过程的努力。其主要概念是拥有一个通用图形程序库,这些程序独立于其应用程序生成重复图案的图片,然后根据给定的设计任务对其进行修改。寻找可行的贴图是一个复杂且计算量大的问题。因此,文献中提出了几种启发式方法。一种有效的方法是在数据库中存储所有已知平铺的约束和图形模式,并使用这些信息来简化新平铺的可行性问题。一组约束指定绑定相应平铺模式的标准。选择语义二进制模型来表示图形模式、约束和它们之间的关系。选择此模型是基于其明确的逻辑表示和对数据的有效访问。作者提出了一种逻辑模式设计来指定数据库中关于已知图层的信息。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A semantic database approach for tilings
An effort to develop computer programs that can assist or support the design process of manufacturing products having tiling structure is described. The main concept is to have a library of generic graphic programs that generate pictures of repeating patterns independently of their applications and then to modify them according to their given design task. The problem of finding feasible tilings is complex and computationally intensive. Thus, several heuristic approaches have been proposed in the literature. An efficient approach is to store constraints and graphic patterns for all known tilings in a database and use this information to simplify the feasibility problem of a new tiling. A group of constraints specifies the criteria that bound the corresponding tiling pattern. A semantic binary model is chosen to represent the graphic patterns, constraints, and relationships among them. The choice of this model is based on its unambiguous logical representation and its efficient access to data. The authors present a logical schema design to specify the information about known tilings in the database.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信