query: Pathfinding with differently-sized objects on tile map
positive_passages.docid: 153441
positive_passages.text: Help me please to choose proper path-finding algorithm
negative_passages.docid: 84360
negative_passages.text: random placement of rectangles with no overlaps
negative_passages.docid: 2862
negative_passages.text: Random map generation
negative_passages.docid: 22813
negative_passages.text: Finding roots/zeros for collision detection?
negative_passages.docid: 38612
negative_passages.text: Pathfinding - A* with least turns
negative_passages.docid: 151554
negative_passages.text: IsoMetric Map draw: sort with Z-Buffer and anchor point
negative_passages.docid: 100262
negative_passages.text: Improved Van Emde Boas tree based map in Java
negative_passages.docid: 144737
negative_passages.text: Choose tile based on adjacent tiles
negative_passages.docid: 144159
negative_passages.text: Documentation on 2D space partitioning
negative_passages.docid: 132926
negative_passages.text: Bidirectional Map
negative_passages.docid: 129591
negative_passages.text: Creating a large amount of convex polygons using existing coordinates
negative_passages.docid: 50605
negative_passages.text: Extended Euclidean algorithm
negative_passages.docid: 15898
negative_passages.text: Smooth movement in a tile based game
negative_passages.docid: 15962
negative_passages.text: Exists a dedicated non-O(n²) Algorithm for avoiding to have overlapping elements?
negative_passages.docid: 115322
negative_passages.text: How can I adapt A* pathfinding to work with platformers?
negative_passages.docid: 54779
negative_passages.text: A simple algorithm for polygon intersection
negative_passages.docid: 83250
negative_passages.text: How can I find the number of the shortest paths between two points on a 2D lattice grid?