By Topic

A semantic database approach for tilings

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Prabhakaran, N. ; Sch. of Comput. Sci., Florida Int. Univ., Miami, FL, USA ; Tal, D. ; Lenart, M.

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

Published in:

Databases, Parallel Architectures and Their Applications,. PARBASE-90, International Conference on

Date of Conference:

7-9 Mar 1990