zoukankan      html  css  js  c++  java
  • C/C++求一个矩形不规则切片的切片区域坐标

    5 5 5 5 2
    5 5 5 5 2
    5 5 5 5 2
    3 3 3 3  

    如上图区所示,长 23 ,宽18,每个格子长宽均为 5,那么第一个小方框的的区域坐标为(0,0)(5,0)(0,5)(5,5)

    第一行最后一个小方块的坐标为(20,0)(22,0)(20,5)(22,5)

    第一列最后一个小方块的坐标为(0,15)(5,15)(0,18)(5,18)

    最右小角的小方块坐标为(20,15)(22,15)(20,18)(22,18)

    已知给出该大方块的 min_x = 0, min_y = 0, max_x = 22, max_y = 18, size = 5 ,数值都是以 double 类型给出。

    算出每个小方框的坐标

    代码如下:

    #include<cstdio>
    #include<algorithm>
    using namespace std;
    
    struct Point
    {
        double x;
        double y;
    };
    
    void print(Point *point);
    
    int main()
    {
        double min_x = 0;
        double min_y = 0;
        double max_x = 22;
        double max_y = 18;
    
        double size = 5;
    
        Point point[4];
    
        for (double i = min_y; i < max_y; i = min(max_y, i+size))
        {
            for (double j = min_x; j < max_x; j = min(max_x, j+size))
            {
                point[0].x = j;
                point[0].y = i;
    
                point[1].x = min(max_x, j+size);
                point[1].y = i;
    
                point[2].x = j;
                point[2].y = min(max_y, i+size);
    
                point[3].x = min(max_x, j+size);
                point[3].y = min(max_y, i+size);
    
                print(point);
            }
        }
    
        return 0;
    }
    
    void print(Point *point)
    {
        for (int i = 0; i < 4; i++)
        {
            printf("%f %f ", point[i].x, point[i].y);
        }
        printf("
    ");
    }

    运行结果:

    0.000000 0.000000 5.000000 0.000000 0.000000 5.000000 5.000000 5.000000
    5.000000 0.000000 10.000000 0.000000 5.000000 5.000000 10.000000 5.000000
    10.000000 0.000000 15.000000 0.000000 10.000000 5.000000 15.000000 5.000000
    15.000000 0.000000 20.000000 0.000000 15.000000 5.000000 20.000000 5.000000
    20.000000 0.000000 22.000000 0.000000 20.000000 5.000000 22.000000 5.000000
    0.000000 5.000000 5.000000 5.000000 0.000000 10.000000 5.000000 10.000000
    5.000000 5.000000 10.000000 5.000000 5.000000 10.000000 10.000000 10.000000
    10.000000 5.000000 15.000000 5.000000 10.000000 10.000000 15.000000 10.000000
    15.000000 5.000000 20.000000 5.000000 15.000000 10.000000 20.000000 10.000000
    20.000000 5.000000 22.000000 5.000000 20.000000 10.000000 22.000000 10.000000
    0.000000 10.000000 5.000000 10.000000 0.000000 15.000000 5.000000 15.000000
    5.000000 10.000000 10.000000 10.000000 5.000000 15.000000 10.000000 15.000000
    10.000000 10.000000 15.000000 10.000000 10.000000 15.000000 15.000000 15.000000
    15.000000 10.000000 20.000000 10.000000 15.000000 15.000000 20.000000 15.000000
    20.000000 10.000000 22.000000 10.000000 20.000000 15.000000 22.000000 15.000000
    0.000000 15.000000 5.000000 15.000000 0.000000 18.000000 5.000000 18.000000
    5.000000 15.000000 10.000000 15.000000 5.000000 18.000000 10.000000 18.000000
    10.000000 15.000000 15.000000 15.000000 10.000000 18.000000 15.000000 18.000000
    15.000000 15.000000 20.000000 15.000000 15.000000 18.000000 20.000000 18.000000
    20.000000 15.000000 22.000000 15.000000 20.000000 18.000000 22.000000 18.000000

  • 相关阅读:
    博客园的第一篇博客
    I-如何办好比赛
    塞特斯玛斯塔
    字典序最大的子序列
    百练POJ 1657:Distance on Chessboard
    百练POJ2750:鸡兔同笼
    HDU3790最短路径问题
    HDU 2544最短路Dijkstra算法
    快速幂【倍增+二分】
    树的高度
  • 原文地址:https://www.cnblogs.com/wanghao-boke/p/13019611.html
Copyright © 2011-2022 走看看