1Rout(3) User Contributed Perl Documentation Rout(3)
2
6 PDL::Graphics::TriD::Rout - Helper routines for Three-dimensional
7 graphics
8
10 This module is for miscellaneous PP-defined utility routines for the
11 PDL::Graphics::TriD module. Currently, there are
12
14 combcoords
15 Signature: (x(); y(); z();
16 float [o]coords(tri=3);)
17 Combine three coordinates into a single piddle.
19 Combine x, y and z to a single piddle the first dimension of which is
21 3. This routine does dataflow automatically.
22 combcoords does not process bad values. It will set the bad-value flag
24 of all output piddles if the flag is set for any of the input piddles.
25 repulse
27 Signature: (coords(nc,np);
28 [o]vecs(nc,np);
29 int [t]links(np);;
30 double boxsize;
31 int dmult;
32 double a;
33 double b;
34 double c;
35 double d;
36 )
37 Repulsive potential for molecule-like constructs.
39 "repulse" uses a hash table of cubes to quickly calculate a repulsive
41 force that vanishes at infinity for many objects. For use by the module
42 PDL::Graphics::TriD::MathGraph. For definition of the potential, see
43 the actual function.
44 repulse does not process bad values. It will set the bad-value flag of
46 all output piddles if the flag is set for any of the input piddles.
47 attract
49 Signature: (coords(nc,np);
50 int from(nl);
51 int to(nl);
52 strength(nl);
53 [o]vecs(nc,np);;
54 double m;
55 double ms;
56 )
57 Attractive potential for molecule-like constructs.
59 "attract" is used to calculate an attractive force for many objects, of
61 which some attract each other (in a way like molecular bonds). For use
62 by the module PDL::Graphics::TriD::MathGraph. For definition of the
63 potential, see the actual function.
64 attract does not process bad values. It will set the bad-value flag of
66 all output piddles if the flag is set for any of the input piddles.
67 vrmlcoordsvert
69 Signature: (vertices(n=3); char* space; char* fd)
70 info not available
72 vrmlcoordsvert does not process bad values. It will set the bad-value
74 flag of all output piddles if the flag is set for any of the input
75 piddles.
76 contour_segments
78 This is the interface for the pp routine contour_segments_internal - it
79 takes 3 piddles as input
80 $c is a contour value (or a list of contour values)
82 $data is an [m,n] array of values at each point
84 $points is a list of [3,m,n] points, it should be a grid monotonically
86 increasing with m and n.
87 contour_segments returns a reference to a Perl array of line segments
89 associated with each value of $c. It does not (yet) handle missing
90 data values.
91 Algorithm
93 The data array represents samples of some field observed on the
94 surface described by points. For each contour value we look for
95 intersections on the line segments joining points of the data.
96 When an intersection is found we look to the adjoining line
97 segments for the other end(s) of the line segment(s). So suppose
98 we find an intersection on an x-segment. We first look down to the
99 left y-segment, then to the right y-segment and finally across to
100 the next x-segment. Once we find one in a box (two on a point) we
101 can quit because there can only be one. After we are done with a
102 given x-segment, we look to the leftover possibilities for the
103 adjoining y-segment. Thus the contours are built as a collection
104 of line segments rather than a set of closed polygons.
105
107 Copyright (C) 2000 James P. Edwards Copyright (C) 1997 Tuomas J. Lukka.
108 All rights reserved. There is no warranty. You are allowed to
109 redistribute this software / documentation under certain conditions.
110 For details, see the file COPYING in the PDL distribution. If this file
111 is separated from the PDL distribution, the copyright notice should be
112 included in the file.
113perl v5.32.0 2020-09-17 Rout(3)