server/random_maps/room_gen_spiral.C

/*
 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
 * 
 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
 * Copyright (©) 1994,2007 Mark Wedel
 * Copyright (©) 1992,2007 Frank Tore Johansen
 * 
 * Deliantra is free software: you can redistribute it and/or modify it under
 * the terms of the Affero GNU General Public License as published by the
 * Free Software Foundation, either version 3 of the License, or (at your
 * option) any later version.
 * 
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
 * GNU General Public License for more details.
 * 
 * You should have received a copy of the Affero GNU General Public License
 * and the GNU General Public License along with this program. If not, see
 * <http://www.gnu.org/licenses/>.
 * 
 * The authors can be reached via e-mail to <support@deliantra.net>
 */

/*  The onion room generator:
Onion rooms are like this:

char **map_gen_spiral(int xsize, int ysize, int option);
*/

#include <global.h>
#include <random_map.h>

#define RANDOM_OPTIONS 0        /* Pick random options below */
#define REGULAR_SPIRAL 1        /* Regular spiral--distance increases constantly */
#define FINE_SPIRAL 2           /* uses the min. separation:  most coiling */
#define FIT_SPIRAL 4            /* scale to a rectangular region, not square */
#define MAX_SPIRAL_OPT 8        /* this should be 2x the last real option */
#include <math.h>

#ifndef MIN
# define MIN(x,y) (((x)<(y))? (x):(y))
#endif
#ifndef MAX
# define MAX(x,y) (((x)<(y))? (y):(x))
#endif

#define MINDIST 3

#define MAX_FINE .454545

extern int surround_check (char **maze, int i, int j, int xsize, int ysize);

void
map_gen_spiral (Layout maze, int option)
{
  int i, j;
  float parm = 0;
  float x = 0, y = 0;
  int ic, jc;
  float SizeX, SizeY;
  float xscale, yscale;

  /* slightly easier to fill and then cut */
  maze->clear ('#');

  int xsize = maze->w;
  int ysize = maze->h;

  ic = xsize / 2;
  jc = ysize / 2;
  SizeX = xsize / 2 - 2;
  SizeY = ysize / 2 - 2;

  /* select random options if necessary */
  if (option == 0)
    option = rmg_rndm (MAX_SPIRAL_OPT);

  /* the order in which these are evaluated matters */

  /* the following two are mutually exclusive.  
     pick one if they're both set. */
  if ((option & REGULAR_SPIRAL) && (option & FIT_SPIRAL))
    {
      /* unset REGULAR_SPIRAL half the time */
      if (rmg_rndm (2) && (option & REGULAR_SPIRAL))
        option -= REGULAR_SPIRAL;
      else
        option -= FIT_SPIRAL;
    }

  xscale = yscale = MAX_FINE;   /* fine spiral */

  /* choose the spiral pitch */
  if (!(option & FINE_SPIRAL))
    {
      float pitch = (rmg_rndm (5)) / 10. + 10. / 22.;

      xscale = yscale = pitch;
    }

  if ((option & FIT_SPIRAL) && (xsize != ysize))
    {
      if (xsize > ysize)
        xscale *= (float) xsize / (float) ysize;
      else
        yscale *= (float) ysize / (float) xsize;
    }

  if (option & REGULAR_SPIRAL)
    {
      float scale = MIN (xscale, yscale);

      xscale = yscale = scale;
    }

  /* cut out the spiral */
  while ((fabs (x) < SizeX) && (fabs (y) < SizeY))
    {
      x = parm * cos (parm) * xscale;
      y = parm * sin (parm) * yscale;
      maze[int (ic + x)][int (jc + y)] = '\0';
      parm += 0.01;
    }

  maze[int (ic + x + 0.5)][int (jc + y + 0.5)] = '<';

  /* cut out the center in a 2x2 and place the center and downexit */
  maze[ic][jc + 1] = '>';
  maze[ic][jc] = 'C';
}

/* the following function connects disjoint spirals which may
   result from the symmetrization process. */
