2
// Copyright (C) 2006-2011 Tobias Sargeant (tobias.sargeant@gmail.com).
3
// All rights reserved.
5
// This file is part of the Carve CSG Library (http://carve-csg.com/)
7
// This file may be used under the terms of the GNU General Public
8
// License version 2.0 as published by the Free Software Foundation
9
// and appearing in the file LICENSE.GPL2 included in the packaging of
12
// This file is provided "AS IS" with NO WARRANTY OF ANY KIND,
13
// INCLUDING THE WARRANTIES OF DESIGN, MERCHANTABILITY AND FITNESS FOR
14
// A PARTICULAR PURPOSE.
18
#if defined(HAVE_CONFIG_H)
19
# include <carve_config.h>
22
#include <carve/geom.hpp>
23
#include <carve/vector.hpp>
24
#include <carve/polyline.hpp>
28
carve::geom3d::AABB Polyline::aabb() const {
29
return carve::geom3d::AABB(vbegin(), vend(), vec_adapt_vertex_ptr());
32
PolylineSet::PolylineSet(const std::vector<carve::geom3d::Vector> &points) {
33
vertices.resize(points.size());
34
for (size_t i = 0; i < points.size(); ++i) vertices[i].v = points[i];
35
aabb.fit(points.begin(), points.end(), carve::geom3d::vec_adapt_ident());
38
void PolylineSet::sortVertices(const carve::geom3d::Vector &axis) {
39
std::vector<std::pair<double, size_t> > temp;
40
temp.reserve(vertices.size());
41
for (size_t i = 0; i < vertices.size(); ++i) {
42
temp.push_back(std::make_pair(dot(axis, vertices[i].v), i));
44
std::sort(temp.begin(), temp.end());
45
std::vector<Vertex> vnew;
46
std::vector<int> revmap;
47
vnew.reserve(vertices.size());
48
revmap.resize(vertices.size());
50
for (size_t i = 0; i < vertices.size(); ++i) {
51
vnew.push_back(vertices[temp[i].second]);
52
revmap[temp[i].second] = i;
55
for (line_iter i = lines.begin(); i != lines.end(); ++i) {
57
for (size_t j = 0; j < l.edges.size(); ++j) {
58
PolylineEdge &e = *l.edges[j];
59
if (e.v1) e.v1 = &vnew[revmap[vertexToIndex_fast(e.v1)]];
60
if (e.v2) e.v2 = &vnew[revmap[vertexToIndex_fast(e.v2)]];