An attempt at refined edge matching for automated puzzle solving
نویسنده
چکیده
The purpose of this project was to look into useful methods for solving the problem of putting puzzle pieces together using a curve describing their edges. A hierarchical approximation scheme for edge segments is presented and an optimization method for finding the best fit of two segments is developed and tested.
منابع مشابه
A Global Approach for Solving Edge-Matching Puzzles
We consider apictorial edge-matching puzzles, in which the goal is to arrange a collection of puzzle pieces with colored edges so that the colors match along the edges of adjacent pieces. We devise an algebraic representation for this problem and provide conditions under which it exactly characterizes a puzzle. Using the new representation, we recast the combinatorial, discrete problem of solvi...
متن کاملScientific Puzzle Solving: Current Techniques and Applications
An automated assembling of shredded/torn documents (2D) or broken pottery (3D) will support philologists, archaeologists and forensic experts. Especially if the amount of fragments is large (up to 1000), the compilation will not be feasible for a human puzzle solver due to cost and time. Approaches to solve the task of fragmented objects or puzzles can be divided into shape based matching techn...
متن کاملA two phase hyper-heuristic approach for solving the Eternity II puzzle
In this paper we introduce a two phase hyper-heuristic search method for solving the Eternity II puzzle. Eternity II is a challenging money prized edge matching puzzle. Solving the puzzle has been shown to be NP-complete [2]. Hyper-heuristics [1] are a recent trend in heuristic algorithms. They tend to be more general methods than meta-heuristics for solving optimization problems. Hyper-heurist...
متن کاملAnt Colony Algorithm for the Single Loop Routing Problem
In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...
متن کاملAnt Colony Algorithm for the Single Loop Routing Problem
In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...
متن کامل