Shape computations recognise parts and create new shapes through transformations. These elementary computations can be more than they seem, inducing complicated structures as a result of recognising and transforming parts. This paper introduces, what is perhaps in principle, the simplest case where the structure results from seeing embedded parts. It focusses on lines because, despite their visual simplicity, if a symbolic representation for shapes is assumed, lines embedded in lines can give rise to more complicated structures than might be intuitively expected. With reference to the combinatorial structure of words the paper presents a thorough examination of these structures. It is shown that in the case of a line embedded in a line, the resulting structure is palindromic with parts defined by line segments of two different lengths. This result highlights the disparity between visual and symbolic computation when dealing with shapes—computations that are visually elementary are often symbolically complicated.
[1]
Ramesh Krishnamurti.
The Maximal Representation of a Shape
,
1992
.
[2]
M. Schützenberger,et al.
The equation $a^M=b^Nc^P$ in a free group.
,
1962
.
[3]
Steve Garner,et al.
Evaluating an eye tracking interface for a two-dimensional sketch editor
,
2013,
Comput. Aided Des..
[4]
Djordje Krstic.
Shape decompositions and their algebras
,
2005,
Artificial Intelligence for Engineering Design, Analysis and Manufacturing.
[5]
M. Lothaire,et al.
Combinatorics on words: Frontmatter
,
1997
.
[6]
George Stiny,et al.
Shape: Talking about Seeing and Doing
,
2006
.
[7]
Scott Curland Chase,et al.
Transforming shape in design: observations from studies of sketching
,
2009
.