| 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 | #include <geogram/mesh/mesh_smoothing.h> | ||
| 41 | #include <geogram/mesh/mesh.h> | ||
| 42 | #include <geogram/NL/nl.h> | ||
| 43 | |||
| 44 | namespace GEO { | ||
| 45 | |||
| 46 | ✗ | void GEOGRAM_API mesh_smooth(Mesh& M) { | |
| 47 | // Chain corners around vertices | ||
| 48 | ✗ | vector<index_t> v2c(M.vertices.nb(), NO_INDEX); | |
| 49 | ✗ | vector<index_t> next_c_around_v(M.facet_corners.nb(), NO_INDEX); | |
| 50 | ✗ | vector<index_t> c2f(M.facet_corners.nb(), NO_INDEX); | |
| 51 | ✗ | for(index_t f: M.facets) { | |
| 52 | ✗ | for(index_t c: M.facets.corners(f)) { | |
| 53 | ✗ | index_t v = M.facet_corners.vertex(c); | |
| 54 | ✗ | next_c_around_v[c] = v2c[v]; | |
| 55 | ✗ | v2c[v] = c; | |
| 56 | ✗ | c2f[c] = f; | |
| 57 | } | ||
| 58 | } | ||
| 59 | |||
| 60 | ✗ | nlNewContext(); | |
| 61 | |||
| 62 | ✗ | nlSolverParameteri(NL_LEAST_SQUARES, NL_TRUE); | |
| 63 | ✗ | nlSolverParameteri(NL_NB_VARIABLES, NLint(M.vertices.nb())); | |
| 64 | ✗ | nlSolverParameteri(NL_NB_SYSTEMS, NLint(M.vertices.dimension())); | |
| 65 | ✗ | nlEnable(NL_NORMALIZE_ROWS); | |
| 66 | ✗ | nlEnable(NL_VARIABLES_BUFFER); | |
| 67 | |||
| 68 | ✗ | Attribute<bool> v_is_locked(M.vertices.attributes(), "selection"); | |
| 69 | |||
| 70 | ✗ | nlBegin(NL_SYSTEM); | |
| 71 | |||
| 72 | ✗ | for(index_t coord=0; coord<M.vertices.dimension(); ++coord) { | |
| 73 | // Bind directly the variables buffer to the coordinates in | ||
| 74 | // the mesh, to avoid copying data. | ||
| 75 | ✗ | nlBindBuffer( | |
| 76 | NL_VARIABLES_BUFFER, NLuint(coord), | ||
| 77 | ✗ | M.vertices.point_ptr(0) + coord, | |
| 78 | ✗ | NLuint(sizeof(double)*M.vertices.dimension()) | |
| 79 | ); | ||
| 80 | } | ||
| 81 | |||
| 82 | ✗ | for(index_t v: M.vertices) { | |
| 83 | ✗ | if(v_is_locked[v]) { | |
| 84 | ✗ | nlLockVariable(v); | |
| 85 | } | ||
| 86 | } | ||
| 87 | |||
| 88 | ✗ | nlBegin(NL_MATRIX); | |
| 89 | ✗ | for(index_t v: M.vertices) { | |
| 90 | ✗ | nlBegin(NL_ROW); | |
| 91 | ✗ | index_t count = 0; | |
| 92 | ✗ | for(index_t c = v2c[v]; c != NO_INDEX; c = next_c_around_v[c]) { | |
| 93 | ✗ | index_t f = c2f[c]; | |
| 94 | ✗ | index_t c2 = M.facets.next_corner_around_facet(f,c); | |
| 95 | ✗ | index_t w = M.facet_corners.vertex(c2); | |
| 96 | ✗ | nlCoefficient(w, 1.0); | |
| 97 | ✗ | ++count; | |
| 98 | } | ||
| 99 | ✗ | nlCoefficient(v, -double(count)); | |
| 100 | ✗ | nlEnd(NL_ROW); | |
| 101 | } | ||
| 102 | ✗ | nlEnd(NL_MATRIX); | |
| 103 | ✗ | nlEnd(NL_SYSTEM); | |
| 104 | |||
| 105 | ✗ | nlSolve(); | |
| 106 | |||
| 107 | ✗ | nlDeleteContext(nlGetCurrent()); | |
| 108 | ✗ | } | |
| 109 | |||
| 110 | } | ||
| 111 |