Triangular Self-Assembly

Details Triangular Self-Assembly Triangular Self-Assembly

2010-02-26

arxiv.org/abs/1002.4996v1

Computer Science

Discrete Mathematics

Scientific paper

We discuss the self-assembly system of triangular tiles instead of square tiles, in particular right triangular tiles and equilateral triangular tiles. We show that the triangular tile assembly system, either deterministic or non-deterministic, has the same power to the square tile assembly system in computation, which is Turing universal. By providing counter-examples, we show that the triangular tile assembly system and the square tile assembly system are not comparable in general. More precisely, there exists square tile assembly system S such that no triangular tile assembly system is a division of S and produces the same shape; there exists triangular tile assembly system T such that no square tile assembly system produces the same compatible shape with border glues. We also discuss the assembly of triangles by triangular tiles and obtain results similar to the assembly of squares, that is to assemble a triangular of size O(N^2), the minimal number of tiles required is in O(log N/log log N).

Affiliated with

Also associated with

No associations

Rating

Triangular Self-Assembly does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Triangular Self-Assembly, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Triangular Self-Assembly will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-289868