__init__.py 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615
  1. """
  2. Python Library to Read and Write Surface Files in Freesurfer's TriangularSurface Format
  3. compatible with Freesurfer's MRISwriteTriangularSurface()
  4. https://github.com/freesurfer/freesurfer/blob/release_6_0_0/include/mrisurf.h#L1281
  5. https://github.com/freesurfer/freesurfer/blob/release_6_0_0/utils/mrisurf.c
  6. https://raw.githubusercontent.com/freesurfer/freesurfer/release_6_0_0/utils/mrisurf.c
  7. Freesurfer
  8. https://surfer.nmr.mgh.harvard.edu/
  9. Edit Surface File
  10. >>> from freesurfer_surface import Surface, Vertex, Triangle
  11. >>>
  12. >>> surface = Surface.read_triangular('bert/surf/lh.pial'))
  13. >>>
  14. >>> vertex_a = surface.add_vertex(Vertex(0.0, 0.0, 0.0))
  15. >>> vertex_b = surface.add_vertex(Vertex(1.0, 1.0, 1.0))
  16. >>> vertex_c = surface.add_vertex(Vertex(2.0, 2.0, 2.0))
  17. >>> surface.triangles.append(Triangle((vertex_a, vertex_b, vertex_c)))
  18. >>>
  19. >>> surface.write_triangular('somewhere/else/lh.pial')
  20. List Labels in Annotation File
  21. >>> from freesurfer_surface import Annotation
  22. >>>
  23. >>> annotation = Annotation.read('bert/label/lh.aparc.annot')
  24. >>> for label in annotation.labels.values():
  25. >>> print(label.index, label.hex_color_code, label.name)
  26. Find Border of Labelled Region
  27. >>> surface = Surface.read_triangular('bert/surf/lh.pial'))
  28. >>> surface.load_annotation_file('bert/label/lh.aparc.annot')
  29. >>> region, = filter(lambda l: l.name == 'precentral',
  30. >>> annotation.labels.values())
  31. >>> print(surface.find_label_border_polygonal_chains(region))
  32. """
  33. import collections
  34. import contextlib
  35. import copy
  36. import datetime
  37. import itertools
  38. import locale
  39. import re
  40. import struct
  41. import typing
  42. import numpy
  43. try:
  44. from freesurfer_surface.version import __version__
  45. except ImportError: # ModuleNotFoundError not available in python<3.6
  46. # package is not installed
  47. __version__ = None
  48. class UnsupportedLocaleSettingError(locale.Error):
  49. pass
  50. @contextlib.contextmanager
  51. def setlocale(temporary_locale):
  52. primary_locale = locale.setlocale(locale.LC_ALL)
  53. try:
  54. yield locale.setlocale(locale.LC_ALL, temporary_locale)
  55. except locale.Error as exc:
  56. if str(exc) == "unsupported locale setting":
  57. raise UnsupportedLocaleSettingError(temporary_locale) from exc
  58. raise exc # pragma: no cover
  59. finally:
  60. locale.setlocale(locale.LC_ALL, primary_locale)
  61. class Vertex(numpy.ndarray):
  62. def __new__(cls, right: float, anterior: float, superior: float):
  63. return numpy.array((right, anterior, superior), dtype=float).view(cls)
  64. @property
  65. def right(self) -> float:
  66. return self[0]
  67. @property
  68. def anterior(self) -> float:
  69. return self[1]
  70. @property
  71. def superior(self) -> float:
  72. return self[2]
  73. @property
  74. def __dict__(self) -> typing.Dict[str, float]:
  75. return {
  76. "right": self.right,
  77. "anterior": self.anterior,
  78. "superior": self.superior,
  79. }
  80. def __format_coords(self) -> str:
  81. return ", ".join(
  82. "{}={}".format(name, getattr(self, name))
  83. for name in ["right", "anterior", "superior"]
  84. )
  85. def __repr__(self) -> str:
  86. return "{}({})".format(type(self).__name__, self.__format_coords())
  87. def distance_mm(
  88. self, others: typing.Union["Vertex", typing.Iterable["Vertex"], numpy.ndarray]
  89. ) -> numpy.ndarray:
  90. if isinstance(others, Vertex):
  91. others = others.reshape((1, 3))
  92. return numpy.linalg.norm(self - others, axis=1)
  93. class PolygonalCircuit:
  94. def __init__(self, vertex_indices: typing.Iterable[int]):
  95. self._vertex_indices = tuple(vertex_indices)
  96. assert all(isinstance(idx, int) for idx in self._vertex_indices)
  97. @property
  98. def vertex_indices(self):
  99. return self._vertex_indices
  100. def _normalize(self) -> "PolygonalCircuit":
  101. vertex_indices = collections.deque(self.vertex_indices)
  102. vertex_indices.rotate(-numpy.argmin(self.vertex_indices))
  103. if len(vertex_indices) > 2 and vertex_indices[-1] < vertex_indices[1]:
  104. vertex_indices.reverse()
  105. vertex_indices.rotate(1)
  106. return type(self)(vertex_indices)
  107. def __eq__(self, other: object) -> bool:
  108. # pylint: disable=protected-access
  109. return (
  110. isinstance(other, PolygonalCircuit)
  111. and self._normalize().vertex_indices == other._normalize().vertex_indices
  112. )
  113. def __hash__(self) -> int:
  114. # pylint: disable=protected-access
  115. return hash(self._normalize()._vertex_indices)
  116. def adjacent_vertex_indices(
  117. self, vertices_num: int = 2
  118. ) -> typing.Iterable[typing.Tuple[int]]:
  119. vertex_indices_cycle = list(
  120. itertools.islice(
  121. itertools.cycle(self.vertex_indices),
  122. 0,
  123. len(self.vertex_indices) + vertices_num - 1,
  124. )
  125. )
  126. return zip(
  127. *(
  128. itertools.islice(
  129. vertex_indices_cycle, offset, len(self.vertex_indices) + offset
  130. )
  131. for offset in range(vertices_num)
  132. )
  133. )
  134. class LineSegment(PolygonalCircuit):
  135. def __init__(self, indices: typing.Iterable[int]):
  136. super().__init__(indices)
  137. assert len(self.vertex_indices) == 2
  138. def __repr__(self) -> str:
  139. return "LineSegment(vertex_indices={})".format(self.vertex_indices)
  140. class Triangle(PolygonalCircuit):
  141. def __init__(self, indices: typing.Iterable[int]):
  142. super().__init__(indices)
  143. assert len(self.vertex_indices) == 3
  144. def __repr__(self) -> str:
  145. return "Triangle(vertex_indices={})".format(self.vertex_indices)
  146. class PolygonalChainsNotOverlapingError(ValueError):
  147. pass
  148. class PolygonalChain:
  149. def __init__(self, vertex_indices: typing.Iterable[int]):
  150. self.vertex_indices = collections.deque(
  151. vertex_indices
  152. ) # type: typing.Deque[int]
  153. def __eq__(self, other: object) -> bool:
  154. return (
  155. isinstance(other, PolygonalChain)
  156. and self.vertex_indices == other.vertex_indices
  157. )
  158. def __repr__(self) -> str:
  159. return "PolygonalChain(vertex_indices={})".format(tuple(self.vertex_indices))
  160. def connect(self, other: "PolygonalChain") -> None:
  161. if self.vertex_indices[-1] == other.vertex_indices[0]:
  162. self.vertex_indices.pop()
  163. self.vertex_indices.extend(other.vertex_indices)
  164. elif self.vertex_indices[-1] == other.vertex_indices[-1]:
  165. self.vertex_indices.pop()
  166. self.vertex_indices.extend(reversed(other.vertex_indices))
  167. elif self.vertex_indices[0] == other.vertex_indices[0]:
  168. self.vertex_indices.popleft()
  169. self.vertex_indices.extendleft(other.vertex_indices)
  170. elif self.vertex_indices[0] == other.vertex_indices[-1]:
  171. self.vertex_indices.popleft()
  172. self.vertex_indices.extendleft(reversed(other.vertex_indices))
  173. else:
  174. raise PolygonalChainsNotOverlapingError()
  175. def adjacent_vertex_indices(
  176. self, vertices_num: int = 2
  177. ) -> typing.Iterator[typing.Tuple[int, ...]]:
  178. return zip(
  179. *(
  180. itertools.islice(self.vertex_indices, offset, len(self.vertex_indices))
  181. for offset in range(vertices_num)
  182. )
  183. )
  184. def segments(self) -> typing.Iterable[LineSegment]:
  185. return map(LineSegment, self.adjacent_vertex_indices(2))
  186. class Label:
  187. # pylint: disable=too-many-arguments
  188. def __init__(
  189. self, index: int, name: str, red: int, green: int, blue: int, transparency: int
  190. ):
  191. self.index = index # type: int
  192. self.name = name # type: str
  193. self.red = red # type: int
  194. self.green = green # type: int
  195. self.blue = blue # type: int
  196. self.transparency = transparency # type: int
  197. @property
  198. def color_code(self) -> int:
  199. if self.index == 0: # unknown
  200. return 0
  201. return int.from_bytes(
  202. (self.red, self.green, self.blue, self.transparency),
  203. byteorder="little",
  204. signed=False,
  205. )
  206. @property
  207. def hex_color_code(self) -> str:
  208. return "#{:02x}{:02x}{:02x}".format(self.red, self.green, self.blue)
  209. def __str__(self) -> str:
  210. return "Label(name={}, index={}, color={})".format(
  211. self.name, self.index, self.hex_color_code
  212. )
  213. def __repr__(self) -> str:
  214. return str(self)
  215. class Annotation:
  216. # pylint: disable=too-few-public-methods
  217. _TAG_OLD_COLORTABLE = b"\0\0\0\x01"
  218. def __init__(self):
  219. self.vertex_label_index = {} # type: Dict[int, int]
  220. self.colortable_path = None # type: Optional[bytes]
  221. self.labels = {} # type: Dict[int, Label]
  222. @staticmethod
  223. def _read_label(stream: typing.BinaryIO) -> Label:
  224. index, name_length = struct.unpack(">II", stream.read(4 * 2))
  225. name = stream.read(name_length - 1).decode()
  226. assert stream.read(1) == b"\0"
  227. red, green, blue, transparency = struct.unpack(">IIII", stream.read(4 * 4))
  228. return Label(
  229. index=index,
  230. name=name,
  231. red=red,
  232. green=green,
  233. blue=blue,
  234. transparency=transparency,
  235. )
  236. def _read(self, stream: typing.BinaryIO) -> None:
  237. # https://surfer.nmr.mgh.harvard.edu/fswiki/LabelsClutsAnnotationFiles
  238. (annotations_num,) = struct.unpack(">I", stream.read(4))
  239. annotations = [
  240. struct.unpack(">II", stream.read(4 * 2)) for _ in range(annotations_num)
  241. ]
  242. assert stream.read(4) == self._TAG_OLD_COLORTABLE
  243. colortable_version, _, filename_length = struct.unpack(
  244. ">III", stream.read(4 * 3)
  245. )
  246. assert colortable_version > 0 # new version
  247. self.colortable_path = stream.read(filename_length - 1)
  248. assert stream.read(1) == b"\0"
  249. (labels_num,) = struct.unpack(">I", stream.read(4))
  250. self.labels = {
  251. label.index: label
  252. for label in (self._read_label(stream) for _ in range(labels_num))
  253. }
  254. label_index_by_color_code = {
  255. label.color_code: label.index for label in self.labels.values()
  256. }
  257. self.vertex_label_index = {
  258. vertex_index: label_index_by_color_code[color_code]
  259. for vertex_index, color_code in annotations
  260. }
  261. assert not stream.read(1)
  262. @classmethod
  263. def read(cls, annotation_file_path: str) -> "Annotation":
  264. annotation = cls()
  265. with open(annotation_file_path, "rb") as annotation_file:
  266. # pylint: disable=protected-access
  267. annotation._read(annotation_file)
  268. return annotation
  269. class Surface:
  270. # pylint: disable=too-many-instance-attributes
  271. _MAGIC_NUMBER = b"\xff\xff\xfe"
  272. _TAG_CMDLINE = b"\x00\x00\x00\x03"
  273. _TAG_OLD_SURF_GEOM = b"\x00\x00\x00\x14"
  274. _TAG_OLD_USEREALRAS = b"\x00\x00\x00\x02"
  275. _DATETIME_FORMAT = "%a %b %d %H:%M:%S %Y"
  276. def __init__(self):
  277. self.creator = None # type: Optional[bytes]
  278. self.creation_datetime = None # type: Optional[datetime.datetime]
  279. self.vertices = [] # type: List[Vertex]
  280. self.triangles = [] # type: List[Triangle]
  281. self.using_old_real_ras = False # type: bool
  282. self.volume_geometry_info = None # type: Optional[Tuple[bytes]]
  283. self.command_lines = [] # type: List[bytes]
  284. self.annotation = None # type: Optional[Annotation]
  285. @classmethod
  286. def _read_cmdlines(cls, stream: typing.BinaryIO) -> typing.Iterator[str]:
  287. while True:
  288. tag = stream.read(4)
  289. if not tag:
  290. return
  291. assert tag == cls._TAG_CMDLINE # might be TAG_GROUP_AVG_SURFACE_AREA
  292. # TAGwrite
  293. # https://github.com/freesurfer/freesurfer/blob/release_6_0_0/utils/tags.c#L94
  294. (str_length,) = struct.unpack(">Q", stream.read(8))
  295. yield stream.read(str_length - 1)
  296. assert stream.read(1) == b"\x00"
  297. def _read_triangular(self, stream: typing.BinaryIO):
  298. assert stream.read(3) == self._MAGIC_NUMBER
  299. self.creator, creation_dt_str = re.match(
  300. rb"^created by (\w+) on (.* \d{4})\n", stream.readline()
  301. ).groups()
  302. with setlocale("C"):
  303. self.creation_datetime = datetime.datetime.strptime(
  304. creation_dt_str.decode(), self._DATETIME_FORMAT
  305. )
  306. assert stream.read(1) == b"\n"
  307. # fwriteInt
  308. # https://github.com/freesurfer/freesurfer/blob/release_6_0_0/utils/fio.c#L290
  309. vertices_num, triangles_num = struct.unpack(">II", stream.read(4 * 2))
  310. self.vertices = [
  311. Vertex(*struct.unpack(">fff", stream.read(4 * 3)))
  312. for _ in range(vertices_num)
  313. ]
  314. self.triangles = [
  315. Triangle(struct.unpack(">III", stream.read(4 * 3)))
  316. for _ in range(triangles_num)
  317. ]
  318. assert all(
  319. vertex_idx < vertices_num
  320. for triangle in self.triangles
  321. for vertex_idx in triangle.vertex_indices
  322. )
  323. assert stream.read(4) == self._TAG_OLD_USEREALRAS
  324. (using_old_real_ras,) = struct.unpack(">I", stream.read(4))
  325. assert using_old_real_ras in [0, 1], using_old_real_ras
  326. self.using_old_real_ras = bool(using_old_real_ras)
  327. assert stream.read(4) == self._TAG_OLD_SURF_GEOM
  328. # writeVolGeom
  329. # https://github.com/freesurfer/freesurfer/blob/release_6_0_0/utils/transform.c#L368
  330. self.volume_geometry_info = tuple(stream.readline() for _ in range(8))
  331. self.command_lines = list(self._read_cmdlines(stream))
  332. @classmethod
  333. def read_triangular(cls, surface_file_path: str) -> "Surface":
  334. surface = cls()
  335. with open(surface_file_path, "rb") as surface_file:
  336. # pylint: disable=protected-access
  337. surface._read_triangular(surface_file)
  338. return surface
  339. @classmethod
  340. def _triangular_strftime(cls, creation_datetime: datetime.datetime) -> bytes:
  341. padded_day = "{:>2}".format(creation_datetime.day)
  342. fmt = cls._DATETIME_FORMAT.replace("%d", padded_day)
  343. with setlocale("C"):
  344. return creation_datetime.strftime(fmt).encode()
  345. def write_triangular(
  346. self,
  347. surface_file_path: str,
  348. creation_datetime: typing.Optional[datetime.datetime] = None,
  349. ):
  350. if creation_datetime is None:
  351. creation_datetime = datetime.datetime.now()
  352. with open(surface_file_path, "wb") as surface_file:
  353. surface_file.write(
  354. self._MAGIC_NUMBER
  355. + b"created by "
  356. + self.creator
  357. + b" on "
  358. + self._triangular_strftime(creation_datetime)
  359. + b"\n\n"
  360. + struct.pack(">II", len(self.vertices), len(self.triangles))
  361. )
  362. for vertex in self.vertices:
  363. surface_file.write(struct.pack(">fff", *vertex))
  364. for triangle in self.triangles:
  365. assert all(
  366. vertex_index < len(self.vertices)
  367. for vertex_index in triangle.vertex_indices
  368. )
  369. surface_file.write(struct.pack(">III", *triangle.vertex_indices))
  370. surface_file.write(
  371. self._TAG_OLD_USEREALRAS
  372. + struct.pack(">I", 1 if self.using_old_real_ras else 0)
  373. )
  374. surface_file.write(
  375. self._TAG_OLD_SURF_GEOM + b"".join(self.volume_geometry_info)
  376. )
  377. for command_line in self.command_lines:
  378. surface_file.write(
  379. self._TAG_CMDLINE
  380. + struct.pack(">Q", len(command_line) + 1)
  381. + command_line
  382. + b"\0"
  383. )
  384. def load_annotation_file(self, annotation_file_path: str) -> None:
  385. annotation = Annotation.read(annotation_file_path)
  386. assert len(annotation.vertex_label_index) <= len(self.vertices)
  387. assert max(annotation.vertex_label_index.keys()) < len(self.vertices)
  388. self.annotation = annotation
  389. def add_vertex(self, vertex: Vertex) -> int:
  390. self.vertices.append(vertex)
  391. return len(self.vertices) - 1
  392. def add_rectangle(
  393. self, vertex_indices: typing.Iterable[int]
  394. ) -> typing.Iterable[int]:
  395. vertex_indices = list(vertex_indices)
  396. if len(vertex_indices) == 3:
  397. vertex_indices.append(
  398. self.add_vertex(
  399. self.vertices[vertex_indices[0]]
  400. + self.vertices[vertex_indices[2]]
  401. - self.vertices[vertex_indices[1]]
  402. )
  403. )
  404. assert len(vertex_indices) == 4
  405. self.triangles.append(Triangle(vertex_indices[:3]))
  406. self.triangles.append(Triangle(vertex_indices[2:] + vertex_indices[:1]))
  407. def _triangle_count_by_adjacent_vertex_indices(
  408. self,
  409. ) -> typing.Dict[int, typing.Dict[int, int]]:
  410. counts = {
  411. vertex_index: collections.defaultdict(lambda: 0)
  412. for vertex_index in range(len(self.vertices))
  413. }
  414. for triangle in self.triangles:
  415. for vertex_index_pair in triangle.adjacent_vertex_indices(2):
  416. counts[vertex_index_pair[0]][vertex_index_pair[1]] += 1
  417. counts[vertex_index_pair[1]][vertex_index_pair[0]] += 1
  418. return counts
  419. def find_borders(self) -> typing.Iterator[PolygonalCircuit]:
  420. border_neighbours = {}
  421. for (
  422. vertex_index,
  423. neighbour_counts,
  424. ) in self._triangle_count_by_adjacent_vertex_indices().items():
  425. if not neighbour_counts:
  426. yield PolygonalCircuit((vertex_index,))
  427. else:
  428. neighbours = [
  429. neighbour_index
  430. for neighbour_index, counts in neighbour_counts.items()
  431. if counts != 2
  432. ]
  433. if neighbours:
  434. assert len(neighbours) % 2 == 0, (vertex_index, neighbour_counts)
  435. border_neighbours[vertex_index] = neighbours
  436. while border_neighbours:
  437. vertex_index, neighbour_indices = border_neighbours.popitem()
  438. cycle_indices = [vertex_index]
  439. border_neighbours[vertex_index] = neighbour_indices[1:]
  440. vertex_index = neighbour_indices[0]
  441. while vertex_index != cycle_indices[0]:
  442. neighbour_indices = border_neighbours.pop(vertex_index)
  443. neighbour_indices.remove(cycle_indices[-1])
  444. cycle_indices.append(vertex_index)
  445. if len(neighbour_indices) > 1:
  446. border_neighbours[vertex_index] = neighbour_indices[1:]
  447. vertex_index = neighbour_indices[0]
  448. assert vertex_index in border_neighbours, (
  449. vertex_index,
  450. cycle_indices,
  451. border_neighbours,
  452. )
  453. final_neighbour_indices = border_neighbours.pop(vertex_index)
  454. assert final_neighbour_indices == [cycle_indices[-1]], (
  455. vertex_index,
  456. final_neighbour_indices,
  457. cycle_indices,
  458. )
  459. yield PolygonalCircuit(cycle_indices)
  460. def _get_vertex_label_index(self, vertex_index: int) -> typing.Optional[int]:
  461. return self.annotation.vertex_label_index.get(vertex_index, None)
  462. def _find_label_border_segments(self, label: Label) -> typing.Iterator[LineSegment]:
  463. for triangle in self.triangles:
  464. border_vertex_indices = tuple(
  465. filter(
  466. lambda i: self._get_vertex_label_index(i) == label.index,
  467. triangle.vertex_indices,
  468. )
  469. )
  470. if len(border_vertex_indices) == 2:
  471. yield LineSegment(border_vertex_indices)
  472. def find_label_border_polygonal_chains(
  473. self, label: Label
  474. ) -> typing.Iterator[PolygonalChain]:
  475. segments = set(self._find_label_border_segments(label))
  476. available_chains = collections.deque(
  477. PolygonalChain(segment.vertex_indices) for segment in segments
  478. )
  479. # irrespective of its poor performance,
  480. # we keep this approach since it's easy to read and fast enough
  481. while available_chains:
  482. chain = available_chains.pop()
  483. last_chains_len = None
  484. while last_chains_len != len(available_chains):
  485. last_chains_len = len(available_chains)
  486. checked_chains = collections.deque()
  487. while available_chains:
  488. potential_neighbour = available_chains.pop()
  489. try:
  490. chain.connect(potential_neighbour)
  491. except PolygonalChainsNotOverlapingError:
  492. checked_chains.append(potential_neighbour)
  493. available_chains = checked_chains
  494. assert all((segment in segments) for segment in chain.segments())
  495. yield chain
  496. def _unused_vertices(self) -> typing.Set[int]:
  497. vertex_indices = set(range(len(self.vertices)))
  498. for triangle in self.triangles:
  499. for vertex_index in triangle.vertex_indices:
  500. vertex_indices.discard(vertex_index)
  501. return vertex_indices
  502. def remove_unused_vertices(self) -> None:
  503. vertex_index_conversion = [0] * len(self.vertices)
  504. for vertex_index in sorted(self._unused_vertices(), reverse=True):
  505. del self.vertices[vertex_index]
  506. vertex_index_conversion[vertex_index] -= 1
  507. vertex_index_conversion = numpy.cumsum(vertex_index_conversion)
  508. for triangle_index in range(len(self.triangles)):
  509. self.triangles[triangle_index] = Triangle(
  510. map(
  511. lambda i: i + int(vertex_index_conversion[i]),
  512. self.triangles[triangle_index].vertex_indices,
  513. )
  514. )
  515. def select_vertices(
  516. self, vertex_indices: typing.Iterable[int]
  517. ) -> typing.List[Vertex]:
  518. return [self.vertices[idx] for idx in vertex_indices]
  519. @staticmethod
  520. def unite(surfaces: typing.Iterable["Surface"]) -> "Surface":
  521. surfaces_iter = iter(surfaces)
  522. union = copy.deepcopy(next(surfaces_iter))
  523. for surface in surfaces_iter:
  524. vertex_index_offset = len(union.vertices)
  525. union.vertices.extend(surface.vertices)
  526. union.triangles.extend(
  527. Triangle(
  528. vertex_idx + vertex_index_offset
  529. for vertex_idx in triangle.vertex_indices
  530. )
  531. for triangle in surface.triangles
  532. )
  533. return union