QUGaR 0.0.4
Loading...
Searching...
No Matches
point.hpp
Go to the documentation of this file.
1// --------------------------------------------------------------------------
2//
3// Copyright (C) 2025-present by Pablo Antolin
4//
5// This file is part of the QUGaR library.
6//
7// SPDX-License-Identifier: MIT
8//
9// --------------------------------------------------------------------------
10
11#ifndef QUGAR_POINT_HPP
12#define QUGAR_POINT_HPP
13
20
21#include <qugar/types.hpp>
22#include <qugar/vector.hpp>
23
24#include <cstddef>
25#include <vector>
26
27namespace qugar {
28
29class Tolerance;
30
34template<int dim, typename T = real> using Point = Vector<T, dim>;
35
36
49template<int dim>
50void find_coincident_points(const std::vector<Point<dim>> &points,
51 const Tolerance &tol,
52 std::vector<std::size_t> &points_map);
53
66template<int dim>
67void make_points_unique(std::vector<Point<dim>> &points, const Tolerance &tol, std::vector<std::size_t> &old_to_new);
68
69}// namespace qugar
70
71#endif// QUGAR_POINT_HPP
qugar::Tolerance
Class for tolerance related computations.
Definition tolerance.hpp:33
qugar
QUGaR's main namespace.
Definition affine_transf.hpp:28
qugar::make_points_unique
void make_points_unique(std::vector< Point< dim > > &points, const Tolerance &tol, std::vector< std::size_t > &old_to_new)
Makes a given vector of points unique by merging coincident points.
qugar::find_coincident_points
void find_coincident_points(const std::vector< Point< dim > > &points, const Tolerance &tol, std::vector< std::size_t > &points_map)
Finds coincident points in a given set of points.
qugar::Vector
::algoim::uvector< T, dim > Vector
Class representing a vector.
Definition vector.hpp:31
qugar::Point
Vector< T, dim > Point
Class representing a dim-dimensional Point.
Definition point.hpp:34
types.hpp
Declaration of types.