-
Notifications
You must be signed in to change notification settings - Fork 36
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #94 from bobmyhill/visual_center
Added option to plot at visual center of fields
- Loading branch information
Showing
4 changed files
with
252 additions
and
28 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,175 @@ | ||
""" | ||
Functions for calculating the visual center of a polygon. | ||
Taken from https://github.com/Twista/python-polylabel, | ||
Originally released under an MIT licence. | ||
""" | ||
from math import sqrt, inf | ||
import time | ||
from queue import PriorityQueue | ||
|
||
|
||
def _point_to_polygon_distance(x, y, polygon): | ||
inside = False | ||
min_dist_sq = inf | ||
|
||
for ring in polygon: | ||
b = ring[-1] | ||
for a in ring: | ||
|
||
if ((a[1] > y) != (b[1] > y) and | ||
(x < (b[0] - a[0]) * (y - a[1]) / (b[1] - a[1]) + a[0])): | ||
inside = not inside | ||
|
||
min_dist_sq = min(min_dist_sq, _get_seg_dist_sq(x, y, a, b)) | ||
b = a | ||
|
||
result = sqrt(min_dist_sq) | ||
if not inside: | ||
return -result | ||
return result | ||
|
||
|
||
def _get_seg_dist_sq(px, py, a, b): | ||
x = a[0] | ||
y = a[1] | ||
dx = b[0] - x | ||
dy = b[1] - y | ||
|
||
if dx != 0 or dy != 0: | ||
t = ((px - x) * dx + (py - y) * dy) / (dx * dx + dy * dy) | ||
|
||
if t > 1: | ||
x = b[0] | ||
y = b[1] | ||
|
||
elif t > 0: | ||
x += dx * t | ||
y += dy * t | ||
|
||
dx = px - x | ||
dy = py - y | ||
|
||
return dx * dx + dy * dy | ||
|
||
|
||
class Cell(object): | ||
def __init__(self, x, y, h, polygon): | ||
self.h = h | ||
self.y = y | ||
self.x = x | ||
self.d = _point_to_polygon_distance(x, y, polygon) | ||
self.max = self.d + self.h * sqrt(2) | ||
|
||
def __lt__(self, other): | ||
return self.max < other.max | ||
|
||
def __lte__(self, other): | ||
return self.max <= other.max | ||
|
||
def __gt__(self, other): | ||
return self.max > other.max | ||
|
||
def __gte__(self, other): | ||
return self.max >= other.max | ||
|
||
def __eq__(self, other): | ||
return self.max == other.max | ||
|
||
|
||
def _get_centroid_cell(polygon): | ||
area = 0 | ||
x = 0 | ||
y = 0 | ||
points = polygon[0] | ||
b = points[-1] # prev | ||
for a in points: | ||
f = a[0] * b[1] - b[0] * a[1] | ||
x += (a[0] + b[0]) * f | ||
y += (a[1] + b[1]) * f | ||
area += f * 3 | ||
b = a | ||
if area == 0: | ||
return Cell(points[0][0], points[0][1], 0, polygon) | ||
return Cell(x / area, y / area, 0, polygon) | ||
|
||
pass | ||
|
||
|
||
def visual_center(polygon, precision=1.0, debug=False, with_distance=False): | ||
# find bounding box | ||
first_item = polygon[0][0] | ||
min_x = first_item[0] | ||
min_y = first_item[1] | ||
max_x = first_item[0] | ||
max_y = first_item[1] | ||
for p in polygon[0]: | ||
if p[0] < min_x: | ||
min_x = p[0] | ||
if p[1] < min_y: | ||
min_y = p[1] | ||
if p[0] > max_x: | ||
max_x = p[0] | ||
if p[1] > max_y: | ||
max_y = p[1] | ||
|
||
width = max_x - min_x | ||
height = max_y - min_y | ||
cell_size = min(width, height) | ||
h = cell_size / 2.0 | ||
|
||
cell_queue = PriorityQueue() | ||
|
||
if cell_size == 0: | ||
if with_distance: | ||
return [min_x, min_y], None | ||
else: | ||
return [min_x, min_y] | ||
|
||
# cover polygon with initial cells | ||
x = min_x | ||
while x < max_x: | ||
y = min_y | ||
while y < max_y: | ||
c = Cell(x + h, y + h, h, polygon) | ||
y += cell_size | ||
cell_queue.put((-c.max, time.time(), c)) | ||
x += cell_size | ||
|
||
best_cell = _get_centroid_cell(polygon) | ||
|
||
bbox_cell = Cell(min_x + width / 2, min_y + height / 2, 0, polygon) | ||
if bbox_cell.d > best_cell.d: | ||
best_cell = bbox_cell | ||
|
||
num_of_probes = cell_queue.qsize() | ||
while not cell_queue.empty(): | ||
_, __, cell = cell_queue.get() | ||
|
||
if cell.d > best_cell.d: | ||
best_cell = cell | ||
|
||
if debug: | ||
print('found best {} after {} probes'.format( | ||
round(1e4 * cell.d) / 1e4, num_of_probes)) | ||
|
||
if cell.max - best_cell.d <= precision: | ||
continue | ||
|
||
h = cell.h / 2 | ||
c = Cell(cell.x - h, cell.y - h, h, polygon) | ||
cell_queue.put((-c.max, time.time(), c)) | ||
c = Cell(cell.x + h, cell.y - h, h, polygon) | ||
cell_queue.put((-c.max, time.time(), c)) | ||
c = Cell(cell.x - h, cell.y + h, h, polygon) | ||
cell_queue.put((-c.max, time.time(), c)) | ||
c = Cell(cell.x + h, cell.y + h, h, polygon) | ||
cell_queue.put((-c.max, time.time(), c)) | ||
num_of_probes += 4 | ||
|
||
if debug: | ||
print('num probes: {}'.format(num_of_probes)) | ||
print('best distance: {}'.format(best_cell.d)) | ||
if with_distance: | ||
return [best_cell.x, best_cell.y], best_cell.d | ||
else: | ||
return [best_cell.x, best_cell.y] |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters