ModelTiler.h

/*--------------------------------------------------------------------------------------------
Copyright (c) 2019, NDEVR LLC
tyler.parke@ndevr.org
  __    __   ____     _____ __     __  _______
 |  \  |  | |  __ \  |  ___|\ \   / / |   __  \
 |   \ |  | | |  \ \ | |___  \ \ / /  |  |__)  |
 |  . \|  | | |__/ / | |___   \ V /   |   _   /
 |  |\    |_|_____/__|_____|___\_/____|  | \  \
 |__| \__________________________________|  \__\
 
Subject to the terms of the Enterprise+ Agreement, NDEVR hereby grants 
Licensee a limited, non-exclusive, non-transferable, royalty-free license 
(without the right to sublicense) to use the API solely for the purpose of 
Licensee's internal development efforts to develop applications for which 
the API was provided.
 
The above copyright notice and this permission notice shall be included in all 
copies or substantial portions of the Software.
 
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,
INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR
PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE
FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
DEALINGS IN THE SOFTWARE.
 
Library: Design
File: ModelTiler
Included in API: True
Author(s): Tyler Parke
 *-----------------------------------------------------------------------------------------**/
#pragma once
#include <NDEVR/Model.h>
#if NDEVR_MODEL_TILE_CONTAINER
#include <NDEVR/Geometry.h>
#include <NDEVR/AngleDefinitions.h>
#include <NDEVR/MatrixFunctions.h>
#include <NDEVR/Scene.h>
namespace NDEVR
{
    class ModelTiler
    {
    public:
        enum TileMode
        {
              e_vertex_random   
            , e_vertex_even     
        };
        struct TileOptions
        {
            Model parent;                                               
            Model model_to_tile;                                        
            Buffer<Model> old_model_pool;                               
            Buffer<Model> new_models_added;                             
            Matrix<fltp08> source_transform = Matrix<fltp08>(1.0);      
            Matrix<fltp08> model_to_tile_transform = Matrix<fltp08>(1.0);
            LineSegment<3, fltp08> placement_segment;                   
            bool use_heading = true;                                    
            bool use_inclination = true;                                
            bool scale_to_fit = false;                                  
            bool per_vertex_placement = false;                          
        };
        static Model IndexChild(TileOptions& options)
        {
            Model child;
            if (options.old_model_pool.size() > 0)
            {
                child = options.old_model_pool.last();
                if(child.isDeleted())
                    options.new_models_added.add(child);
                if (child.get<NDPO::library_id>() != options.model_to_tile.get<NDPO::library_id>())
                    child.copyFrom(options.model_to_tile, false);
                options.model_to_tile = child;
                options.old_model_pool.removeLast();
            }
            else
            {
                child = options.parent.createChild();
                child.copyFrom(options.model_to_tile, false);
                options.model_to_tile = child;
                options.new_models_added.add(child);
            }
            return child;
        }
        static void TileAlongGeo(const Geometry& linework, TileOptions& options)
        {
            if (linework.getGeometryType() == GeometryType::e_linework)
            {
                //bool is_closed = linework.get<NDPG::has_closed_primitive>();
                Buffer<Polyline<3, fltp08>> polylines = linework.polylines<3, fltp08>(PrimitiveProperty::Outline, VertexProperty::Position);
                //Extrude Shape
                for (uint04 i = 0; i < polylines.size(); i++)
                {
                    polylines[i].simplify();
                    TileModelAlongLine(polylines[i], options);
                }
            }
            /*
            
            
            for (uint04 i = 0; i < broken_poly.vertexCount(); i++)
            {
                Model child = IndexChild(i, root_child, options);
                Matrix<fltp08> mat = Matrix<fltp08>::OffsetMatrix(broken_poly.vertex(i));
                uint04 segment_index = getMin(broken_poly.segmentCount() - 1, i);
                if(options.use_heading)
                    mat = mat.rotate(AngleDefinitions::Heading<sint04>(broken_poly.segment(segment_index).ray()), Vector<3, fltp08>(0, 0, 1));
                if(options.use_inclination)
                    mat = mat.rotate(-AngleDefinitions::Inclination<sint04>(broken_poly.segment(segment_index).ray()), Vector<3, fltp08>(0, 1, 0));
                mat = parent_transform * mat * dest_transform;
                child.setProperty<NDPO::transform>(mat);
            }
            */
            else if (linework.getGeometryType() == GeometryType::e_points)
            {
                Buffer<Vertex<3, fltp08>> vertices = linework.vertices<Vertex<3, fltp08>>(VertexProperty::Position);
                const Matrix<fltp08> dest_transform = options.model_to_tile_transform;
                const Matrix<fltp08> parent_transform = options.parent.getCompleteTransform().invert();
                for (uint04 i = 0; i < vertices.size(); i++)
                {
                    if (IsInvalid(vertices[i]))
                        continue;
                    Model child = IndexChild(options);
                    Matrix<fltp08> mat = Matrix<fltp08>::OffsetMatrix(options.source_transform * vertices[i]);
                    mat = parent_transform * mat * dest_transform;
                    child.set<NDPO::transform>(mat);
                }
            }
        }
        static void TileModelAlongLine(const Polyline<3, fltp08>& extrude_path, TileOptions& options)
        {
            fltp08 distance = options.placement_segment.ray()[X];
            Polyline<3, fltp08> broken_poly = options.source_transform * extrude_path;
            if (!options.per_vertex_placement)
            {
                broken_poly = broken_poly.breakIntoSegmentsByDistance(distance);
                if (options.scale_to_fit)
                    distance = 0.9999999 * broken_poly.length<fltp08>() / cast<fltp08>(cast<sint04>(broken_poly.length<fltp08>() / distance));
            }
            if (broken_poly.segmentCount() == 0)
                return;
            //Vertex<3, fltp08> model_offset = model_to_tile.getTransform() * seg.vertex(A);
            //Angle heading_angle = AngleDefinitions::Heading<sint04>(seg.ray());
            //Angle inclination_angle = AngleDefinitions::Inclination(seg.ray());
            Matrix<fltp08> dest_transform = options.model_to_tile_transform;
            
            const Matrix<fltp08> parent_transform = options.parent.getCompleteTransform().invert();
            for (uint04 i = 0; i < broken_poly.vertexCount(); i++)
            {
                Model child = IndexChild(options);
                Matrix<fltp08> mat = Matrix<fltp08>::OffsetMatrix(broken_poly.vertex(i));
                uint04 segment_index = getMin(broken_poly.segmentCount() - 1, i);
                if(options.use_heading)
                    mat = mat.rotate(AngleDefinitions::Heading<sint04>(broken_poly.segment(segment_index).ray()), Vector<3, fltp08>(0, 0, 1));
                if(options.use_inclination)
                    mat = mat.rotate(-AngleDefinitions::Inclination<sint04>(broken_poly.segment(segment_index).ray()), Vector<3, fltp08>(0, 1, 0));
                if (options.scale_to_fit)
                {
                    auto bounds = dest_transform * child.getBounds();
                    mat = mat.scale({ distance / bounds.span(X), 1.0, 1.0 });
                }
                mat = parent_transform * mat * dest_transform;
                child.update<NDPO::transform>(mat);
            }
        }
        
    };
}
#endif