Embedding shapes without predefined parts
For a practical computer implementation of part embedding in shapes that is also true to their continuous character and the shape grammar formalism, shapes and their boundaries are handled together in composite shape and label algebras. Temporary representations of shapes, termed ‘overcomplete graphs’, comprise boundary elements of shapes and how they are assembled, and are utilized in a two-phase algorithm that systematically searches for embedded parts. The associated implementation is developed to receive user-defined constraints for an interactive search. In particular, the user-defined reference shape extends the search to nondeterministic cases.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
When requesting a correction, please mention this item's handle: RePEc:pio:envirb:v:37:y:2010:i:4:p:664-681. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Neil Hammond)
If references are entirely missing, you can add them using this form.