16 search results - page 1 / 4 » Multiple Coverings of the Plane with Triangles |
DCG
2007
13 years 5 months ago
2007
GC
2007
Springer
13 years 5 months ago
2007
Springer
We propose a novel subdivision of the plane that consists of both convex polygons and pseudotriangles. This pseudo-convex decomposition is significantly sparser than either conve...
SODA
2004
ACM
13 years 6 months ago
2004
ACM
We present an efficient algorithm for the following problem: Given a collection T = {1, . . . , n} of n triangles in the plane, such that there exists a subset S T (unknown to us)...
COMPGEOM
2009
ACM
13 years 11 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
CEC
2007
IEEE
13 years 11 months ago
2007
IEEE
— The chaos game, in which a moving point is repeatedly averaged toward randomly selected vertices of a triangle, is one method of generating the fractal called the Sierpinski tr...