// SPDX-License-Identifier: MIT
// Copyright (c) 2026 Incoprea
// Find nearly coincident planned vertices
// Not compiled or tested in-world
// Setup: Place in a spare owned prim. Set POINTS with at most12 positions and positive TOLERANCE. Touch for private results.
// Stop / restore: Disable/remove; no scene properties change.
// Notes: This is a small quadratic comparison; it reports proximity without merging points.
// License: see LICENSE in this distribution.
// Original Incoprea. MIT. Planning only.
list POINTS=[<0.0,0.0,0.0>,<1.0,0.0,0.0>,<1.001,0.0,0.0>,<2.0,1.0,0.0>];
float TOLERANCE=0.01;
default
{
    touch_start(integer detectedCount)
    {
        if(llDetectedKey(0)!=llGetOwner())return;
        integer n=llGetListLength(POINTS);
        if(n>12||TOLERANCE<=0.0)
        {
            llOwnerSay("Use at most12 points and positive tolerance.");
            return;
        }
        integer found;
        integer i;
        integer j;
        for(i=0;i<n;++i)for(j=i+1;j<n;++j)if(llVecDist(llList2Vector(POINTS,i),llList2Vector(POINTS,j))<TOLERANCE)
        {
            ++found;
            llOwnerSay("Close pair="+(string)i+","+(string)j);
        }
        llOwnerSay("Close pairs="+(string)found);
    }
}