void
connect_spirals (int xsize, int ysize, int sym, char **layout)
{
  int i, j, ic = xsize / 2, jc = ysize / 2;

  if (sym == SYMMETRY_X)
    {
      layout[ic][jc] = 0;

      /* go left from map center */
      for (i = ic - 1, j = jc; i > 0 && layout[i][j] == '#'; i--)
        layout[i][j] = 0;

      /* go right */
      for (i = ic + 1, j = jc; i < xsize - 1 && layout[i][j] == '#'; i++)
        layout[i][j] = 0;
    }

  if (sym == SYMMETRY_Y)
    {
      layout[ic][jc] = 0;

      /* go up */
      for (i = ic, j = jc - 1; j > 0 && layout[i][j] == '#'; j--)
        layout[i][j] = 0;

      /* go down */
      for (i = ic, j = jc + 1; j < ysize - 1 && layout[i][j] == '#'; j++)
        layout[i][j] = 0;
    }

  if (sym == SYMMETRY_XY)
    {
      /* go left from map center */
      layout[ic][jc / 2] = 0;
      layout[ic / 2][jc] = 0;
      layout[ic][jc / 2 + jc] = 0;
      layout[ic / 2 + ic][jc] = 0;

      for (i = ic - 1, j = jc / 2; i > 0 && layout[i][j] == '#'; i--)
        {
          layout[i][j + jc] = 0;
          layout[i][j] = 0;
        }

      /* go right */
      for (i = ic + 1, j = jc / 2; i < xsize - 1 && layout[i][j] == '#'; i++)
        {
          layout[i][j + jc] = 0;
          layout[i][j] = 0;
        }

      /* go up */
      for (i = ic / 2, j = jc - 1; j > 0 && layout[i][j] == '#'; j--)
        {
          layout[i][j] = 0;
          layout[i + ic][j] = 0;
        }

      /* go down */
      for (i = ic / 2, j = jc + 1; j < ysize - 1 && layout[i][j] == '#'; j++)
        {
          layout[i][j] = 0;
          layout[i + ic][j] = 0;
        }

    }

  /* get rid of bad doors. */
  for (i = 0; i < xsize; i++)
    for (j = 0; j < ysize; j++)
      {
        if (layout[i][j] == 'D')
          {                     /* remove bad door. */
            int si = surround_check (layout, i, j, xsize, ysize);

            if (si != 3 && si != 12)
              {
                layout[i][j] = 0;
                /* back up and recheck any nearby doors */
                i = 0;
                j = 0;
              }
          }
      }
}

