本文共 822 字，大约阅读时间需要 2 分钟。

function [vertex_voronoi,faces_voronoi] = compute_voronoi_triangulation_mesh(Q, vertex, faces)% compute_voronoi_triangulation_mesh - compute a triangulation%%   [vertex_voronoi,face_voronoi] = compute_voronoi_triangulation_mesh(Q, vertex, faces);%%   Q is a Voronoi partition function, computed using%   perform_fast_marching_mesh.%%   Copyright (c) 2006 Gabriel Peyreif size(vertex,1)>size(vertex,2)    vertex = vertex';endif size(faces,1)>size(faces,2)    faces = faces';endV = Q(faces);V = sort(V,1);V = unique(V', 'rows')';% V = V( prod(V,2)>0 ,:);d = (V(1,:)~=V(2,:)) + (V(2,:)~=V(3,:));I = find(d==2); I = sort(I);w = V(:,I); w = sort(w(:)); % index that are in the triangulationw = unique(w);nverts = size(vertex,2);z = zeros(nverts,1);z(w) = (1:length(w))';faces_voronoi = z(V( :,I ));vertex_voronoi = vertex(:,w);

转载地址：http://xvxdi.baihongyu.com/