17 search results - page 3 / 4 » Empty Monochromatic Triangles |
DM
2010
14 years 11 months ago
2010
In the online F-avoidance edge-coloring game with r colors, a graph on n vertices is generated by at each stage randomly adding a new edge. The player must color each new edge as ...
108
click to vote
GC
2007
Springer
14 years 11 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...
67
Voted
CCCG
2007
15 years 19 days ago
2007
We introduce bundle-free triangulations, that are free of large collection of triangles overlapping a circle empty of vertices. We prove that bundle-free Steiner triangulations ca...
83
Voted
COMBINATORICA
2007
14 years 11 months ago
2007
A colored graph is a complete graph in which a color has been assigned to each edge, and a colorful cycle is a cycle in which each edge has a different color. We first show that ...
RT
2004
Springer
15 years 4 months ago
2004
Springer
We present a technique that uses culling and clamping (CC) for accelerating the performance of stencil-based shadow volume computation. Our algorithm reduces the fill requirement...