From 1a6a8b52f7aa4e2da6f4c34a0c743c760b8cfd99 Mon Sep 17 00:00:00 2001 From: Franklin Wei Date: Sun, 20 Nov 2016 15:16:41 -0500 Subject: Port of Simon Tatham's Puzzle Collection Original revision: 5123b1bf68777ffa86e651f178046b26a87cf2d9 MIT Licensed. Some games still crash and others are unplayable due to issues with controls. Still need a "real" polygon filling algorithm. Currently builds one plugin per puzzle (about 40 in total, around 100K each on ARM), but can easily be made to build a single monolithic overlay (800K or so on ARM). The following games are at least partially broken for various reasons, and have been disabled on this commit: Cube: failed assertion with "Icosahedron" setting Keen: input issues Mines: weird stuff happens on target Palisade: input issues Solo: input issues, occasional crash on target Towers: input issues Undead: input issues Unequal: input and drawing issues (concave polys) Untangle: input issues Features left to do: - In-game help system - Figure out the weird bugs Change-Id: I7c69b6860ab115f973c8d76799502e9bb3d52368 --- apps/plugins/puzzles/penrose.h | 59 ++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 59 insertions(+) create mode 100644 apps/plugins/puzzles/penrose.h (limited to 'apps/plugins/puzzles/penrose.h') diff --git a/apps/plugins/puzzles/penrose.h b/apps/plugins/puzzles/penrose.h new file mode 100644 index 0000000000..ba5ae16f2c --- /dev/null +++ b/apps/plugins/puzzles/penrose.h @@ -0,0 +1,59 @@ +/* penrose.h + * + * Penrose tiling functions. + * + * Provides an interface with which to generate Penrose tilings + * by recursive subdivision of an initial tile of choice (one of the + * four sets of two pairs kite/dart, or thin/thick rhombus). + * + * You supply a callback function and a context pointer, which is + * called with each tile in turn: you choose how many times to recurse. + */ + +#ifndef _PENROSE_H +#define _PENROSE_H + +#ifndef PHI +#define PHI 1.6180339887 +#endif + +typedef struct vector vector; + +double v_x(vector *vs, int i); +double v_y(vector *vs, int i); + +typedef struct penrose_state penrose_state; + +/* Return non-zero to clip the tree here (i.e. not recurse + * below this tile). + * + * Parameters are state, vector array, npoints, depth. + * ctx is inside state. + */ +typedef int (*tile_callback)(penrose_state *, vector *, int, int); + +struct penrose_state { + int start_size; /* initial side length */ + int max_depth; /* Recursion depth */ + + tile_callback new_tile; + void *ctx; /* for callback */ +}; + +enum { PENROSE_P2, PENROSE_P3 }; + +extern int penrose(penrose_state *state, int which, int angle); + +/* Returns the side-length of a penrose tile at recursion level + * gen, given a starting side length. */ +extern double penrose_side_length(double start_size, int depth); + +/* Returns the count of each type of tile at a given recursion depth. */ +extern void penrose_count_tiles(int gen, int *nlarge, int *nsmall); + +/* Calculate start size and recursion depth required to produce a + * width-by-height sized patch of penrose tiles with the given tilesize */ +extern void penrose_calculate_size(int which, int tilesize, int w, int h, + double *required_radius, int *start_size, int *depth); + +#endif -- cgit v1.2.3