Revision:	1.16
Committed:	Mon Oct 12 14:00:58 2009 UTC (14 years, 8 months ago) by root
Content type:	text/plain
Branch:	MAIN
CVS Tags:	rel-2_82, rel-2_81, rel-2_90
Changes since 1.15:	+7 -6 lines
Log Message:	clarify license
#	Content
1	/*
2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*
4	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (©) 1994,2007 Mark Wedel
6	* Copyright (©) 1992,2007 Frank Tore Johansen
7	*
8	* Deliantra is free software: you can redistribute it and/or modify it under
9	* the terms of the Affero GNU General Public License as published by the
10	* Free Software Foundation, either version 3 of the License, or (at your
11	* option) any later version.
12	*
13	* This program is distributed in the hope that it will be useful,
14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	* GNU General Public License for more details.
17	*
18	* You should have received a copy of the Affero GNU General Public License
19	* and the GNU General Public License along with this program. If not, see
20	* <http://www.gnu.org/licenses/>.
21	*
22	* The authors can be reached via e-mail to <support@deliantra.net>
23	*/
24
25	/* The onion room generator:
26	Onion rooms are like this:
27
28	char **map_gen_spiral(int xsize, int ysize, int option);
29	*/
30
31	#include <global.h>
32	#include <random_map.h>
33
34	#define RANDOM_OPTIONS 0 /* Pick random options below */
35	#define REGULAR_SPIRAL 1 /* Regular spiral--distance increases constantly */
36	#define FINE_SPIRAL 2 /* uses the min. separation: most coiling */
37	#define FIT_SPIRAL 4 /* scale to a rectangular region, not square */
38	#define MAX_SPIRAL_OPT 8 /* this should be 2x the last real option */
39	#include <math.h>
40
41	#ifndef MIN
42	# define MIN(x,y) (((x)<(y))? (x):(y))
43	#endif
44	#ifndef MAX
45	# define MAX(x,y) (((x)<(y))? (y):(x))
46	#endif
47
48	#define MINDIST 3
49
50	#define MAX_FINE .454545
51
52	extern int surround_check (char **maze, int i, int j, int xsize, int ysize);
53
54	void
55	map_gen_spiral (Layout maze, int option)
56	{
57	int i, j;
58	float parm = 0;
59	float x = 0, y = 0;
60	int ic, jc;
61	float SizeX, SizeY;
62	float xscale, yscale;
63
64	/* slightly easier to fill and then cut */
65	maze->clear ('#');
66
67	int xsize = maze->w;
68	int ysize = maze->h;
69
70	ic = xsize / 2;
71	jc = ysize / 2;
72	SizeX = xsize / 2 - 2;
73	SizeY = ysize / 2 - 2;
74
75	/* select random options if necessary */
76	if (option == 0)
77	option = rmg_rndm (MAX_SPIRAL_OPT);
78
79	/* the order in which these are evaluated matters */
80
81	/* the following two are mutually exclusive.
82	pick one if they're both set. */
83	if ((option & REGULAR_SPIRAL) && (option & FIT_SPIRAL))
84	{
85	/* unset REGULAR_SPIRAL half the time */
86	if (rmg_rndm (2) && (option & REGULAR_SPIRAL))
87	option -= REGULAR_SPIRAL;
88	else
89	option -= FIT_SPIRAL;
90	}
91
92	xscale = yscale = MAX_FINE; /* fine spiral */
93
94	/* choose the spiral pitch */
95	if (!(option & FINE_SPIRAL))
96	{
97	float pitch = (rmg_rndm (5)) / 10. + 10. / 22.;
98
99	xscale = yscale = pitch;
100	}
101
102	if ((option & FIT_SPIRAL) && (xsize != ysize))
103	{
104	if (xsize > ysize)
105	xscale *= (float) xsize / (float) ysize;
106	else
107	yscale *= (float) ysize / (float) xsize;
108	}
109
110	if (option & REGULAR_SPIRAL)
111	{
112	float scale = MIN (xscale, yscale);
113
114	xscale = yscale = scale;
115	}
116
117	/* cut out the spiral */
118	while ((fabs (x) < SizeX) && (fabs (y) < SizeY))
119	{
120	x = parm * cos (parm) * xscale;
121	y = parm * sin (parm) * yscale;
122	maze[int (ic + x)][int (jc + y)] = '\0';
123	parm += 0.01;
124	}
125
126	maze[int (ic + x + 0.5)][int (jc + y + 0.5)] = '<';
127
128	/* cut out the center in a 2x2 and place the center and downexit */
129	maze[ic][jc + 1] = '>';
130	maze[ic][jc] = 'C';
131	}
132
133	/* the following function connects disjoint spirals which may
134	result from the symmetrization process. */
135	void
136	connect_spirals (int xsize, int ysize, int sym, char **layout)
137	{
138	int i, j, ic = xsize / 2, jc = ysize / 2;
139
140	if (sym == SYMMETRY_X)
141	{
142	layout[ic][jc] = 0;
143
144	/* go left from map center */
145	for (i = ic - 1, j = jc; i > 0 && layout[i][j] == '#'; i--)
146	layout[i][j] = 0;
147
148	/* go right */
149	for (i = ic + 1, j = jc; i < xsize - 1 && layout[i][j] == '#'; i++)
150	layout[i][j] = 0;
151	}
152
153	if (sym == SYMMETRY_Y)
154	{
155	layout[ic][jc] = 0;
156
157	/* go up */
158	for (i = ic, j = jc - 1; j > 0 && layout[i][j] == '#'; j--)
159	layout[i][j] = 0;
160
161	/* go down */
162	for (i = ic, j = jc + 1; j < ysize - 1 && layout[i][j] == '#'; j++)
163	layout[i][j] = 0;
164	}
165
166	if (sym == SYMMETRY_XY)
167	{
168	/* go left from map center */
169	layout[ic][jc / 2] = 0;
170	layout[ic / 2][jc] = 0;
171	layout[ic][jc / 2 + jc] = 0;
172	layout[ic / 2 + ic][jc] = 0;
173
174	for (i = ic - 1, j = jc / 2; i > 0 && layout[i][j] == '#'; i--)
175	{
176	layout[i][j + jc] = 0;
177	layout[i][j] = 0;
178	}
179
180	/* go right */
181	for (i = ic + 1, j = jc / 2; i < xsize - 1 && layout[i][j] == '#'; i++)
182	{
183	layout[i][j + jc] = 0;
184	layout[i][j] = 0;
185	}
186
187	/* go up */
188	for (i = ic / 2, j = jc - 1; j > 0 && layout[i][j] == '#'; j--)
189	{
190	layout[i][j] = 0;
191	layout[i + ic][j] = 0;
192	}
193
194	/* go down */
195	for (i = ic / 2, j = jc + 1; j < ysize - 1 && layout[i][j] == '#'; j++)
196	{
197	layout[i][j] = 0;
198	layout[i + ic][j] = 0;
199	}
200
201	}
202
203	/* get rid of bad doors. */
204	for (i = 0; i < xsize; i++)
205	for (j = 0; j < ysize; j++)
206	{
207	if (layout[i][j] == 'D')
208	{ /* remove bad door. */
209	int si = surround_check (layout, i, j, xsize, ysize);
210
211	if (si != 3 && si != 12)
212	{
213	layout[i][j] = 0;
214	/* back up and recheck any nearby doors */
215	i = 0;
216	j = 0;
217	}
218	}
219	}
220	}
221