«  
  »

Googling myself with Voronoi

By alan, on August 22nd, 2009

No, this isn’t about some hot new way of using Voronoi diagrams to google myself; I’ll leave that challenge to Mario.

I was looking over the search terms that had led people to my blog today, and decided to click on “Alan Shaw” Voronoi. Among all the recent stuff, I came across some papers and articles from my pre-Flash (and pre-C++) days:

Automatic construction of polyhedral surfaces from voxel representations (1988)

Generalized map makers problem: optimal flattening of polyhedral surfaces

Applications of Computer Graphics and Image Processing to 2D and 3D Modeling of the Functional Architecture of Visual Cortex

A Numerical Solution to the Generalized Mapmaker’s Problem: Flattening Nonconvex Polyhedral Surfaces

Now to reread them after twenty years and see if they were all bullshit.

We achieved reasonable performance on a Sun-2 microprocessor system (which is roughly comparable to a VAX-750).

Uh huh.

Here’a a video by mike40033:

Uncategorized   , , ,  
«  
  »
  • http://blog.jaketastic.com jake

    Holy crud!

    You have been in the Voronoi diagram business forever!

    I need a fast as3 10 algorithm to return to me some point data for the convex polygons in a Voronoi.
    I’ve tried the Fortune algorithm implementation at:
    http://blog.controul.com/2009/05/speedy-voronoi-diagrams-in-as3flash/
    ,and I really like it, but I’m not sure I should try to derive ‘sets’ of convex polygons from the line sweep parabolas used there. I admit that I’ve only been investigating the problem for a few days, but the few solutions I’ve found are too slow, or do not return ‘sets’ of points in the right order to fill convex polygons in a Voronoi diagram in AS3..
    You have obviously solved this problem -see Mona Voronita-. If you feel like sharing some of your source, I would explode with glee like crowded, deformable, circular objects pressed together and then released!

    Thanks,

    -Jake

    P.S.
    I need to make destructible obstacles for my hobby flash game at:
    http://jaketastic.com/game/NewProject.swf
    (click ‘play’, then click ‘load test level’ then ‘WASD’ = move and SPACEBAR=shoot.)
    As you can see if you checked out the link:
    Horrible polygon breakage!
    So lousy!

    Any feedback is appreciated.

    -Jake

  • http://www.t-o-x-i-n.de/index.php/2009/08/25/allgemein/weekly-shared-items-25-august-2009/ Weekly Shared Items – 25. August, 2009 | TOXIN LABS – weblog of a german design student from wuerzburg

    [...] Googling myself with Voronoi [...]

  • alan

    Hi, Jake. Actually I’m not quite ready to share my Voronoi code. But if you take any algorithm (not necessarily Fortune’s) and implement a data structure that is able to remember and traverse the vertices associated with each site, you’ll get your polygons. I will admit that the biggest nuisance is clipping the polygons at the boundaries, so it will be easier if you choose a wraparound view!

  • http://www.quasimondo.com Mario Klingemann

    OMG – I didn’t realize that you are that OLD! ;-) I guess I have to address you with Lord Voronoi from now on.

  • alan

    Then I create thee Duke of Delaunay.

  • http://twitter.com/gfxnews gfxnews

    very nice computer game studios software i am useing this one thanks

blog comments powered by Disqus
«  
  »