File: layeredchain.cpp

package info (click to toggle)
regina-normal 7.4.1-1.1
  • links: PTS
  • area: main
  • in suites: forky, sid
  • size: 154,244 kB
  • sloc: cpp: 295,026; xml: 9,992; sh: 1,344; python: 1,225; perl: 616; ansic: 138; makefile: 26
file content (125 lines) | stat: -rw-r--r-- 4,882 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125

/**************************************************************************
 *                                                                        *
 *  Regina - A Normal Surface Theory Calculator                           *
 *  Computational Engine                                                  *
 *                                                                        *
 *  Copyright (c) 1999-2025, Ben Burton                                   *
 *  For further details contact Ben Burton (bab@debian.org).              *
 *                                                                        *
 *  This program is free software; you can redistribute it and/or         *
 *  modify it under the terms of the GNU General Public License as        *
 *  published by the Free Software Foundation; either version 2 of the    *
 *  License, or (at your option) any later version.                       *
 *                                                                        *
 *  As an exception, when this program is distributed through (i) the     *
 *  App Store by Apple Inc.; (ii) the Mac App Store by Apple Inc.; or     *
 *  (iii) Google Play by Google Inc., then that store may impose any      *
 *  digital rights management, device limits and/or redistribution        *
 *  restrictions that are required by its terms of service.               *
 *                                                                        *
 *  This program is distributed in the hope that it will be useful, but   *
 *  WITHOUT ANY WARRANTY; without even the implied warranty of            *
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU     *
 *  General Public License for more details.                              *
 *                                                                        *
 *  You should have received a copy of the GNU General Public License     *
 *  along with this program. If not, see <https://www.gnu.org/licenses/>. *
 *                                                                        *
 **************************************************************************/

#include "algebra/abeliangroup.h"
#include "manifold/handlebody.h"
#include "triangulation/dim3.h"
#include "subcomplex/layeredchain.h"

namespace regina {

bool LayeredChain::extendAbove() {
    Tetrahedron<3>* adj = top_->adjacentTetrahedron(topVertexRoles_[0]);
    if (adj == bottom_ || adj == top_ || ! adj)
        return false;
    if (adj != top_->adjacentTetrahedron(topVertexRoles_[3]))
        return false;

    // Check the gluings.
    Perm<4> adjRoles = top_->adjacentGluing(topVertexRoles_[0]) *
        topVertexRoles_ * Perm<4>(0, 1);
    if (adjRoles != top_->adjacentGluing(topVertexRoles_[3]) *
            topVertexRoles_ * Perm<4>(2, 3))
        return false;

    // We can extend the layered chain.
    top_ = adj;
    topVertexRoles_ = adjRoles;
    ++index_;
    return true;
}

bool LayeredChain::extendBelow() {
    Tetrahedron<3>* adj = bottom_->adjacentTetrahedron(bottomVertexRoles_[1]);
    if (adj == bottom_ || adj == top_ || ! adj)
        return false;
    if (adj != bottom_->adjacentTetrahedron(bottomVertexRoles_[2]))
        return false;

    // Check the gluings.
    Perm<4> adjRoles = bottom_->adjacentGluing(bottomVertexRoles_[1])
        * bottomVertexRoles_ * Perm<4>(0, 1);
    if (adjRoles != bottom_->adjacentGluing(bottomVertexRoles_[2])
            * bottomVertexRoles_ * Perm<4>(2, 3))
        return false;

    // We can extend the layered chain.
    bottom_ = adj;
    bottomVertexRoles_ = adjRoles;
    ++index_;
    return true;
}

bool LayeredChain::extendMaximal() {
    bool changed = false;
    while (extendAbove())
        changed = true;
    while (extendBelow())
        changed = true;
    return changed;
}

void LayeredChain::reverse() {
    std::swap(bottom_, top_);

    Perm<4> pTmp = topVertexRoles_ * Perm<4>(1, 0, 3, 2);
    topVertexRoles_ = bottomVertexRoles_ * Perm<4>(1, 0, 3, 2);
    bottomVertexRoles_ = pTmp;
}

void LayeredChain::invert() {
    topVertexRoles_ = topVertexRoles_ * Perm<4>(3, 2, 1, 0);
    bottomVertexRoles_ = bottomVertexRoles_ * Perm<4>(3, 2, 1, 0);
}

std::unique_ptr<Manifold> LayeredChain::manifold() const {
    return std::make_unique<Handlebody>(index_ <= 1 ? 0 : 1);
}

AbelianGroup LayeredChain::homology() const {
    if (index_ > 1)
        return AbelianGroup(1);
    else
        return AbelianGroup();
}

void LayeredChain::writeTextShort(std::ostream& out) const {
    if (index_ == 1) {
        out << "Chain(1), tetrahedron "
            << bottom_->index() << " (" << bottomVertexRoles_ << ")";
    } else {
        out << "Chain(" << index_ << "), tetrahedra "
            << bottom_->index() << " (" << bottomVertexRoles_ << ") .. "
            << top_->index() << " (" << topVertexRoles_ << ')';
    }
}

} // namespace regina