Recently, I showed images about grouping points together to create a different kind of Voronoi diagram (see Merging Voronoi).
The case with two groups is very interesting because it splits the plane in two parts. I was first intrigued by what it would look like animated and then I imagined that if each group is associated with an image. It's possible to show parts of the first image where its group is visible and part of the second image where the second group is.
So I came up with a very simple live-wallpaper. All you need to do is select two images and let the animation do the rest. This is much more easier to use than the Weird Voronoi (Pro) with all the functions.
Here's some outputs:
(this one is the default, when you first start the live-wallpaper)
Here's the link and the QR code:
https://market.android.com/details?id=com.blogspot.widgg_research.twin
I use this blog to share (presentable) results from my research as a PhD student in computer science.
Showing posts with label plane. Show all posts
Showing posts with label plane. Show all posts
2011/07/26
A new live-wallpaper
Labels:
Android,
GLSL,
GPU,
live-wallpaper,
market,
masking images,
merged voronoi diagram,
OpenGL ES,
plane,
qr code,
voronoi
2011/07/08
merging voronoi
Here we are playing again with the Voronoi diagram (VD). We wanted to see what happen when sites are merged together (MVD, merged VD).
VD partitions the plane in cells where each of these cell represents the closest part of the plane to a particular site. So, if you have sites on a map of various fast food restaurants, the Voronoi diagram tells you which one is physically the closest to your location.
But imagine that we want to consider all restaurant from a particular chain as one entity. We want to know the influence or the domination of a particular chain.
The following images are in pair. The first one is the influence of a chain of restaurant and the second is the actual VD that everyone knows. Cells with the same color represents a chain of restaurant.
In the images, you can see some brighter points (particularly in the first two images), this is the actual location of the site (or restaurant for in our example).
And just like the VD is well known for its role in texture synthesis, we hope to find a way to use the MVD to create some interesting results.
As for the diagram itself, we don't really know what to do with it or how to interpret it. VD has a dual graph called the Delaunay Triangulation. But what would be the dual graph of MVD ? Where do we put the edges ? That's an open question.
VD partitions the plane in cells where each of these cell represents the closest part of the plane to a particular site. So, if you have sites on a map of various fast food restaurants, the Voronoi diagram tells you which one is physically the closest to your location.
But imagine that we want to consider all restaurant from a particular chain as one entity. We want to know the influence or the domination of a particular chain.
The following images are in pair. The first one is the influence of a chain of restaurant and the second is the actual VD that everyone knows. Cells with the same color represents a chain of restaurant.
In the images, you can see some brighter points (particularly in the first two images), this is the actual location of the site (or restaurant for in our example).
And just like the VD is well known for its role in texture synthesis, we hope to find a way to use the MVD to create some interesting results.
As for the diagram itself, we don't really know what to do with it or how to interpret it. VD has a dual graph called the Delaunay Triangulation. But what would be the dual graph of MVD ? Where do we put the edges ? That's an open question.
Labels:
cell,
cuda,
Delaunay Triangulation,
diagram,
domination,
DT,
dual graph,
fast food,
merged voronoi diagram,
MVD,
nvidia,
partition,
plane,
restaurant,
site,
synthesis,
texture,
VD,
voronoi diagram
Subscribe to:
Posts (Atom)









