linestring 0.16.0

// SPDX-License-Identifier: MIT OR Apache-2.0
// Copyright (c) 2021,2023 lacklustr@protonmail.com https://github.com/eadf

// This file is part of the linestring crate.

/*
Copyright (c) 2021,2023 lacklustr@protonmail.com https://github.com/eadf

Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:

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.

or

Copyright 2021,2023 lacklustr@protonmail.com https://github.com/eadf

Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at

    http://www.apache.org/licenses/LICENSE-2.0

Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/

// Emit a compilation error if the required features are not set
#[cfg(not(feature = "glam"))]
compile_error!("The feature 'glam' must be active for the tests");

use crate::{LinestringError, linestring_2d::convex_hull};
use vector_traits::glam::{DVec2, Vec2, vec2};

#[test]
#[allow(clippy::vec_init_then_push)]
fn contains_point_exclusive_1() {
    let mut hull = Vec::<DVec2>::with_capacity(5);
    hull.push([0.0, 0.0].into());
    hull.push([10.0, 0.0].into());
    hull.push([10.0, 10.0].into());
    hull.push([0.0, 10.0].into());
    hull.push([0.0, 0.0].into());

    assert!(convex_hull::contains_point_exclusive(
        &hull,
        [5.0, 6.0].into()
    ));
    assert!(!convex_hull::contains_point_exclusive(
        &hull,
        [0.0, 0.0].into()
    ));
    assert!(!convex_hull::contains_point_exclusive(
        &hull,
        [0.0, 10.0].into()
    ));
    assert!(!convex_hull::contains_point_exclusive(
        &hull,
        [10.0, 10.0].into()
    ));
    assert!(!convex_hull::contains_point_exclusive(
        &hull,
        [5.0, 10.0].into()
    ));

    assert!(!convex_hull::contains_point_exclusive(
        &hull,
        [10.0000001, 10.0].into()
    ));
    assert!(convex_hull::contains_point_exclusive(
        &hull,
        [9.99999, 9.99999].into()
    ));
    assert!(!convex_hull::contains_point_exclusive(
        &hull,
        [10.0, 9.99999].into()
    ));
}

#[test]
#[allow(clippy::vec_init_then_push)]
fn contains_point_inclusive_1() {
    let mut hull = Vec::<DVec2>::with_capacity(5);
    hull.push([0.0, 0.0].into());
    hull.push([10.0, 0.0].into());
    hull.push([10.0, 10.0].into());
    hull.push([0.0, 10.0].into());
    hull.push([0.0, 0.0].into());

    assert!(convex_hull::contains_point_inclusive(
        &hull,
        [5.0, 6.0].into()
    ));
    assert!(convex_hull::contains_point_inclusive(
        &hull,
        [0.0, 0.0].into()
    ));
    assert!(convex_hull::contains_point_inclusive(
        &hull,
        [0.0, 10.0].into()
    ));
    assert!(convex_hull::contains_point_inclusive(
        &hull,
        [10.0, 10.0].into()
    ));
    assert!(convex_hull::contains_point_inclusive(
        &hull,
        [5.0, 10.0].into()
    ));

    assert!(!convex_hull::contains_point_inclusive(
        &hull,
        [10.0000001, 10.0].into()
    ));
    assert!(convex_hull::contains_point_inclusive(
        &hull,
        [9.99999, 9.99999].into()
    ));
    assert!(convex_hull::contains_point_inclusive(
        &hull,
        [10.0, 9.99999].into()
    ));
}

#[test]
fn convex_hull_circle() -> Result<(), LinestringError> {
    use std::f32::consts::PI;

    // Define the circle parameters
    let num_points = 1000; // Number of points on the circle
    let radius = 1.0;

    // Generate points in a circular pattern
    let mut points: Vec<Vec2> = Vec::new();
    for i in 0..num_points {
        let theta = 2.0 * PI * (i as f32) / (num_points as f32);
        let x = radius * theta.cos();
        let y = radius * theta.sin();
        points.push(vec2(x, y));
    }
    let indices: Vec<u32> = (0..points.len() as u32).collect();

    // Ensure that the last point is the same as the first to form a closed loop
    points.push(points[0]);

    // Calculate the convex hull using Graham's Scan
    let ghs = convex_hull::graham_scan(&points)?;

    // Calculate the convex hull using Gift Wrapping
    let gw = convex_hull::gift_wrap(&points)?;

    // Calculate the convex hull using convex_hull_par()
    let chp = convex_hull::convex_hull_par(&points, &indices, num_points / 5)?;

    // Calculate the convex hull using indexed Graham's Scan
    let ighs = convex_hull::indexed_graham_scan(&points, &indices)?;

    // Calculate the convex hull using indexed Gift Wrapping
    let igw = convex_hull::indexed_gift_wrap(&points, &indices)?;

    assert_eq!(ghs, gw);
    assert_eq!(ghs.len(), chp.len());
    assert_eq!(chp, ighs);
    assert_eq!(chp, igw);

    Ok(())
}