/dports/archivers/snappy-java/snappy-java-1.1.7.5/src/test/resources/org/xerial/snappy/testdata/calgary/ |
H A D | bib | 3302 %T On \fIk\fP-nearest neighbor Voroni diagrams in the plane
|
/dports/astro/geographiclib/GeographicLib-1.52/doc/ |
H A D | GeographicLib.dox.in | 4302 points is usually referred to as the <i>nearest neighbor</i> problem and 4306 The NearestNeighbor class implements nearest-neighbor calculations using 4314 Data structures and algorithms for nearest neighbor search in general 4591 letter</a> he wrote to his friend and neighbor Bessel:
|
/dports/astro/gnuastro/gnuastro-0.16/ |
H A D | NEWS | 776 - gal_kdtree_nearest_neighbour: Find the nearest neighbor using a k-d tree.
|
/dports/astro/gnuastro/gnuastro-0.16/doc/ |
H A D | gnuastro.info-3 | 4558 neighbor to one part of the blank region, may not fall within the
|
H A D | gnuastro.info-5 | 2348 the next nearest neighbor to the central pixel as defined by $r_{el}$.
|
H A D | gnuastro.info-6 | 2187 Any C operation that you would like to do on the neighbor. 2189 as the index of the neighbor that is currently being studied. 2191 be repeated the number of times there is a neighbor for this 2195 ‘nind’ variable that shows the neighbor’s index, all the variables 2222 own data along with pointer(s) to its immediate neighbor(s). Below, you
|
H A D | gnuastro.info-7 | 516 for multidimensional searches like range searches and nearest neighbor 664 point and its nearest neighbor is stored in the space that 668 better nearest neighbor, that branch is not searched. 868 The functions will not simply return the nearest neighbor as a match. 869 The nearest neighbor may be too far to be a meaningful. They will check 870 the distance between the distance of the nearest neighbor of each point 1450 neighbor’s center. The nearest immediate neighbors have a connectivity 2064 The metric used to find distance for nearest neighbor 2075 The various types of nearest-neighbor interpolation functions for 2117 the each dataset, but the neighbor checking that is the most CPU
|
H A D | gnuastro.texi | 16354 @cindex Nearest-neighbor interpolation 16355 @cindex Interpolation, nearest-neighbor 25021 Any C operation that you would like to do on the neighbor. This macro will 25023 neighbor that is currently being studied. It is defined as `@code{size_t 25025 there is a neighbor for this element. 25029 @code{nind} variable that shows the neighbor's index, all the variables 25056 along with pointer(s) to its immediate neighbor(s). Below, you can see one 29228 The functions will not simply return the nearest neighbor as a match. 29229 The nearest neighbor may be too far to be a meaningful. 29717 neighbor's center. The nearest immediate neighbors have a connectivity of [all …]
|
/dports/astro/kstars/kstars-3.5.6/doc/ |
H A D | ellipticalgalaxies.docbook | 109 of our neighbor, the Andromeda galaxy (M 31). M 110 is another
|
/dports/astro/kstars/kstars-3.5.6/kstars/ekos/guide/ |
H A D | guideview.cpp | 24 for (const auto &neighbor : neighbors) in drawOverlay() local 25 drawNeighbor(painter, neighbor); in drawOverlay() 48 void GuideView::drawNeighbor(QPainter *painter, const Neighbor &neighbor) in drawNeighbor() argument 51 QPen pen(neighbor.found ? Qt::green : Qt::red); in drawNeighbor() 58 if (!neighbor.isGuideStar) in drawNeighbor() 60 const QPointF center(neighbor.targetX * scale, neighbor.targetY * scale); in drawNeighbor() 68 const double dx = neighbor.targetX * scale - x1; in drawNeighbor() 69 const double dy = neighbor.targetY * scale - y1; in drawNeighbor()
|
H A D | guideview.h | 59 void drawNeighbor(QPainter *painter, const Neighbor &neighbor);
|
/dports/astro/kstars/kstars-3.5.6/packaging/android/apk/src/org/kde/kstars/ |
H A D | DeviceOrientation.java | 220 int closestPoint = 0, pot1 = 0, pot2 = 0, neighbor = 0, left = 0; in getOrientation() local 252 neighbor = pot1; in getOrientation() 255 neighbor = pot2; in getOrientation() 261 if (neighbor < closestPoint) { in getOrientation() 265 … if ((closestPoint + 1) % POINTS_PER_SEGMENT == 0 && neighbor == pot2) { in getOrientation() 270 left = neighbor; in getOrientation() 275 … if (closestPoint % POINTS_PER_SEGMENT == 0 && neighbor == pot2) { in getOrientation() 276 left = neighbor; in getOrientation() 287 if (neighbor <= NUM_POINTS - 1 && neighbor >= 0) { in getOrientation() 288 neighborPoint = mVertices.get(neighbor); in getOrientation() [all …]
|
/dports/astro/marble/marble-21.12.3/tools/vectorosm-tilecreator/ |
H A D | PeakAnalyzer.cpp | 58 auto neighbor = neighbors.front(); in dbScan() local 60 if (!visited.contains(neighbor)) { in dbScan() 61 visited << neighbor; in dbScan() 62 auto const moreNeighbors = peaksNear(neighbor, peaks, maxDistance); in dbScan() 67 if (associations[neighbor] == nullptr) { in dbScan() 68 *fit << neighbor; in dbScan() 69 associations[neighbor] = fit; in dbScan()
|
/dports/astro/py-metpy/MetPy-1.1.0/src/metpy/interpolate/ |
H A D | geometry.py | 320 for neighbor in candidates: 322 triangle = tri.points[tri.simplices[neighbor]] 328 nn.append(neighbor)
|
/dports/astro/qmapshack/qmapshack-V_1.16.1/src/qmapshack/dem/ |
H A D | World_Online_SRTM900.wcs | 76 <supportedInterpolations default="nearest neighbor"> 77 <interpolationMethod>nearest neighbor</interpolationMethod>
|
/dports/astro/siril/siril/src/algos/ |
H A D | star_finder.c | 287 float neighbor; in peaker() local 292 neighbor = wave_image[yy][xx]; in peaker() 293 if (neighbor > pixel) { in peaker() 296 } else if (neighbor == pixel) { in peaker()
|
/dports/audio/ampache/ampache-php74-5.0.0/vendor/sabre/vobject/resources/schema/ |
H A D | xcard.rng | 287 "neighbor" | "child" | "parent" | "sibling" | "spouse" |
|
/dports/audio/audacity/audacity-Audacity-3.1.3/src/ |
H A D | Envelope.cpp | 176 const auto &neighbor = mEnv[mDragPoint + 1]; in SetDragPointValid() local 177 mEnv[mDragPoint].SetT(neighbor.GetT()); in SetDragPointValid() 178 mEnv[mDragPoint].SetVal( this, neighbor.GetVal() ); in SetDragPointValid()
|
/dports/audio/bschaffl-lv2/BSchaffl-1.4.8/ |
H A D | README.md | 202 half distance to the respective neighbor step.
|
/dports/audio/epos-devel/epos-2.5.37/doc/ |
H A D | devel.sgml | 76 neighbor, even if a higher level boundary lies in between. It is also
|
H A D | rules.sgml | 356 neighbor. If there is no such neighbor, nothing happens. As with the 428 is merged to its left-hand neighbor instead of the right-hand neighbor. 605 whenever the left neighbor is in <tt>l</tt>
|
/dports/audio/fasttracker2/ft2-clone-1.49/src/helpdata/ |
H A D | FT2.HLP | 797 "None" uses no interpolation (nearest neighbor), which will result in
|
/dports/audio/faust/faust-2.37.3/tools/faust2fpga/vhdl/ |
H A D | float_pkg_c.vhd | 804 -- returns the next representable neighbor of x in the direction toward y 5815 -- returns the next representable neighbor of x in the direction toward y
|
/dports/audio/faust/faust-2.37.3/tools/physicalModeling/mesh2faust/vega/libraries/distanceField/ |
H A D | distanceField.cpp | 934 voxel neighbor; in computeFloodFillTag() local 938 if ((neighbor.first <= resolutionX) &&\ in computeFloodFillTag() 939 (neighbor.second <= resolutionY) &&\ in computeFloodFillTag() 940 (neighbor.third <= resolutionZ))\ in computeFloodFillTag() 942 …index = (neighbor.third * (resolutionY+1) + neighbor.second) * (resolutionX + 1) + neighbor.first;\ in computeFloodFillTag() 956 if ((neighbor.first >= 0) && (neighbor.first <= resolutionX) &&\ in computeFloodFillTag() 957 (neighbor.second >= 0) && (neighbor.second <= resolutionY) &&\ in computeFloodFillTag() 958 (neighbor.third >= 0) && (neighbor.third <= resolutionZ))\ in computeFloodFillTag() 960 if (checkedVoxels.find(neighbor) == checkedVoxels.end())\ in computeFloodFillTag() 962 checkedVoxels.insert(neighbor);\ in computeFloodFillTag() [all …]
|
H A D | distanceFieldNarrowBand.cpp | 658 gridPoint neighbor; in findSurfaceGridPoints() local 661 neighbor = gridPoint(v.first+(ii), v.second+(jj), v.third+(kk));\ in findSurfaceGridPoints() 662 if ((neighbor.first <= resolutionX) &&\ in findSurfaceGridPoints() 663 (neighbor.second <= resolutionY) &&\ in findSurfaceGridPoints() 664 (neighbor.third <= resolutionZ))\ in findSurfaceGridPoints() 666 …index = (neighbor.third * (resolutionY+1) + neighbor.second) * (resolutionX + 1) + neighbor.first;\ in findSurfaceGridPoints() 680 if ((neighbor.first >= 0) && (neighbor.first <= resolutionX) &&\ in findSurfaceGridPoints() 681 (neighbor.second >= 0) && (neighbor.second <= resolutionY) &&\ in findSurfaceGridPoints() 682 (neighbor.third >= 0) && (neighbor.third <= resolutionZ))\ in findSurfaceGridPoints() 686 checkedGridPoints.insert(neighbor);\ in findSurfaceGridPoints() [all …]
|