 |
|
|
|
|
|
| |
| |
|
|
|
|
| |
| |
|
|
On 11/02/2012 5:51 PM, Robert McGregor wrote:
> Hi all,
You are going mad with this, Robert. :-D
I really like the maze with trees and the boxes too.
--
Regards
Stephen
Post a reply to this message
|
|
| |
| |
|
|
|
|
| |
| |
|
|
"Robert McGregor" <rob### [at] mcgregorfineart com> wrote:
> Here's a 100x100 unit maze (union of 60,000 boxes), also rendered with an
> orthographic camera.
Pretty cool, Robert. It passes the flood fill test ;) The solution is very
convoluted, though quite linear in the sense that it's easy to determine where
to go. The branches along the way often terminate abruptly or are bounded by the
path already taken. I might have had a problem at the very bottom if I hadn't
known that the exit was on the right wall... but don't feel bad, many of my
previous attempts had obvious solutions too (more so than yours) :)
Care to give an overview of the algorithm?
Last spring I was experimenting with mazes myself, the subject being something I
go back to from time-to-time. I was investigating the use of large point sets
and nearest neighbor searches (using Voronoi diagrams), and using POV as a major
step. The results were satisfactory, but my designs were confined to cases where
the perimeter wall was easy to define, such as circular mazes.
Sam
Post a reply to this message
|
|
| |
| |
|
|
|
|
| |
| |
|
|
"Robert McGregor" <rob### [at] mcgregorfineartcom> wrote:
> For this image I used my 100x100 unit orthographic example as an image pattern
> mask to specify target boundaries for tracing 1.3 million tree instances down
> onto a plane, assembling a huge hedge maze.
I really like this version. Is the tree a mesh, and if so, did you use a utility
to generate it? Just started playing with Arbaro yesterday. Great program, but a
bit difficult to use.
Post a reply to this message
|
|
| |
| |
|
|
|
|
| |
| |
|
|
On 11/02/12 19:15, Robert McGregor wrote:
> For this image I used my 100x100 unit orthographic example as an
> image pattern mask to specify target boundaries for tracing 1.3
> million tree instances down onto a plane, assembling a huge hedge
> maze.
The whole maze thing is impressive, but this application is awesome...
and knowing how well you do with poser characters, I was expecting to
see someone lost there. ;)
--
Jaime
Post a reply to this message
|
|
| |
| |
|
|
|
|
| |
| |
|
|
Samuel Benge wrote:
> Care to give an overview of the algorithm?
I don't know what Robert used, but generating a maze was one of the
exercises in the introduction to computer science course I took way
back when I was young ;) There we were to apply a strategy called
union-find, a general way to manage disjoint partitions of sets.
The application here was to imagine a grid where each tile could
either be free or filled with a wall, and start out with a with a
"maze" consisting of completely disconnected rooms (or, in the
language of the data structure, one-element subsets).
######...
# # #
######...
# # #
######...
...
You can then randomly merge two rooms by removing a common wall,
if available. In the union-find structure they are replaced by a
two-element subset, so that basically manages the list of already
connected component. Repeat the process until only one subset is
left (this generates a maze where every two rooms are connected
by exactly one path).
Post a reply to this message
|
|
| |
| |
|
|
|
|
| |
| |
|
|
"Robert McGregor" <rob### [at] mcgregorfineartcom> wrote:
> To play with maze shadows I turned the maze boxes into "maze lamps" for this
> version. The floor also uses my original 100x100 unit orthographic example as a
> bump map.
> -------------------------------------------------
> www.McGregorFineArt.com
I hope you get stressed more often. :)
That goes to Sam and Jaime too...
Post a reply to this message
|
|
| |
| |
|
|
|
|
| |
| |
|
|
On 11-2-2012 19:23, Robert McGregor wrote:
> To play with maze shadows I turned the maze boxes into "maze lamps" for this
> version. The floor also uses my original 100x100 unit orthographic example as a
> bump map.
> -------------------------------------------------
> www.McGregorFineArt.com
You cant stop, can you? :-)
Impressive maze work indeed. Lamp mazes and tree mazes are my favourites.
Thomas
Post a reply to this message
|
|
| |
| |
|
|
|
|
| |
| |
|
|
"Samuel Benge" <stb### [at] hotmailcom> wrote:
> "Robert McGregor" <rob### [at] mcgregorfineartcom> wrote:
> > For this image I used my 100x100 unit orthographic example as an image pattern
> > mask to specify target boundaries for tracing 1.3 million tree instances down
> > onto a plane, assembling a huge hedge maze.
>
> I really like this version. Is the tree a mesh, and if so, did you use a utility
> to generate it? Just started playing with Arbaro yesterday. Great program, but a
> bit difficult to use.
Yes, it's a low-poly mesh I made in Wings3d, with image maps and image pattern
masking for the branches. I got the idea for the tree from this Wings3d video
tutorial:
http://www.pxleyes.com/video-tutorial/daz-studio/10005/Making-a-CG-Christmas-Tree.html
-------------------------------------------------
www.McGregorFineArt.com
Post a reply to this message
|
|
| |
| |
|
|
|
|
| |
| |
|
|
Stephen <mcavoys_at@aoldotcom> wrote:
> You are going mad with this, Robert. :-D
> I really like the maze with trees and the boxes too.
Thomas de Groot <tho### [at] degrootorg> wrote:
> You cant stop, can you? :-)
>
> Impressive maze work indeed. Lamp mazes and tree mazes are my favourites.
Thanks guys, I was feeling a bit out of sorts after my drive crashed last week
and I lost much of the work I'd done on my 2nd Japanese shot for TC-RTC, so I
got sidetracked on (and a bit obsessed with) mazes...
-------------------------------------------------
www.McGregorFineArt.com
Post a reply to this message
|
|
| |
| |
|
|
|
|
| |
| |
|
|
Samuel Benge wrote:
> Care to give an overview of the algorithm?
My algorithm is similar to Christian's. I start with a 2d array of cells with
all 4 walls up in each cell. Each cell is a 4D vector <x,y,z,t> representing
<N,E,S,W>. Calculate total number of cells, randomly pick entrance and exit
cells from the borders, and make the entrance cell the current cell. Keep a
tally of each cell visited.
For the current cell check neighboring cells to find any with all walls still
up. Pick one of those at random and remove the wall between them, move to that
cell make it the current one, and loop until you've visited all cells or hit a
dead end (no more neighbors with all walls up) In that case, back track until
you find some valid neighbors and continue.
I just uploaded my maze include file and a few sample scenes to p.b.s-f for
anyone that wants to have a go at it.
-------------------------------------------------
www.McGregorFineArt.com
Post a reply to this message
|
|
| |
| |
|
|
|
|
| |
