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
// Copyright 2018 Tristam MacDonald
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
use TRIANGLE_CONNECTION;
use ;
/// March a single cube, given the 8 corner vertices, and the density at each vertex.
///
/// The `edge_func` will be invoked once for each vertex in the resulting mesh data, with the index
/// of the edge on which the vertex falls. Each triplet of invocations forms one triangle.
///
/// It would in many ways be simple to output triangles directly, but callers needing to produce
/// indexed geometry will want to deduplicate vertices before forming triangles.
/// Calculate the position of the vertex along an edge, given the density at either end of the edge.
/// Linearly Interpolate between two floating point values