Description: 用VC写的一个小程序，用数组代替解空间树，可以实现图用m种颜色着色的问题。-VC write a small program used to solve the spatial array to replace the tree, can achieve a map m colors coloring problems. Platform: |
Size: 13409 |
Author:蔡淑佳 |
Hits:
Description:
多边形以n, x_array, y_array形式给出，其中x_array，y_array中存放着多边形的n个顶点的x, y坐标。扫描线填色算法的基本思想是：
用水平扫描线从上到下扫描由点线段构成的多段构成的多边形。每根扫描线与多边形各边产生一系列交点。将这些交点按照x坐标进行分类，将分类后的交点成对取出，作为两个端点，以所填的色彩画水平直线。多边形被扫描完毕后，填色也就完成。
上述基本思想中，有几个问题需要解决或改善-polygon n, x_array, y_array form given, which x_array, y_array leave a polygon of n vertices x, y coordinates. Scan Line coloring algorithm is the basic idea : Scan line with the level of scanning from top to bottom line point of the multi-form polygon. Each scan-line and polygon edges in the series of intersection. Nodal according to these x coordinates for classification, the classification will be paired Retrieve intersection, as two endpoints filled with color pictures of horizontal lines. Polygon scan was completed, the coloring will be completed. These basic ideas, there are several problems to be solved or improved Platform: |
Size: 4160 |
Author:ruoyu |
Hits:
Description: 回溯法的m着色问题，用bool方阵（方阵阶数表示点数）表示两点是否邻接。结果实现出所有颜色数小于m的着色方法-retroactive law m coloring problems, bool Matrix (Matrix said the order points), whether adjacent 2:00. The results achieved in all colors of a few less than the colored m Platform: |
Size: 7351 |
Author:徐浩 |
Hits:
Description: 用VC写的一个小程序，用数组代替解空间树，可以实现图用m种颜色着色的问题。-VC write a small program used to solve the spatial array to replace the tree, can achieve a map m colors coloring problems. Platform: |
Size: 257024 |
Author:蔡淑佳 |
Hits:
Description:
多边形以n, x_array, y_array形式给出，其中x_array，y_array中存放着多边形的n个顶点的x, y坐标。扫描线填色算法的基本思想是：
用水平扫描线从上到下扫描由点线段构成的多段构成的多边形。每根扫描线与多边形各边产生一系列交点。将这些交点按照x坐标进行分类，将分类后的交点成对取出，作为两个端点，以所填的色彩画水平直线。多边形被扫描完毕后，填色也就完成。
上述基本思想中，有几个问题需要解决或改善-polygon n, x_array, y_array form given, which x_array, y_array leave a polygon of n vertices x, y coordinates. Scan Line coloring algorithm is the basic idea : Scan line with the level of scanning from top to bottom line point of the multi-form polygon. Each scan-line and polygon edges in the series of intersection. Nodal according to these x coordinates for classification, the classification will be paired Retrieve intersection, as two endpoints filled with color pictures of horizontal lines. Polygon scan was completed, the coloring will be completed. These basic ideas, there are several problems to be solved or improved Platform: |
Size: 4096 |
Author:ruoyu |
Hits:
Description: 本文首先介绍了EAN一13条码的技术特点以及条码图像辨识系统的基本组成，分析
了瓦楞纸箱条码在印刷中存在的问题。针对条码线条展宽、细化、着色不均、断条、冗
余墨迹以及条码在采集中可能出现的噪声等问题，提出了相应的数字图像处理算法和基
于图像辨识技术的条码识读与纠错方法。在此基础上，开发了相应的条码识读软件，并
展示了软件测试结果，证明了该方法的实用性。
-This paper first introduces the EAN one 13 yards, as well as the technical characteristics of the barcode image recognition system s basic components, an analysis of corrugated boxes in the printing of bar code problems. Show lines against the bar code width, thinning, uneven coloring, broken bars, redundant ink and barcode that may arise in the acquisition of noise and other issues, the corresponding digital image processing algorithms and image recognition technology based on barcode reader and error correction methods. On this basis, the development of a corresponding bar code reader software and display the results of software testing to prove the practicality of the method. Platform: |
Size: 3875840 |
Author:cy |
Hits:
Description: 用mathlab编写的经典的模拟退火应用程序，包括图着色问题，最大截问题等-Mathlab prepared to use the classic simulated annealing applications, including graph coloring problem, the largest cut-off problems Platform: |
Size: 15360 |
Author:xianyan |
Hits:
Description: 给定无向连通图G和m种不同的颜色。用这些颜色为图G的各顶点着色，每个顶点
着一种颜色。是否有一种着色法使G中每条边的2个顶点着不同颜色。这个问题是
图的m可着色判定问题。若一个图最少需要m种颜色才能使图中每条边连接的2个
顶点着不同颜色，则称这个数m为该图的色数。求一个图的色数m的问题称为图的
m可着色优化问题。
-Given an undirected connected graph G, and m kinds of different colors. With these colors for the map G, the vertex shading, each vertex
With a color. Is there a shading to G, each edge two vertices with different colors. The problem is
M can be determined graph coloring problem. If a plan requires a minimum of m kinds of color can make graph each edge connecting two
Vertices with different colors, claimed that the number of m for the chromatic number of graphs. Seeking a graph called the chromatic number of graph problems m
m can be colored optimization problem. Platform: |
Size: 10240 |
Author:lirui |
Hits:
Description: 回溯法中的积累重要问题，比如素数环，填色问题-Backtracking in the accumulation of important issues, such as prime rings, coloring problems, and so Platform: |
Size: 2048 |
Author:胡双双 |
Hits:
Description: 在管理科学、计算机科学、分子物理学、生物学、超大规模集成电路设计、代码设计、图像处理和电子工程等领域中，存在着大量的组合优化问题。例如，货郎担问题、最大截问题、0—1背包问题、图着色问题、设备布局问题以及布线问题等，这些问题至今仍未找到多项式时间算法。-In management science, computer science, molecular physics, biology, VLSI design, code design, image processing and electronic engineering and other fields, there are a large number of combinatorial optimization problems. For example, the traveling salesman problem, the maximum cut problem ,0-1 knapsack problem, graph coloring problems, equipment problems and wiring layout problems, these problems have yet to find a polynomial time algorithm. Platform: |
Size: 185344 |
Author:张浩 |
Hits:
Description: 图着色问题（Graph Coloring Problem, GCP）又称着色问题，是最著名的NP-完全问题之一。路线着色问题是图论中最著名的猜想之一。-Graph coloring problem (Graph Coloring Problem, GCP), also known as coloring problem, is the most famous NP-complete problems. Line graph coloring problem is one of the most famous conjecture. Platform: |
Size: 1024 |
Author:刘适 |
Hits:
Description: 模拟退火算法的应用很广泛，可以较高的效率求解最大截问题(Max Cut Problem)、0-1背包问题(Zero One Knapsack Problem)、图着色问题(Graph Colouring Problem)、调度问题(Scheduling Problem)等等。(Simulated annealing algorithm is widely used, can be more efficient to solve the maximum Problem Cut (Max), 0-1 knapsack problem, graph coloring problems, scheduling problems, and so on.) Platform: |
Size: 62464 |
Author:四姑娘
|
Hits:
Search - coloring problems