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

  • 相关阅读:
    从源码解读Spring如何解决bean循环依赖
    前后端分离下用jwt做用户认证
    断点调试获取程序当前位置的运行结果
    Win10安装MySQL8压缩包版
    IDEA实用快捷键推荐
    多平台博客发布工具OpenWrite的使用
    Tomcat部署多个war包
    从储值卡(会员卡)充值业务看分布式事务的设计
    再谈 PHP 未来之路
    Swoole 实战:MySQL 查询器的实现(协程连接池版)
  • 原文地址:https://www.cnblogs.com/wanghao-boke/p/13019611.html
Copyright © 2011-2022 走看看