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