// SPDX-License-Identifier: MIT
// Copyright (c) 2026 Incoprea
// Place evenly spaced markers along a route
// Not compiled or tested in-world
// Setup: Put in a spare owned prim. Set POINTS with at least two positions. Touch to print the plan privately.
// Stop / restore: Remove/disable; calculations do not alter objects.
// Notes: Duplicate points are allowed, but total route length must be positive. This plans positions without creating markers.
// License: see LICENSE in this distribution.
// Original Incoprea. MIT. Calculation only.
list POINTS=[<0.0,0.0,0.0>,<4.0,0.0,0.0>,<4.0,6.0,0.0>,<8.0,6.0,0.0>];
default
{
    touch_start(integer detectedCount)
    {
        if(llDetectedKey(0)!=llGetOwner())return;
        integer n=llGetListLength(POINTS);
        if(n<2)
        {
            llOwnerSay("Need two points.");
            return;
        }
        float total;
        integer i;
        for(i=1;i<n;++i)total+=llVecDist(llList2Vector(POINTS,i-1),llList2Vector(POINTS,i));
        if(total<0.000001)
        {
            llOwnerSay("Zero-length path.");
            return;
        }
        integer marker;
        for(marker=0;marker<6;++marker)
        {
            float remaining=total*(float)marker/5.0;
            vector result=llList2Vector(POINTS,-1);
            integer found;
            for(i=1;i<n&&!found;++i)
            {
                vector a=llList2Vector(POINTS,i-1);
                vector b=llList2Vector(POINTS,i);
                float length=llVecDist(a,b);
                if(length>0.0&&remaining<=length)
                {
                    result=a+(b-a)*(remaining/length);
                    found=TRUE;
                }
                else remaining-=length;
            }
            llOwnerSay("Marker "+(string)marker+" "+(string)result);
        }
    }
}