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 Mark Wedel
 * Copyright (©) 1992 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>
#include <rproto.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 */

#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.18
Committed:	Fri Mar 26 00:59:21 2010 UTC (14 years, 1 month ago) by root
Content type:	text/plain
Branch:	MAIN
Changes since 1.17:	+2 -2 lines
Log Message:	remove bogus 2007 copyright that was added wrongly by the script, update to affero 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 Mark Wedel
6	* Copyright (©) 1992 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	#include <rproto.h>
34
35	#define RANDOM_OPTIONS 0 /* Pick random options below */
36	#define REGULAR_SPIRAL 1 /* Regular spiral--distance increases constantly */
37	#define FINE_SPIRAL 2 /* uses the min. separation: most coiling */
38	#define FIT_SPIRAL 4 /* scale to a rectangular region, not square */
39	#define MAX_SPIRAL_OPT 8 /* this should be 2x the last real option */
40
41	#define MINDIST 3
42
43	#define MAX_FINE .454545
44
45	extern int surround_check (char **maze, int i, int j, int xsize, int ysize);
46
47	void
48	map_gen_spiral (Layout maze, int option)
49	{
50	int i, j;
51	float parm = 0;
52	float x = 0, y = 0;
53	int ic, jc;
54	float SizeX, SizeY;
55	float xscale, yscale;
56
57	/* slightly easier to fill and then cut */
58	maze->clear ('#');
59
60	int xsize = maze->w;
61	int ysize = maze->h;
62
63	ic = xsize / 2;
64	jc = ysize / 2;
65	SizeX = xsize / 2 - 2;
66	SizeY = ysize / 2 - 2;
67
68	/* select random options if necessary */
69	if (option == 0)
70	option = rmg_rndm (MAX_SPIRAL_OPT);
71
72	/* the order in which these are evaluated matters */
73
74	/* the following two are mutually exclusive.
75	pick one if they're both set. */
76	if ((option & REGULAR_SPIRAL) && (option & FIT_SPIRAL))
77	{
78	/* unset REGULAR_SPIRAL half the time */
79	if (rmg_rndm (2) && (option & REGULAR_SPIRAL))
80	option -= REGULAR_SPIRAL;
81	else
82	option -= FIT_SPIRAL;
83	}
84
85	xscale = yscale = MAX_FINE; /* fine spiral */
86
87	/* choose the spiral pitch */
88	if (!(option & FINE_SPIRAL))
89	{
90	float pitch = (rmg_rndm (5)) / 10. + 10. / 22.;
91
92	xscale = yscale = pitch;
93	}
94
95	if ((option & FIT_SPIRAL) && (xsize != ysize))
96	{
97	if (xsize > ysize)
98	xscale *= (float) xsize / (float) ysize;
99	else
100	yscale *= (float) ysize / (float) xsize;
101	}
102
103	if (option & REGULAR_SPIRAL)
104	{
105	float scale = min (xscale, yscale);
106
107	xscale = yscale = scale;
108	}
109
110	/* cut out the spiral */
111	while ((fabs (x) < SizeX) && (fabs (y) < SizeY))
112	{
113	x = parm * cos (parm) * xscale;
114	y = parm * sin (parm) * yscale;
115	maze[int (ic + x)][int (jc + y)] = '\0';
116	parm += 0.01;
117	}
118
119	maze[int (ic + x + 0.5)][int (jc + y + 0.5)] = '<';
120
121	/* cut out the center in a 2x2 and place the center and downexit */
122	maze[ic][jc + 1] = '>';
123	maze[ic][jc] = 'C';
124	}
125
126	/* the following function connects disjoint spirals which may
127	result from the symmetrization process. */
128	void
129	connect_spirals (int xsize, int ysize, int sym, char **layout)
130	{
131	int i, j, ic = xsize / 2, jc = ysize / 2;
132
133	if (sym == SYMMETRY_X)
134	{
135	layout[ic][jc] = 0;
136
137	/* go left from map center */
138	for (i = ic - 1, j = jc; i > 0 && layout[i][j] == '#'; i--)
139	layout[i][j] = 0;
140
141	/* go right */
142	for (i = ic + 1, j = jc; i < xsize - 1 && layout[i][j] == '#'; i++)
143	layout[i][j] = 0;
144	}
145
146	if (sym == SYMMETRY_Y)
147	{
148	layout[ic][jc] = 0;
149
150	/* go up */
151	for (i = ic, j = jc - 1; j > 0 && layout[i][j] == '#'; j--)
152	layout[i][j] = 0;
153
154	/* go down */
155	for (i = ic, j = jc + 1; j < ysize - 1 && layout[i][j] == '#'; j++)
156	layout[i][j] = 0;
157	}
158
159	if (sym == SYMMETRY_XY)
160	{
161	/* go left from map center */
162	layout[ic][jc / 2] = 0;
163	layout[ic / 2][jc] = 0;
164	layout[ic][jc / 2 + jc] = 0;
165	layout[ic / 2 + ic][jc] = 0;
166
167	for (i = ic - 1, j = jc / 2; i > 0 && layout[i][j] == '#'; i--)
168	{
169	layout[i][j + jc] = 0;
170	layout[i][j] = 0;
171	}
172
173	/* go right */
174	for (i = ic + 1, j = jc / 2; i < xsize - 1 && layout[i][j] == '#'; i++)
175	{
176	layout[i][j + jc] = 0;
177	layout[i][j] = 0;
178	}
179
180	/* go up */
181	for (i = ic / 2, j = jc - 1; j > 0 && layout[i][j] == '#'; j--)
182	{
183	layout[i][j] = 0;
184	layout[i + ic][j] = 0;
185	}
186
187	/* go down */
188	for (i = ic / 2, j = jc + 1; j < ysize - 1 && layout[i][j] == '#'; j++)
189	{
190	layout[i][j] = 0;
191	layout[i + ic][j] = 0;
192	}
193
194	}
195
196	/* get rid of bad doors. */
197	for (i = 0; i < xsize; i++)
198	for (j = 0; j < ysize; j++)
199	{
200	if (layout[i][j] == 'D')
201	{ /* remove bad door. */
202	int si = surround_check (layout, i, j, xsize, ysize);
203
204	if (si != 3 && si != 12)
205	{
206	layout[i][j] = 0;
207	/* back up and recheck any nearby doors */
208	i = 0;
209	j = 0;
210	}
211	}
212	}
213	}
214