2be25ae27c
PARSER: use attoparsec instead of our own implementation
...
This also uses ByteStringS and might be faster.
2014-11-21 04:30:50 +01:00
7527e0bec3
ALGO: generalize the QuadTree folds
...
Now we traverse over all nodes (TNode, TLeaf, TNil),
not just TLeaf.
2014-11-18 00:56:24 +01:00
8d7ed598e2
DIAG: rm unused parameter
2014-11-16 17:25:58 +01:00
ea88ef84ea
Improve code prettiness
2014-11-16 16:45:51 +01:00
562fdbe26f
DIAG: filter valid points earlier
...
This saves us some code duplication.
2014-11-16 16:44:26 +01:00
8c1d54d97a
ALGO: add TODO note in PolygonIntersection about Zippers
2014-11-16 04:49:34 +01:00
62583d82a5
Improve prettiness further
2014-11-16 04:49:13 +01:00
9c7acc6dce
DIAG: improve code prettiness
2014-11-16 04:37:34 +01:00
dd9bfc530d
DIAG: fix Gif build
2014-11-16 01:42:48 +01:00
8f911247c7
DIAG: fix haddock comment
2014-11-16 01:28:20 +01:00
1dcc24064b
DIAG: improve readability
2014-11-16 01:28:20 +01:00
54d960ad20
VEC: rename functions for readability
2014-11-16 00:39:59 +01:00
84bfeb27e0
GUI: hide the tree window if a different algo is chosen
2014-11-16 00:29:07 +01:00
febb20928c
Order stuff in cabal file alphabetically
2014-11-16 00:28:11 +01:00
f3cd0fa676
Use System.FilePath.Posix instead of our own implementation
2014-11-16 00:25:17 +01:00
3f3467cc44
Refactor some function names for readability
2014-11-16 00:13:44 +01:00
bf596a5842
DIAG: add haddock comment to qt
2014-11-15 23:22:56 +01:00
98c93cf94d
DIAG: fix various warnings
2014-11-15 23:20:05 +01:00
47613494db
Update .gitignore
2014-11-15 21:40:04 +01:00
26337d437e
ALGO: expose lookupByNeighbors in QuadTree
2014-11-15 16:04:31 +01:00
e0a1c6ebba
GUI: fix window title of QuadTree window
2014-11-15 15:35:35 +01:00
60d7dca2c8
DIAG: make the current node in the tree red
2014-11-15 15:26:43 +01:00
50fc0c3d01
ALGO: add test obj to quadtree
2014-11-15 14:24:46 +01:00
0b3c7d2100
ALGO: rename wrongly named RangeSearch to QuadTree
2014-11-15 14:24:24 +01:00
333e2f54b6
Style improvements to cabal file
2014-11-15 04:06:16 +01:00
f3cabab280
Implement visualizing the quad tree in a separate window
...
This window creation still sucks a bit, we should realize it
without actually showing it.
2014-11-15 03:58:38 +01:00
5fa5afc073
ALGO: rm obsolete test array
2014-11-15 03:55:52 +01:00
3d42e7d62d
Add missing module to the Gif executable
2014-11-15 00:50:08 +01:00
75c45149d9
Rename Algorithms.RangeSearch.Core to Algorithms.RangeSearch.QuadTree
2014-11-15 00:49:44 +01:00
c964afee10
GUI: hide the quad tree path entry widget by default
2014-11-15 00:32:16 +01:00
d5741d3839
PARSER: use 'Either' from Prelude instead of custom QuadOrOrient
2014-11-14 22:58:21 +01:00
068ea04d56
ALGO: fix bug when a pointer is between multiple quads
...
We have to set a priority, otherwise a point might belong to
multiple quads (max 4 if it's in the very middle).
2014-11-14 22:45:12 +01:00
60dc8ae535
DIAG: add gifQuadPath function
2014-11-14 22:19:14 +01:00
4cc02c7dc1
DIAG: rm obsolete inlined function
2014-11-14 22:17:47 +01:00
da5b0a17f0
DIAG: clean up squares function
2014-11-14 21:29:10 +01:00
ecf203c825
DIAG: Allow drawing the square the user path points to
2014-11-14 21:28:56 +01:00
1387555de6
Update cabal file to include the Parser.PathParser module
2014-11-14 21:26:37 +01:00
534f0f9609
Add getSquareByZipper function
2014-11-14 21:26:02 +01:00
76afaae38e
ALGO: export constructors and Zipper in RangeSearch
2014-11-14 21:25:25 +01:00
af2e1b59cd
ALGO: add missing Show instances to RangeSearch
2014-11-14 21:24:14 +01:00
b9c8207981
Add PathParser
...
This allows us to parser user input in order to traverse
the QuadTree from the Algorithms.RangeSearch module.
2014-11-14 21:23:43 +01:00
53eac4fc5c
PARSER: extend the core by the string function
2014-11-14 21:20:40 +01:00
62d7c9ffcd
ALGO: implement the quad tree
2014-11-13 23:05:56 +01:00
b1280ac958
VEC: use the Square type for inRange
2014-11-13 23:04:26 +01:00
c765c63125
POLYINT: run rmdups only once
2014-10-31 17:49:08 +01:00
ea06fe4fa1
DIAGRAM: only show coordinates for intersections
2014-10-28 18:51:19 +01:00
61e0063d78
POLYINT: fix comparison for different-length polygons
2014-10-28 18:51:11 +01:00
d81b6b1cec
POLYINT: improve haddock doc
2014-10-26 14:58:43 +01:00
d56d22036c
QEX: rm unused function
2014-10-26 04:29:49 +01:00
c8914c8272
POLYINT: small refactor
...
Get predecessors and successors in the beginning instead of
figuring them out for every single point separetely.
This is still O(n), butt should be a lot quicker than the previous
approach.
2014-10-26 04:22:05 +01:00
