| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | /* | ||
| 2 | * Copyright (c) 2000-2022 Inria | ||
| 3 | * All rights reserved. | ||
| 4 | * | ||
| 5 | * Redistribution and use in source and binary forms, with or without | ||
| 6 | * modification, are permitted provided that the following conditions are met: | ||
| 7 | * | ||
| 8 | * * Redistributions of source code must retain the above copyright notice, | ||
| 9 | * this list of conditions and the following disclaimer. | ||
| 10 | * * Redistributions in binary form must reproduce the above copyright notice, | ||
| 11 | * this list of conditions and the following disclaimer in the documentation | ||
| 12 | * and/or other materials provided with the distribution. | ||
| 13 | * * Neither the name of the ALICE Project-Team nor the names of its | ||
| 14 | * contributors may be used to endorse or promote products derived from this | ||
| 15 | * software without specific prior written permission. | ||
| 16 | * | ||
| 17 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" | ||
| 18 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
| 19 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | ||
| 20 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE | ||
| 21 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR | ||
| 22 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF | ||
| 23 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS | ||
| 24 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN | ||
| 25 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | ||
| 26 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE | ||
| 27 | * POSSIBILITY OF SUCH DAMAGE. | ||
| 28 | * | ||
| 29 | * Contact: Bruno Levy | ||
| 30 | * | ||
| 31 | * https://www.inria.fr/fr/bruno-levy | ||
| 32 | * | ||
| 33 | * Inria, | ||
| 34 | * Domaine de Voluceau, | ||
| 35 | * 78150 Le Chesnay - Rocquencourt | ||
| 36 | * FRANCE | ||
| 37 | * | ||
| 38 | */ | ||
| 39 | |||
| 40 | #ifndef H_HEXDOM_ALGO_POLYGON_H | ||
| 41 | #define H_HEXDOM_ALGO_POLYGON_H | ||
| 42 | |||
| 43 | #include <exploragram/basic/common.h> | ||
| 44 | #include <exploragram/hexdom/geometry.h> | ||
| 45 | #include <exploragram/hexdom/mesh_utils.h> | ||
| 46 | #include <geogram/mesh/mesh_io.h> | ||
| 47 | |||
| 48 | #include <assert.h> | ||
| 49 | #include <cmath> | ||
| 50 | |||
| 51 | namespace GEO { | ||
| 52 | |||
| 53 | struct EXPLORAGRAM_API Poly2d { | ||
| 54 | |||
| 55 | ✗ | Poly2d(vector<vec2> &p_pts) : pts(p_pts) { | |
| 56 | ✗ | } | |
| 57 | |||
| 58 | vec2 barycenter(); | ||
| 59 | |||
| 60 | void dump_contour(); | ||
| 61 | |||
| 62 | // returns 1024. if concave angle is encountered or if proposed triangle contains one of pts | ||
| 63 | // otherwise returns max angle of the proposed triangle | ||
| 64 | double cost(index_t i, index_t j, index_t k) ; | ||
| 65 | |||
| 66 | bool try_triangulate_minweight(vector<index_t>& triangles); | ||
| 67 | |||
| 68 | // find parity of original points | ||
| 69 | index_t parity_of_original_points() ; | ||
| 70 | |||
| 71 | bool middle_point_quadrangulate(vector<index_t>& quads); | ||
| 72 | |||
| 73 | bool quads_are_valid(vector<index_t>& quads); | ||
| 74 | |||
| 75 | bool try_quad_cover(vector<index_t>& quads); | ||
| 76 | bool try_quadrangulate(vector<index_t>& quads); | ||
| 77 | |||
| 78 | vector<vec2> &pts; | ||
| 79 | }; | ||
| 80 | |||
| 81 | |||
| 82 | struct EXPLORAGRAM_API Poly3d { | ||
| 83 | ✗ | Poly3d(vector<vec3> &p_pts) : pts(p_pts) { | |
| 84 | ✗ | } | |
| 85 | void dump_contour(); | ||
| 86 | vec3 barycenter(); | ||
| 87 | |||
| 88 | vec3 normal(); | ||
| 89 | |||
| 90 | bool try_triangulate_minweight(vector<index_t>& triangles); | ||
| 91 | |||
| 92 | /** | ||
| 93 | * WARNING: it may introduce new vertices in pts | ||
| 94 | */ | ||
| 95 | bool try_quadrangulate(vector<index_t>& quads); | ||
| 96 | |||
| 97 | vector<vec3> &pts; | ||
| 98 | }; | ||
| 99 | |||
| 100 | } | ||
| 101 | #endif | ||
| 102 |