1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
|
## Copyright (C) 2024 David Legland
## All rights reserved.
##
## Redistribution and use in source and binary forms, with or without
## modification, are permitted provided that the following conditions are met:
##
## 1 Redistributions of source code must retain the above copyright notice,
## this list of conditions and the following disclaimer.
## 2 Redistributions in binary form must reproduce the above copyright
## notice, this list of conditions and the following disclaimer in the
## documentation and/or other materials provided with the distribution.
##
## THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ''AS IS''
## AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
## IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
## ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
## ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
## DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
## SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
## CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
## OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
## OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
##
## The views and conclusions contained in the software and documentation are
## those of the authors and should not be interpreted as representing official
## policies, either expressed or implied, of the copyright holders.
function [nodes, edges, faces] = voronoi2d(germs)
%VORONOI2D Compute a voronoi diagram as a graph structure.
%
% [NODES, EDGES, FACES] = voronoi2d(GERMS)
% GERMS an array of points with dimension 2
% NODES, EDGES, FACES: usual graph representation, FACES as cell array
%
% Example
% [n e f] = voronoi2d(rand(100, 2)*100);
% drawGraph(n, e);
%
% See also
%
% ------
% Author: David Legland
% E-mail: david.legland@inrae.fr
% Created: 2007-01-12
% Copyright 2007-2023 INRA - BIA PV Nantes - MIAJ Jouy-en-Josas
% compute generic Voronoi diagram
[V, C] = voronoin(germs);
% declaration of array for storing results
nodes = V(2:end, :);
edges = zeros(0, 2);
faces = {};
% iterate on voronoi 'cells'
for i = 1:length(C)
% get node indices of current polygonal domain
cell = C{i};
% do not process unbounded domains
if ismember(1, cell)
continue;
end
% fix indexing of nodes
cell = cell - 1;
% compute indices of edge and domain nodes
edges = [edges; sort([cell' cell([2:end 1])'], 2)]; %#ok<AGROW>
faces{length(faces)+1} = cell; %#ok<AGROW>
end
% remove duplicate edges
edges = unique(edges, 'rows');
|
