当前位置：网站首页>C problem of marking the position of polygons surrounded by multiple rectangles

C problem of marking the position of polygons surrounded by multiple rectangles

2022-04-23 07:54:00 【Dake mountain man】

Here's the picture 1, It is necessary to mark the serial number of each small block .

If you combine polygons , Then the graph will appear 2 The situation of , The serial number is not in the block or the arrangement is not beautiful .

Pictured 2, The serial number is not in the appropriate position .

How to draw the serial number with circle as shown in the figure above , Because there are so many points and figures , Need program drawing , solve .

in other words , The polygons composed of small rectangular blocks need to be numbered . If you combine polygons , The sequence number may not be in the block or the arrangement is not beautiful .

Translate the above problem into ： How to find the largest inscribed rectangle in an arbitrary polygon by programming ？

reference ：

Analysis of the best annotation position of polygon area information - Daokebaba http://www.doc88.com/p-0864523372688.html

Calculates the maximum rectangle in a polygon _python Maximum inscribed rectangle , The maximum inscribed rectangle of a polygon - Other code resources -CSDN download The algorithm and geometric principle of calculating the maximum rectangle in a polygon , The source code is java Written , But it's the same with other languages python Maximum inline rectangle, more download resources 、 For learning materials, please visit CSDN Download channel .https://download.csdn.net/download/rosone/4460326

The algorithm of finding the quasi maximum rectangle in the horizontal direction of an arbitrary polygon _nullpo The blog of -CSDN Blog Background: some time ago, there was a need to find out whether the point is inside the polygon , A lot of time , Now intercept the key part —— Find the largest rectangle in the horizontal direction inside an arbitrary polygon —— Let's start a blog . It's easy to find out whether the point is inside the polygon , Search a lot , But when there is a large amount of data , The algorithm must be optimized . An obvious optimization point is to find the maximum inscribed rectangle , After all, judge whether the point is in the rectangle , You only need to execute up to four judgment statements , Very fast execution ; And to judge the polygon , You need to compare with each edge , It's much slower than a rectangle , Especially doing GIS Data time , It's basically all complex polygons . The original algorithm is here ：https://www.cnblogs.com/naaovhttps://blog.csdn.net/xxig__/article/details/119838985

Polygon maximum inscribed rectangle algorithm C# java_jianlun3009 The blog of -CSDN Blog _ The maximum inscribed rectangle of a polygon Polygon.cs /* compute y intersection with an edge * first pixel completely inside * ceil function if edge is on top, floor otherwise * (+y is down) */ int yIntersect(float xi, Line2 e) { int y; .https://blog.csdn.net/jianlun3009/article/details/108473237

An algorithm for finding the similar maximum circle inside a convex polygon - Li Xiaohui - Blog Garden The copyright of the article is jointly owned by Li Xiaohui and blog park , If reprint, please indicate the source clearly ：http://www.cnblogs.com/naaoveGIS/ 1. background There must be a largest circle inside an arbitrary polygon , But if we set the condition to “ ren https://www.cnblogs.com/naaoveGIS/p/7217477.html

版权声明
本文为[Dake mountain man]所创，转载请带上原文链接，感谢
https://yzsam.com/2022/04/202204230625378529.html

边栏推荐

猜你喜欢

随机推荐