__init__.py 23 KB

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