| /dports/www/chromium-legacy/chromium-88.0.4324.182/native_client_sdk/src/examples/demo/voronoi/ |
| H A D | voronoi.cc | 99 class Voronoi { class
101 Voronoi();
102 virtual ~Voronoi();
154 void Voronoi::Reset() { in Reset()
172 Voronoi::Voronoi() : num_regions_(kDefaultNumRegions), num_threads_(0), in Voronoi() function in Voronoi
182 Voronoi::~Voronoi() { in ~Voronoi()
364 void Voronoi::UpdateSim() { in UpdateSim()
409 void Voronoi::Render() { in Render()
423 void Voronoi::EndBenchmark() { in EndBenchmark()
500 void Voronoi::Update() { in Update()
[all …]
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/native_client_sdk/src/gonacl_appengine/src/voronoi/ |
| H A D | voronoi.cc | 93 class Voronoi { class
95 Voronoi();
96 virtual ~Voronoi();
143 void Voronoi::Reset() { in Reset()
161 Voronoi::Voronoi() : num_regions_(kDefaultNumRegions), num_threads_(0), in Voronoi() function in Voronoi
171 Voronoi::~Voronoi() { in ~Voronoi()
186 int Voronoi::wCell(float x, float y) { in wCell()
361 void Voronoi::UpdateSim() { in UpdateSim()
406 void Voronoi::Render() { in Render()
469 void Voronoi::Update() { in Update()
[all …]
|
| /dports/finance/hs-hledger-ui/hledger-ui-1.19/_cabal_deps/fgl-5.7.0.3/Data/Graph/Inductive/Query/ |
| H A D | GVD.hs | 7 Voronoi,LRTree,
25 type Voronoi a = LRTree a function
30 gvdIn :: (DynGraph gr, Real b) => [Node] -> gr a b -> Voronoi b
36 gvdOut :: (Graph gr, Real b) => [Node] -> gr a b -> Voronoi b
43 voronoiSet :: Node -> Voronoi b -> [Node]
48 maybePath :: Node -> Voronoi b -> Maybe (LPath b)
53 nearestNode :: Node -> Voronoi b -> Maybe Node
58 nearestDist :: Node -> Voronoi b -> Maybe b
63 nearestPath :: Node -> Voronoi b -> Maybe Path
|
| /dports/finance/hs-hledger/hledger-1.19/_cabal_deps/fgl-5.7.0.3/Data/Graph/Inductive/Query/ |
| H A D | GVD.hs | 7 Voronoi,LRTree,
25 type Voronoi a = LRTree a type
30 gvdIn :: (DynGraph gr, Real b) => [Node] -> gr a b -> Voronoi b
36 gvdOut :: (Graph gr, Real b) => [Node] -> gr a b -> Voronoi b
43 voronoiSet :: Node -> Voronoi b -> [Node]
48 maybePath :: Node -> Voronoi b -> Maybe (LPath b)
53 nearestNode :: Node -> Voronoi b -> Maybe Node
58 nearestDist :: Node -> Voronoi b -> Maybe b
63 nearestPath :: Node -> Voronoi b -> Maybe Path
|
| /dports/finance/hs-hledger-web/hledger-web-1.19/_cabal_deps/fgl-5.7.0.3/Data/Graph/Inductive/Query/ |
| H A D | GVD.hs | 7 Voronoi,LRTree,
25 type Voronoi a = LRTree a type
30 gvdIn :: (DynGraph gr, Real b) => [Node] -> gr a b -> Voronoi b
36 gvdOut :: (Graph gr, Real b) => [Node] -> gr a b -> Voronoi b
43 voronoiSet :: Node -> Voronoi b -> [Node]
48 maybePath :: Node -> Voronoi b -> Maybe (LPath b)
53 nearestNode :: Node -> Voronoi b -> Maybe Node
58 nearestDist :: Node -> Voronoi b -> Maybe b
63 nearestPath :: Node -> Voronoi b -> Maybe Path
|
| /dports/devel/hs-spago/spago-0.20.3/_cabal_deps/fgl-5.7.0.3/Data/Graph/Inductive/Query/ |
| H A D | GVD.hs | 7 Voronoi,LRTree,
25 type Voronoi a = LRTree a function
30 gvdIn :: (DynGraph gr, Real b) => [Node] -> gr a b -> Voronoi b
36 gvdOut :: (Graph gr, Real b) => [Node] -> gr a b -> Voronoi b
43 voronoiSet :: Node -> Voronoi b -> [Node]
48 maybePath :: Node -> Voronoi b -> Maybe (LPath b)
53 nearestNode :: Node -> Voronoi b -> Maybe Node
58 nearestDist :: Node -> Voronoi b -> Maybe b
63 nearestPath :: Node -> Voronoi b -> Maybe Path
|
| /dports/devel/hs-darcs/darcs-2.16.4/_cabal_deps/fgl-5.7.0.3/Data/Graph/Inductive/Query/ |
| H A D | GVD.hs | 7 Voronoi,LRTree,
25 type Voronoi a = LRTree a function
30 gvdIn :: (DynGraph gr, Real b) => [Node] -> gr a b -> Voronoi b
36 gvdOut :: (Graph gr, Real b) => [Node] -> gr a b -> Voronoi b
43 voronoiSet :: Node -> Voronoi b -> [Node]
48 maybePath :: Node -> Voronoi b -> Maybe (LPath b)
53 nearestNode :: Node -> Voronoi b -> Maybe Node
58 nearestDist :: Node -> Voronoi b -> Maybe b
63 nearestPath :: Node -> Voronoi b -> Maybe Path
|
| /dports/math/p5-Math-Geometry-Voronoi/Math-Geometry-Voronoi-1.3/examples/ |
| H A D | voronoi.cgi | 11 use Math::Geometry::Voronoi;
37 my $geo = Math::Geometry::Voronoi->new(points => \@points);
68 <title>Math::Geometry::Voronoi Demo</title>
72 <h1>Math::Geometry::Voronoi Demo</h1>
75 the <a href="http://search.cpan.org/~samtregar/Math-Geometry-Voronoi">Math::Geometry::Voronoi</a>
77 more, <a href="http://search.cpan.org/~samtregar/Math-Geometry-Voronoi/lib/Math/Geometry/Voronoi.pm…
|
| /dports/math/py-triangle/triangle-20200424/doc/ |
| H A D | voronoi.rst | 1 Voronoi Diagrams
4 The -v switch produces the Voronoi diagram of a vertex set in files suffixed
6 Voronoi diagram is written to dots.1.v.node and dots.1.v.edge. These are
7 ordinary .node and .edge format files, containing the Voronoi vertices and
12 This implementation does not use exact arithmetic to compute the Voronoi
15 the Voronoi diagram may have duplicate vertices, crossing edges, or infinite
16 rays whose direction vector is zero. The result is a valid Voronoi diagram only
18 Voronoi output is usually meaningless (and may contain crossing edges and other
|
| /dports/cad/gmsh/gmsh-4.9.2-source/contrib/voro++/examples/interface/ |
| H A D | README | 4 to directly analyze features of a single Voronoi cell, and Voronoi cells in a
7 1. odd_even.cc constructs a single Voronoi cell using random planes, in the
19 compute Voronoi cells in two interlocking tori. The POV-Ray header file
23 Voronoi tessellation that have a specific number of sides. The routine also
27 quadrilateral, pentagonal, and hexagonal faces in a Voronoi tessellation. The
32 position vector, this routine will return the Voronoi cell that the vector is
36 Voronoi cell contains the point. The results can be visualized in Gnuplot with
38 splot 'find_voro_cell_v.gnu' w l t 'Voronoi cells', 'find_voro_cell.vec' w vec t 'Voronoi cell vect…
41 each Voronoi cell. It scans a grid covering the entire container, making
42 find_voronoi_cell calls at each location. The number of times each Voronoi cell
|
| /dports/cad/gds3d/GDS3D-bcdb97a/libgdsto3d/voro++/examples/interface/ |
| H A D | README | 4 to directly analyze features of a single Voronoi cell, and Voronoi cells in a
7 1. odd_even.cc constructs a single Voronoi cell using random planes, in the
19 compute Voronoi cells in two interlocking tori. The POV-Ray header file
23 Voronoi tessellation that have a specific number of sides. The routine also
27 quadrilateral, pentagonal, and hexagonal faces in a Voronoi tessellation. The
32 position vector, this routine will return the Voronoi cell that the vector is
36 Voronoi cell contains the point. The results can be visualized in Gnuplot with
38 splot 'find_voro_cell_v.gnu' w l t 'Voronoi cells', 'find_voro_cell.vec' w vec t 'Voronoi cell vect…
41 each Voronoi cell. It scans a grid covering the entire container, making
42 find_voronoi_cell calls at each location. The number of times each Voronoi cell
|
| /dports/science/voro++/voro++-0.4.6/examples/interface/ |
| H A D | README | 4 to directly analyze features of a single Voronoi cell, and Voronoi cells in a
7 1. odd_even.cc constructs a single Voronoi cell using random planes, in the
19 compute Voronoi cells in two interlocking tori. The POV-Ray header file
23 Voronoi tessellation that have a specific number of sides. The routine also
27 quadrilateral, pentagonal, and hexagonal faces in a Voronoi tessellation. The
32 position vector, this routine will return the Voronoi cell that the vector is
36 Voronoi cell contains the point. The results can be visualized in Gnuplot with
38 splot 'find_voro_cell_v.gnu' w l t 'Voronoi cells', 'find_voro_cell.vec' w vec t 'Voronoi cell vect…
41 each Voronoi cell. It scans a grid covering the entire container, making
42 find_voronoi_cell calls at each location. The number of times each Voronoi cell
|
| /dports/math/curv/curv-0.5/ideas/geometry/ |
| H A D | Voronoi | 24 Voronoi
28 "Distance fields and Voronoi diagrams are closely related and one can be
31 Voronoi diagram to recover a curved surface? What's the Voronoi diagram
33 - I think the Voronoi diagram/skeleton of a SDF captures
36 Base DFD on Voronoi diagram of a distance field?
37 Voronoi diagrams are also used in remeshing; see above link.
39 Maybe I want a GVD, Generalized Voronoi Diagram (of some variety).
43 "One can define Voronoi diagrams as the interference pattern of a propagating
|
| /dports/cad/gds3d/GDS3D-bcdb97a/libgdsto3d/voro++/examples/custom/ |
| H A D | README | 4 the Voronoi cells. Voro++ can also calculated the radical Voronoi tessellation
8 1. cell_statistics.cc constructs a simple Voronoi cell, and then demonstrates
14 print_all() to save the particle positions and Voronoi volumes to the file
16 the particle positions, Voronoi volumes and neighbors to the file
21 pack_six_cube, and saves the Voronoi tessellation to pack_six_cube.gnu. It then
23 pack_six_cube_poly, and it saves the radical Voronoi tessellation to
|
| /dports/cad/gmsh/gmsh-4.9.2-source/contrib/voro++/examples/custom/ |
| H A D | README | 4 the Voronoi cells. Voro++ can also calculated the radical Voronoi tessellation
8 1. cell_statistics.cc constructs a simple Voronoi cell, and then demonstrates
14 print_all() to save the particle positions and Voronoi volumes to the file
16 the particle positions, Voronoi volumes and neighbors to the file
21 pack_six_cube, and saves the Voronoi tessellation to pack_six_cube.gnu. It then
23 pack_six_cube_poly, and it saves the radical Voronoi tessellation to
|
| /dports/science/voro++/voro++-0.4.6/examples/custom/ |
| H A D | README | 4 the Voronoi cells. Voro++ can also calculated the radical Voronoi tessellation
8 1. cell_statistics.cc constructs a simple Voronoi cell, and then demonstrates
14 print_all() to save the particle positions and Voronoi volumes to the file
16 the particle positions, Voronoi volumes and neighbors to the file
21 pack_six_cube, and saves the Voronoi tessellation to pack_six_cube.gnu. It then
23 pack_six_cube_poly, and it saves the radical Voronoi tessellation to
|
| /dports/science/lammps/lammps-stable_29Sep2021/doc/src/ |
| H A D | compute_voronoi_atom.rst | 52 Define a computation that calculates the Voronoi tessellation of the
58 The first is the volume of the Voronoi cell around each atom. Any
60 The second is the number of faces of the Voronoi cell. This is
81 only the outward facing facets of the Voronoi cells are counted (the
86 the argument, a poly-disperse Voronoi tessellation is
100 number of edges on the faces of the Voronoi cells in the compute
102 of edges on a single Voronoi cell face expected to occur in the
123 total number of atoms sharing the Voronoi cell of the stored
140 containing all the Voronoi neighbors in a system:
161 The calculation of Voronoi volumes is performed by each
[all …]
|
| /dports/math/geogram/geogram-1.7.7/src/bin/geoshade/glsl/ShaderToy/ |
| H A D | RoundedVoronoiEdges.glsl | 4 Rounded Voronoi Borders
7 Fabrice came up with an interesting formula to produce more evenly distributed Voronoi values.
26 Voronoi - distances - iq
51 // 2D 3rd-order Voronoi: This is just a rehash of Fabrice Neyret's version, which is in
61 float Voronoi(in vec2 p){
96 // Plain Voronoi value. We're saving it and returning it to use when coloring.
98 float h = Voronoi(uv*6.);
104 // Returning the rounded border Voronoi, and the straight Voronoi values.
114 // Obtain the height map (rounded Voronoi border) value, then another nearby.
126 …float sv = Voronoi(uv*16. + c.y)*.66 + (1.-Voronoi(uv*48. + c.y*2.))*.34; // Finer overlay pattern.
[all …]
|
| /dports/cad/gmsh/gmsh-4.9.2-source/contrib/voro++/examples/extra/ |
| H A D | README | 5 box_cut.cc - this creates a large Voronoi cell, and then cuts the cell by a
11 determining whether a plane has any intersection with a Voronoi cell. The
12 program creates a test Voronoi cell, saves it to "cell.gnu", and then maps out
23 Voronoi tessellation for an irregular group of particles. Each Voronoi cell is
25 This stops Voronoi cells from extending a long way out to the computational
|
| /dports/cad/gds3d/GDS3D-bcdb97a/libgdsto3d/voro++/examples/extra/ |
| H A D | README | 5 box_cut.cc - this creates a large Voronoi cell, and then cuts the cell by a
11 determining whether a plane has any intersection with a Voronoi cell. The
12 program creates a test Voronoi cell, saves it to "cell.gnu", and then maps out
23 Voronoi tessellation for an irregular group of particles. Each Voronoi cell is
25 This stops Voronoi cells from extending a long way out to the computational
|
| /dports/science/voro++/voro++-0.4.6/examples/extra/ |
| H A D | README | 5 box_cut.cc - this creates a large Voronoi cell, and then cuts the cell by a
11 determining whether a plane has any intersection with a Voronoi cell. The
12 program creates a test Voronoi cell, saves it to "cell.gnu", and then maps out
23 Voronoi tessellation for an irregular group of particles. Each Voronoi cell is
25 This stops Voronoi cells from extending a long way out to the computational
|
| /dports/science/InsightToolkit/ITK-5.0.1/Modules/Segmentation/Voronoi/ |
| H A D | itk-module.cmake | 1 set(DOCUMENTATION "This module provides classes to perform Voronoi segmentation
2 on scalar or RGB images. Voronoi segmentation is a region based segmentation
3 technique. A Voronoi diagram is created from a set of seed points in the image.
4 Each resulting Voronoi cell is classified as internal or external to the
|
| /dports/science/dakota/dakota-6.13.0-release-public.src-UI/docs/KeywordMetadata/ |
| H A D | method-fsu_cvt | 2 Design of Computer Experiments - Centroidal Voronoi Tessellation
4 The FSU Centroidal Voronoi Tessellation method (\c fsu_cvt)
6 (approximately) a Centroidal Voronoi Tessellation. The primary feature of
15 of the centroids of the corresponding Voronoi subregions.
45 Centroidal Voronoi Tessellation
52 Note that Centroidal Voronoi Tessellation does not produce low-discrepancy sequences
54 projections of Centroidal Voronoi Tessellation can have high discrepancy.
|
| /dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/FSUDace/examples/ |
| H A D | fsu_cvt_problems.out | 8 FSU_CVT computes a Centroidal Voronoi Tessellation.
40 FSU_CVT computes a Centroidal Voronoi Tessellation.
73 FSU_CVT computes a Centroidal Voronoi Tessellation.
106 FSU_CVT computes a Centroidal Voronoi Tessellation.
139 FSU_CVT computes a Centroidal Voronoi Tessellation.
172 FSU_CVT computes a Centroidal Voronoi Tessellation.
205 FSU_CVT computes a Centroidal Voronoi Tessellation.
238 FSU_CVT computes a Centroidal Voronoi Tessellation.
271 FSU_CVT computes a Centroidal Voronoi Tessellation.
304 FSU_CVT computes a Centroidal Voronoi Tessellation.
|
| /dports/science/py-scipy/scipy-1.7.1/doc/source/tutorial/ |
| H A D | spatial.rst | 8 `scipy.spatial` can compute triangulations, Voronoi diagrams, and
158 Voronoi diagrams
161 A Voronoi diagram is a subdivision of the space into the nearest
191 This does not, however, give the Voronoi diagram as a geometrical
197 >>> from scipy.spatial import Voronoi
198 >>> vor = Voronoi(points)
206 edges of the Voronoi regions. In this case, there are 9 different
215 above, there may be fewer Voronoi regions than input points.
292 ... """Creates a mandala figure using Voronoi tesselations.
341 ... # Create the Mandala figure via a Voronoi plot
[all …]
|