add mesh data structure with edge topology
Browse files- point2mesh/mesh.py +219 -0
point2mesh/mesh.py
ADDED
|
@@ -0,0 +1,219 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
"""
|
| 2 |
+
Mesh data structure with edge-based topology for MeshCNN operations.
|
| 3 |
+
|
| 4 |
+
Stores vertices, faces, edges, and the GEMM (edge-neighbor) adjacency
|
| 5 |
+
required by MeshCNN convolutions. Also handles PartMesh spatial splitting.
|
| 6 |
+
"""
|
| 7 |
+
|
| 8 |
+
from __future__ import annotations
|
| 9 |
+
|
| 10 |
+
import numpy as np
|
| 11 |
+
import torch
|
| 12 |
+
from collections import defaultdict
|
| 13 |
+
from typing import List, Dict, Tuple, Optional
|
| 14 |
+
|
| 15 |
+
|
| 16 |
+
# ββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββ
|
| 17 |
+
# Mesh
|
| 18 |
+
# ββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββ
|
| 19 |
+
class Mesh:
|
| 20 |
+
"""Half-edgeβinspired mesh representation for MeshCNN / Point2Mesh."""
|
| 21 |
+
|
| 22 |
+
def __init__(
|
| 23 |
+
self,
|
| 24 |
+
vertices: np.ndarray,
|
| 25 |
+
faces: np.ndarray,
|
| 26 |
+
device: str = "cpu",
|
| 27 |
+
):
|
| 28 |
+
"""
|
| 29 |
+
Parameters
|
| 30 |
+
----------
|
| 31 |
+
vertices : (N_v, 3) float array
|
| 32 |
+
faces : (N_f, 3) int array β vertex indices per triangle
|
| 33 |
+
device : torch device string
|
| 34 |
+
"""
|
| 35 |
+
self.device = torch.device(device)
|
| 36 |
+
self.vs = torch.tensor(vertices, dtype=torch.float32, device=self.device)
|
| 37 |
+
self.faces = torch.tensor(faces, dtype=torch.long, device=self.device)
|
| 38 |
+
self._build_topology()
|
| 39 |
+
|
| 40 |
+
# ββ topology ββββββββββββββββββββββββββββββββββββββββββββββββββββββ
|
| 41 |
+
def _build_topology(self):
|
| 42 |
+
F_np = self.faces.cpu().numpy()
|
| 43 |
+
n_faces = len(F_np)
|
| 44 |
+
|
| 45 |
+
edge_to_idx: Dict[Tuple[int, int], int] = {}
|
| 46 |
+
edge_faces: Dict[Tuple[int, int], List[Tuple[int, int]]] = defaultdict(list)
|
| 47 |
+
edges_list: List[Tuple[int, int]] = []
|
| 48 |
+
|
| 49 |
+
for fi, face in enumerate(F_np):
|
| 50 |
+
for k in range(3):
|
| 51 |
+
v0, v1 = int(face[k]), int(face[(k + 1) % 3])
|
| 52 |
+
key = (min(v0, v1), max(v0, v1))
|
| 53 |
+
if key not in edge_to_idx:
|
| 54 |
+
edge_to_idx[key] = len(edges_list)
|
| 55 |
+
edges_list.append(key)
|
| 56 |
+
edge_faces[key].append((fi, k))
|
| 57 |
+
|
| 58 |
+
edges_np = np.array(edges_list, dtype=np.int64)
|
| 59 |
+
n_edges = len(edges_np)
|
| 60 |
+
|
| 61 |
+
self.edges = torch.tensor(edges_np, dtype=torch.long, device=self.device)
|
| 62 |
+
self.n_edges = n_edges
|
| 63 |
+
self.n_faces = n_faces
|
| 64 |
+
|
| 65 |
+
# face_edges[fi, k] = edge index of the k-th edge of face fi
|
| 66 |
+
face_edges = np.zeros((n_faces, 3), dtype=np.int64)
|
| 67 |
+
for key, flist in edge_faces.items():
|
| 68 |
+
eidx = edge_to_idx[key]
|
| 69 |
+
for fi, k in flist:
|
| 70 |
+
face_edges[fi][k] = eidx
|
| 71 |
+
|
| 72 |
+
# gemm_edges[ei] = [a, b, c, d] the 4 ordered neighbor edges
|
| 73 |
+
gemm = np.full((n_edges, 4), -1, dtype=np.int64)
|
| 74 |
+
for key, flist in edge_faces.items():
|
| 75 |
+
eidx = edge_to_idx[key]
|
| 76 |
+
if len(flist) < 2:
|
| 77 |
+
fi, k = flist[0]
|
| 78 |
+
n0 = face_edges[fi][(k + 1) % 3]
|
| 79 |
+
n1 = face_edges[fi][(k + 2) % 3]
|
| 80 |
+
gemm[eidx] = [n0, n1, n0, n1]
|
| 81 |
+
continue
|
| 82 |
+
(fi0, k0), (fi1, k1) = flist[0], flist[1]
|
| 83 |
+
a = face_edges[fi0][(k0 + 1) % 3]
|
| 84 |
+
b = face_edges[fi0][(k0 + 2) % 3]
|
| 85 |
+
c = face_edges[fi1][(k1 + 1) % 3]
|
| 86 |
+
d = face_edges[fi1][(k1 + 2) % 3]
|
| 87 |
+
gemm[eidx] = [a, b, c, d]
|
| 88 |
+
|
| 89 |
+
self.gemm_edges = torch.tensor(gemm, dtype=torch.long, device=self.device)
|
| 90 |
+
|
| 91 |
+
# vertex β incident edge indices (Python dict, kept on CPU)
|
| 92 |
+
ve: Dict[int, List[int]] = defaultdict(list)
|
| 93 |
+
for ei, (v0, v1) in enumerate(edges_np):
|
| 94 |
+
ve[int(v0)].append(ei)
|
| 95 |
+
ve[int(v1)].append(ei)
|
| 96 |
+
self.vertex_edges = dict(ve)
|
| 97 |
+
|
| 98 |
+
# edge β which endpoint position (0 or 1) each vertex occupies
|
| 99 |
+
# useful for aggregating edge displacements β vertex displacements
|
| 100 |
+
self._build_edge_vertex_tables(edges_np)
|
| 101 |
+
|
| 102 |
+
self._update_face_areas()
|
| 103 |
+
|
| 104 |
+
def _build_edge_vertex_tables(self, edges_np: np.ndarray):
|
| 105 |
+
"""Sparse index tables for scatter-adding edge Ξ β vertex Ξ."""
|
| 106 |
+
n_v = self.vs.shape[0]
|
| 107 |
+
# For every edge, endpoint-0 and endpoint-1 vertex ids
|
| 108 |
+
# We'll use these to scatter edge displacements to vertices
|
| 109 |
+
self.edge_v0 = torch.tensor(edges_np[:, 0], dtype=torch.long, device=self.device)
|
| 110 |
+
self.edge_v1 = torch.tensor(edges_np[:, 1], dtype=torch.long, device=self.device)
|
| 111 |
+
|
| 112 |
+
def _update_face_areas(self):
|
| 113 |
+
v0 = self.vs[self.faces[:, 0]]
|
| 114 |
+
v1 = self.vs[self.faces[:, 1]]
|
| 115 |
+
v2 = self.vs[self.faces[:, 2]]
|
| 116 |
+
cross = torch.cross(v1 - v0, v2 - v0, dim=1)
|
| 117 |
+
self.face_areas = 0.5 * cross.norm(dim=1)
|
| 118 |
+
|
| 119 |
+
def face_normals(self, verts: Optional[torch.Tensor] = None) -> torch.Tensor:
|
| 120 |
+
V = verts if verts is not None else self.vs
|
| 121 |
+
v0 = V[self.faces[:, 0]]
|
| 122 |
+
v1 = V[self.faces[:, 1]]
|
| 123 |
+
v2 = V[self.faces[:, 2]]
|
| 124 |
+
cross = torch.cross(v1 - v0, v2 - v0, dim=1)
|
| 125 |
+
return torch.nn.functional.normalize(cross, dim=1)
|
| 126 |
+
|
| 127 |
+
@property
|
| 128 |
+
def n_vertices(self) -> int:
|
| 129 |
+
return self.vs.shape[0]
|
| 130 |
+
|
| 131 |
+
def clone(self) -> "Mesh":
|
| 132 |
+
m = Mesh.__new__(Mesh)
|
| 133 |
+
m.device = self.device
|
| 134 |
+
m.vs = self.vs.clone()
|
| 135 |
+
m.faces = self.faces.clone()
|
| 136 |
+
m.edges = self.edges.clone()
|
| 137 |
+
m.n_edges = self.n_edges
|
| 138 |
+
m.n_faces = self.n_faces
|
| 139 |
+
m.gemm_edges = self.gemm_edges.clone()
|
| 140 |
+
m.vertex_edges = {k: list(v) for k, v in self.vertex_edges.items()}
|
| 141 |
+
m.edge_v0 = self.edge_v0.clone()
|
| 142 |
+
m.edge_v1 = self.edge_v1.clone()
|
| 143 |
+
m.face_areas = self.face_areas.clone()
|
| 144 |
+
return m
|
| 145 |
+
|
| 146 |
+
|
| 147 |
+
# ββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββ
|
| 148 |
+
# Edge displacement β vertex displacement (differentiable scatter)
|
| 149 |
+
# ββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββ
|
| 150 |
+
def edge_to_vertex_displacement(
|
| 151 |
+
delta_edges: torch.Tensor, # [N_e, 2, 3]
|
| 152 |
+
mesh: Mesh,
|
| 153 |
+
) -> torch.Tensor:
|
| 154 |
+
"""Average per-edge endpoint displacements into per-vertex displacements."""
|
| 155 |
+
n_v = mesh.n_vertices
|
| 156 |
+
delta_v = torch.zeros(n_v, 3, device=delta_edges.device, dtype=delta_edges.dtype)
|
| 157 |
+
count = torch.zeros(n_v, 1, device=delta_edges.device, dtype=delta_edges.dtype)
|
| 158 |
+
|
| 159 |
+
delta_v.scatter_add_(0, mesh.edge_v0.unsqueeze(1).expand(-1, 3), delta_edges[:, 0])
|
| 160 |
+
delta_v.scatter_add_(0, mesh.edge_v1.unsqueeze(1).expand(-1, 3), delta_edges[:, 1])
|
| 161 |
+
count.scatter_add_(0, mesh.edge_v0.unsqueeze(1), torch.ones(mesh.n_edges, 1, device=delta_edges.device))
|
| 162 |
+
count.scatter_add_(0, mesh.edge_v1.unsqueeze(1), torch.ones(mesh.n_edges, 1, device=delta_edges.device))
|
| 163 |
+
|
| 164 |
+
return delta_v / count.clamp(min=1)
|
| 165 |
+
|
| 166 |
+
|
| 167 |
+
# ββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββ
|
| 168 |
+
# PartMesh β spatial splitting for large meshes
|
| 169 |
+
# ββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββ
|
| 170 |
+
class PartMesh:
|
| 171 |
+
"""Spatially partition a mesh for memory-efficient processing."""
|
| 172 |
+
|
| 173 |
+
def __init__(self, mesh: Mesh, n_parts: int = 2):
|
| 174 |
+
self.mesh = mesh
|
| 175 |
+
self.n_parts = n_parts
|
| 176 |
+
self.parts: List[Mesh] = []
|
| 177 |
+
self.vertex_maps: List[np.ndarray] = [] # local β global
|
| 178 |
+
self._split()
|
| 179 |
+
|
| 180 |
+
def _split(self):
|
| 181 |
+
vs = self.mesh.vs.cpu().numpy()
|
| 182 |
+
F_np = self.mesh.faces.cpu().numpy()
|
| 183 |
+
n = self.n_parts
|
| 184 |
+
lo = vs.min(axis=0)
|
| 185 |
+
hi = vs.max(axis=0)
|
| 186 |
+
span = hi - lo + 1e-8
|
| 187 |
+
|
| 188 |
+
cell = np.floor(((vs - lo) / span) * n).astype(int)
|
| 189 |
+
cell = np.clip(cell, 0, n - 1)
|
| 190 |
+
cell_id = cell[:, 0] * n * n + cell[:, 1] * n + cell[:, 2]
|
| 191 |
+
|
| 192 |
+
cell_faces: Dict[int, set] = defaultdict(set)
|
| 193 |
+
for fi, face in enumerate(F_np):
|
| 194 |
+
for vi in face:
|
| 195 |
+
cell_faces[cell_id[vi]].add(fi)
|
| 196 |
+
|
| 197 |
+
for cid in sorted(cell_faces.keys()):
|
| 198 |
+
fset = sorted(cell_faces[cid])
|
| 199 |
+
if not fset:
|
| 200 |
+
continue
|
| 201 |
+
sub_faces = F_np[fset]
|
| 202 |
+
unique_verts = np.unique(sub_faces.ravel())
|
| 203 |
+
g2l = {int(g): l for l, g in enumerate(unique_verts)}
|
| 204 |
+
local_faces = np.vectorize(g2l.get)(sub_faces)
|
| 205 |
+
sub_vs = vs[unique_verts]
|
| 206 |
+
part = Mesh(sub_vs, local_faces, device=str(self.mesh.device))
|
| 207 |
+
self.parts.append(part)
|
| 208 |
+
self.vertex_maps.append(unique_verts)
|
| 209 |
+
|
| 210 |
+
def aggregate_displacements(
|
| 211 |
+
self, part_deltas: List[torch.Tensor]
|
| 212 |
+
) -> torch.Tensor:
|
| 213 |
+
delta = torch.zeros_like(self.mesh.vs)
|
| 214 |
+
count = torch.zeros(self.mesh.n_vertices, 1, device=self.mesh.device)
|
| 215 |
+
for vmap, dv in zip(self.vertex_maps, part_deltas):
|
| 216 |
+
idx = torch.tensor(vmap, dtype=torch.long, device=self.mesh.device)
|
| 217 |
+
delta[idx] += dv.to(self.mesh.device)
|
| 218 |
+
count[idx] += 1
|
| 219 |
+
return delta / count.clamp(min=1)
|