2024-12-16 22:43:37 +01:00
|
|
|
|
|
|
|
|
|
from math import *
|
|
|
|
|
import numpy as np
|
|
|
|
|
import sys
|
|
|
|
|
import json
|
|
|
|
|
|
2024-12-17 03:22:16 +01:00
|
|
|
|
from tqdm import tqdm, trange
|
|
|
|
|
|
2024-12-16 22:43:37 +01:00
|
|
|
|
|
|
|
|
|
EPS = sys.float_info.epsilon
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
class Triangle:
|
|
|
|
|
|
|
|
|
|
def __init__(self, v1, v2, v3):
|
|
|
|
|
# Vertices
|
|
|
|
|
self.v1 = v1
|
|
|
|
|
self.v2 = v2
|
|
|
|
|
self.v3 = v3
|
2024-12-17 00:30:29 +01:00
|
|
|
|
# Sort triangle vertices so that so that the normal points "outward"
|
|
|
|
|
if np.dot(self.v1, np.cross(self.v2 - self.v1, self.v3 - self.v1)) < 0:
|
|
|
|
|
self.v3, self.v2 = self.v2, self.v3
|
2024-12-16 22:43:37 +01:00
|
|
|
|
# Edges of the origin vertex and their L2 norms
|
2024-12-17 00:30:29 +01:00
|
|
|
|
self.e1 = self.v2 - self.v1
|
|
|
|
|
self.e2 = self.v3 - self.v1
|
2024-12-16 22:43:37 +01:00
|
|
|
|
self.e1n = np.linalg.norm(self.e1)
|
|
|
|
|
self.e2n = np.linalg.norm(self.e2)
|
|
|
|
|
# Normal vector of the triangle's plane
|
|
|
|
|
self.n = np.cross(self.e1 / self.e1n, self.e2 / self.e2n)
|
2024-12-17 00:30:29 +01:00
|
|
|
|
self.n = self.n / np.linalg.norm(self.n)
|
2024-12-16 22:43:37 +01:00
|
|
|
|
# The vertex coordinates in plane coordinates
|
|
|
|
|
self.v1p = self.plane_coords(self.v1)
|
|
|
|
|
self.v2p = self.plane_coords(self.v2)
|
|
|
|
|
self.v3p = self.plane_coords(self.v3)
|
|
|
|
|
|
|
|
|
|
def intersect(self, ray):
|
2024-12-17 03:22:16 +01:00
|
|
|
|
'''
|
|
|
|
|
:param ray: numpy.array(3) Ray cast from [0, 0, 0]
|
|
|
|
|
:return: A tuple of [bool, Optional[numpy.array(3)]]:
|
|
|
|
|
The first component is True if the ray intersects the triangle, False otherwise.
|
|
|
|
|
The second component marks the intersection of the triangle's plane (even if outside the triangle), or
|
|
|
|
|
None if the ray does not intersect the plane at all.
|
|
|
|
|
'''
|
2024-12-16 22:43:37 +01:00
|
|
|
|
# https://en.wikipedia.org/wiki/Möller–Trumbore_intersection_algorithm
|
|
|
|
|
ray_cross_e2 = np.cross(ray, self.e2)
|
|
|
|
|
dot = np.dot(self.e1, ray_cross_e2)
|
|
|
|
|
if abs(dot) < EPS:
|
2024-12-17 03:22:16 +01:00
|
|
|
|
return False, None
|
2024-12-16 22:43:37 +01:00
|
|
|
|
s = -self.v1
|
|
|
|
|
u = np.dot(s, ray_cross_e2) / dot
|
|
|
|
|
s_cross_e1 = np.cross(s, self.e1)
|
|
|
|
|
v = np.dot(ray, s_cross_e1) / dot
|
|
|
|
|
t = np.dot(self.e2, s_cross_e1) / dot
|
2024-12-17 03:22:16 +01:00
|
|
|
|
if (u < 0 and abs(u) > EPS) or (u > 1 and abs(u - 1) > EPS):
|
|
|
|
|
return False, ray * t
|
|
|
|
|
if (v < 0 and abs(v) > EPS) or (u + v > 1 and abs(u + v - 1) > EPS):
|
|
|
|
|
return False, ray * t
|
2024-12-16 22:43:37 +01:00
|
|
|
|
if t <= EPS:
|
2024-12-17 03:22:16 +01:00
|
|
|
|
return False, None
|
|
|
|
|
return True, ray * t
|
2024-12-16 22:43:37 +01:00
|
|
|
|
|
|
|
|
|
def plane_coords(self, v):
|
2024-12-17 00:14:18 +01:00
|
|
|
|
u = np.dot(self.e1 / self.e1n, v - self.v1)
|
2024-12-16 22:43:37 +01:00
|
|
|
|
n = np.cross(self.n, self.e1 / self.e1n)
|
2024-12-17 00:14:18 +01:00
|
|
|
|
v = -np.dot(n, v - self.v1)
|
2024-12-16 22:43:37 +01:00
|
|
|
|
return np.array([u, v])
|
|
|
|
|
|
|
|
|
|
|
2024-12-17 03:22:16 +01:00
|
|
|
|
class Face:
|
|
|
|
|
|
|
|
|
|
def __init__(self, vs):
|
|
|
|
|
self.vertices = vs
|
|
|
|
|
self.tris = []
|
|
|
|
|
for i in range(1, len(vs)-1):
|
|
|
|
|
self.tris.append(Triangle(vs[0], vs[i], vs[i+1]))
|
|
|
|
|
self.plane_coords = [self.tris[0].plane_coords(v) for v in self.vertices]
|
|
|
|
|
|
|
|
|
|
|
2024-12-16 22:43:37 +01:00
|
|
|
|
def convert_to_cartesian(lon, lat):
|
|
|
|
|
x = cos(lon*pi/180)
|
|
|
|
|
y = sin(lon*pi/180)
|
|
|
|
|
z = tan(lat*pi/180)
|
|
|
|
|
mag = sqrt(x**2 + y**2 + z**2)
|
|
|
|
|
return np.array([x/mag, y/mag, z/mag])
|
|
|
|
|
|
|
|
|
|
|
2024-12-17 03:22:16 +01:00
|
|
|
|
def map_poly(tri, poly, ref=None):
|
|
|
|
|
if ref is None:
|
|
|
|
|
ref = tri
|
2024-12-16 22:43:37 +01:00
|
|
|
|
p0 = convert_to_cartesian(*poly[0])
|
2024-12-17 03:22:16 +01:00
|
|
|
|
p0b, p0i = tri.intersect(p0)
|
2024-12-16 22:43:37 +01:00
|
|
|
|
mapped = []
|
2024-12-17 00:14:18 +01:00
|
|
|
|
new = True
|
2024-12-16 22:43:37 +01:00
|
|
|
|
for i in range(1, len(poly)):
|
|
|
|
|
p1 = convert_to_cartesian(*poly[i])
|
2024-12-17 03:22:16 +01:00
|
|
|
|
p1b, p1i = tri.intersect(p1)
|
|
|
|
|
if p0b or p1b and p0i is not None and p1i is not None:
|
2024-12-17 00:14:18 +01:00
|
|
|
|
if new:
|
2024-12-17 03:22:16 +01:00
|
|
|
|
mapped.append([ref.plane_coords(p0i), ref.plane_coords(p1i)])
|
2024-12-17 00:14:18 +01:00
|
|
|
|
new = False
|
|
|
|
|
else:
|
2024-12-17 03:22:16 +01:00
|
|
|
|
mapped[-1].append(ref.plane_coords(p1i))
|
2024-12-17 00:14:18 +01:00
|
|
|
|
else:
|
|
|
|
|
new = True
|
2024-12-16 22:43:37 +01:00
|
|
|
|
p0 = p1
|
|
|
|
|
p0i = p1i
|
2024-12-17 03:22:16 +01:00
|
|
|
|
p0b = p1b
|
2024-12-16 22:43:37 +01:00
|
|
|
|
return mapped
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
if __name__ == '__main__':
|
2024-12-17 03:22:16 +01:00
|
|
|
|
fs = [Face([a, b, c, d]) for a, b, c, d in [
|
|
|
|
|
(np.array([1,1,1]), np.array([-1,1,1]), np.array([-1,-1,1]), np.array([1,-1,1])), # top
|
|
|
|
|
(np.array([1,1,-1]), np.array([-1,1,-1]), np.array([-1,-1,-1]), np.array([1,-1,-1])), # bottom
|
|
|
|
|
(np.array([-1,-1,-1]), np.array([-1,1,-1]), np.array([-1,1,1]), np.array([-1,-1,1])), # left
|
|
|
|
|
(np.array([1,-1,-1]), np.array([1,1,-1]), np.array([1,1,1]), np.array([1,-1,1])), # right
|
|
|
|
|
(np.array([-1,-1,-1]), np.array([1,-1,-1]), np.array([1,-1,1]), np.array([-1,-1,1])), # front
|
|
|
|
|
(np.array([-1,1,-1]), np.array([1,1,-1]), np.array([1,1,1]), np.array([-1,1,1])), # back
|
|
|
|
|
]]
|
2024-12-17 00:14:18 +01:00
|
|
|
|
with open('countries.geojson', 'r') as f:
|
2024-12-16 22:43:37 +01:00
|
|
|
|
j = json.load(f)
|
2024-12-17 03:22:16 +01:00
|
|
|
|
|
|
|
|
|
for i, face in tqdm(list(enumerate(fs)), desc='Faces '):
|
|
|
|
|
countries = {}
|
|
|
|
|
for t in face.tris:
|
|
|
|
|
for f in tqdm(j['features'], desc='Features', total=len(face.tris)*len(j['features'])):
|
|
|
|
|
cc = f['properties']['ADMIN']
|
|
|
|
|
if f['geometry']['type'] == 'MultiPolygon':
|
|
|
|
|
for poly in f['geometry']['coordinates']:
|
|
|
|
|
countries.setdefault(cc, []).extend(map_poly(t, poly[0], face.tris[0]))
|
|
|
|
|
elif f['geometry']['type'] == 'Polygon':
|
|
|
|
|
countries.setdefault(cc, []).extend(map_poly(t, f['geometry']['coordinates'][0], face.tris[0]))
|
|
|
|
|
minx = min(v[0] for v in face.plane_coords)
|
|
|
|
|
miny = min(v[1] for v in face.plane_coords)
|
|
|
|
|
maxx = max(v[0] for v in face.plane_coords)
|
|
|
|
|
maxy = max(v[1] for v in face.plane_coords)
|
|
|
|
|
w = maxx - minx
|
|
|
|
|
h = maxy - miny
|
|
|
|
|
with open(f'face{i}.svg', 'w') as svg:
|
|
|
|
|
svg.write(f'<svg xmlns="http://www.w3.org/2000/svg" viewBox="{minx} {miny} {w} {h}" width="{w}" height="{h}" id="face{i}">\n')
|
|
|
|
|
svg.write(f' <g id="cut">\n <path id="outline" fill="none" stroke="black" stroke-width="0.01" d="M {face.plane_coords[0][0]} {face.plane_coords[0][1]}')
|
|
|
|
|
for v in face.plane_coords[1:]:
|
|
|
|
|
svg.write(f' L {v[0]} {v[1]}')
|
|
|
|
|
svg.write(' Z" />\n </g>\n <g id="engrave">\n')
|
|
|
|
|
for c, l in countries.items():
|
|
|
|
|
if l:
|
|
|
|
|
svg.write(f' <g id="{c}">\n')
|
|
|
|
|
for ls in l:
|
|
|
|
|
svg.write(f' <path fill="none" stroke="red" stroke-width="0.01" d="M {ls[0][0]} {ls[0][1]}')
|
|
|
|
|
for x, y in ls[1:]:
|
|
|
|
|
svg.write(f' L {x} {y}')
|
|
|
|
|
svg.write('" />\n')
|
|
|
|
|
svg.write(' </g>\n')
|
|
|
|
|
svg.write(' </g>\n</svg>\n')
|