Last 10More on the Google App Engine
Sunday, April 13 2008 Some thoughts on the Google Web App Engine Tuesday, April 8 2008 Web 2.0: Marketing & Technology - Social Networking model Monday, March 31 2008 IP-address reverse lookup: Who's behind an IP address? Tuesday, March 25 2008 Best Austin Jobs Monday, February 11 2008 A fun SEO service SPAM Wednesday, September 5 2007 Do you Wilf? Thursday, August 9 2007 Is web evolution accelerating? Saturday, August 4 2007 Web experiment one. Any takers? Saturday, July 28 2007 The narrowing tip. Did I miss anything? Wednesday, July 11 2007 ArchivesOther goodies |
Sunday, March 25. 2007Web 2.0 tag clouds funTrackbacks
Trackback specific URI for this entry
No Trackbacks
Comments
Display comments as
(Linear | Threaded)
Id love to see what a tag cloud would look like for my site.
Cool job, man. Travis Thanks Travis!! I've posted your cloud, see above. I hope you'll like it. If so, please tell your friends about it
I'd like to know how you arrange the words...you mention "semi-random", could explain that a bit further?
Hi Walter,
Thanks for your interest The algorithm starts with the most frequent tags (bigger font size) and goes from there to the less frequent tags (smaller). For each tag, it produces a random position, but it also makes an effort not to overlap the new text with a previous existing, already printed tag. There is a parameter defining how many retries the algorithm goes through trying to find a random position not overlapping with a previously printed tag. If no random position providing zero area intersection could be found and the maximum iterations is reached, the algorithm will pick the position which has the minimal area intersection from all the random positions it has tried out. The idea was to give it a mix of a human and random feeling, while keeping it readable at the same time. |
BestAustinJobs.comQuicksearchAbout meClick here to learn more about me. E-mail meBlogrollCategoriesLicense![]() Articles posted on this blog (excluding comments) are licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 2.5 License. |