OpenMesh
ArrayKernel.hh
1/* ========================================================================= *
2 * *
3 * OpenMesh *
4 * Copyright (c) 2001-2025, RWTH-Aachen University *
5 * Department of Computer Graphics and Multimedia *
6 * All rights reserved. *
7 * www.openmesh.org *
8 * *
9 *---------------------------------------------------------------------------*
10 * This file is part of OpenMesh. *
11 *---------------------------------------------------------------------------*
12 * *
13 * Redistribution and use in source and binary forms, with or without *
14 * modification, are permitted provided that the following conditions *
15 * are met: *
16 * *
17 * 1. Redistributions of source code must retain the above copyright notice, *
18 * this list of conditions and the following disclaimer. *
19 * *
20 * 2. Redistributions in binary form must reproduce the above copyright *
21 * notice, this list of conditions and the following disclaimer in the *
22 * documentation and/or other materials provided with the distribution. *
23 * *
24 * 3. Neither the name of the copyright holder nor the names of its *
25 * contributors may be used to endorse or promote products derived from *
26 * this software without specific prior written permission. *
27 * *
28 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS *
29 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED *
30 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A *
31 * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER *
32 * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, *
33 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, *
34 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR *
35 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF *
36 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING *
37 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS *
38 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. *
39 * *
40 * ========================================================================= */
41
42
43
44
45//=============================================================================
46//
47// CLASS ArrayKernel
48//
49//=============================================================================
50
51
52#ifndef OPENMESH_ARRAY_KERNEL_HH
53#define OPENMESH_ARRAY_KERNEL_HH
54
55
56//== INCLUDES =================================================================
57#include <vector>
58
59#include <OpenMesh/Core/System/config.h>
60#include <OpenMesh/Core/Utils/GenProg.hh>
61
62#include <OpenMesh/Core/Mesh/ArrayItems.hh>
63#include <OpenMesh/Core/Mesh/BaseKernel.hh>
64#include <OpenMesh/Core/Mesh/Status.hh>
65
66//== NAMESPACES ===============================================================
67namespace OpenMesh {
68
69
70//== CLASS DEFINITION =========================================================
87class OPENMESHDLLEXPORT ArrayKernel : public BaseKernel, public ArrayItems
88{
89public:
90
91 // handles
101
102public:
103
104 // --- constructor/destructor ---
105 ArrayKernel();
106 virtual ~ArrayKernel();
107
114 void assign_connectivity(const ArrayKernel& _other);
115
116 // --- handle -> item ---
117 VertexHandle handle(const Vertex& _v) const;
118
119 HalfedgeHandle handle(const Halfedge& _he) const;
120
121 EdgeHandle handle(const Edge& _e) const;
122
123 FaceHandle handle(const Face& _f) const;
124
125
127 bool is_valid_handle(VertexHandle _vh) const;
128
130 bool is_valid_handle(HalfedgeHandle _heh) const;
131
133 bool is_valid_handle(EdgeHandle _eh) const;
134
136 bool is_valid_handle(FaceHandle _fh) const;
137
138
139 // --- item -> handle ---
140 const Vertex& vertex(VertexHandle _vh) const
141 {
142 assert(is_valid_handle(_vh));
143 return vertices_[_vh.idx()];
144 }
145
146 Vertex& vertex(VertexHandle _vh)
147 {
148 assert(is_valid_handle(_vh));
149 return vertices_[_vh.idx()];
150 }
151
152 const Halfedge& halfedge(HalfedgeHandle _heh) const
153 {
154 assert(is_valid_handle(_heh));
155 return edges_[_heh.idx() >> 1].halfedges_[_heh.idx() & 1];
156 }
157
158 Halfedge& halfedge(HalfedgeHandle _heh)
159 {
160 assert(is_valid_handle(_heh));
161 return edges_[_heh.idx() >> 1].halfedges_[_heh.idx() & 1];
162 }
163
164 const Edge& edge(EdgeHandle _eh) const
165 {
166 assert(is_valid_handle(_eh));
167 return edges_[_eh.idx()];
168 }
169
170 Edge& edge(EdgeHandle _eh)
171 {
172 assert(is_valid_handle(_eh));
173 return edges_[_eh.idx()];
174 }
175
176 const Face& face(FaceHandle _fh) const
177 {
178 assert(is_valid_handle(_fh));
179 return faces_[_fh.idx()];
180 }
181
182 Face& face(FaceHandle _fh)
183 {
184 assert(is_valid_handle(_fh));
185 return faces_[_fh.idx()];
186 }
187
188 // --- get i'th items ---
189
190 VertexHandle vertex_handle(unsigned int _i) const
191 { return (_i < n_vertices()) ? handle( vertices_[_i] ) : VertexHandle(); }
192
193 HalfedgeHandle halfedge_handle(unsigned int _i) const
194 {
195 return (_i < n_halfedges()) ?
196 halfedge_handle(edge_handle(_i/2), _i%2) : HalfedgeHandle();
197 }
198
199 EdgeHandle edge_handle(unsigned int _i) const
200 { return (_i < n_edges()) ? handle(edges_[_i]) : EdgeHandle(); }
201
202 FaceHandle face_handle(unsigned int _i) const
203 { return (_i < n_faces()) ? handle(faces_[_i]) : FaceHandle(); }
204
205public:
206
217 {
218 vertices_.push_back(Vertex());
219 vprops_resize(n_vertices());//TODO:should it be push_back()?
220
221 return handle(vertices_.back());
222 }
223
235 {
236 vertices_.push_back(Vertex());
237 vprops_resize_if_smaller(n_vertices());//TODO:should it be push_back()?
238
239 return handle(vertices_.back());
240 }
241
242 inline HalfedgeHandle new_edge(VertexHandle _start_vh, VertexHandle _end_vh)
243 {
244// assert(_start_vh != _end_vh);
245 edges_.push_back(Edge());
246 eprops_resize(n_edges());//TODO:should it be push_back()?
247 hprops_resize(n_halfedges());//TODO:should it be push_back()?
248
249 EdgeHandle eh(handle(edges_.back()));
250 HalfedgeHandle heh0(halfedge_handle(eh, 0));
251 HalfedgeHandle heh1(halfedge_handle(eh, 1));
252 set_vertex_handle(heh0, _end_vh);
253 set_vertex_handle(heh1, _start_vh);
254 return heh0;
255 }
256
257 inline FaceHandle new_face()
258 {
259 faces_.push_back(Face());
260 fprops_resize(n_faces());
261 return handle(faces_.back());
262 }
263
264 inline FaceHandle new_face(const Face& _f)
265 {
266 faces_.push_back(_f);
267 fprops_resize(n_faces());
268 return handle(faces_.back());
269 }
270
271public:
272 // --- resize/reserve ---
273 void resize( size_t _n_vertices, size_t _n_edges, size_t _n_faces );
274 void reserve(size_t _n_vertices, size_t _n_edges, size_t _n_faces );
275
276 // --- deletion ---
292 void garbage_collection(bool _v=true, bool _e=true, bool _f=true);
293
313 template<typename std_API_Container_VHandlePointer,
314 typename std_API_Container_HHandlePointer,
315 typename std_API_Container_FHandlePointer>
316 void garbage_collection(std_API_Container_VHandlePointer& vh_to_update,
317 std_API_Container_HHandlePointer& hh_to_update,
318 std_API_Container_FHandlePointer& fh_to_update,
319 bool _v=true, bool _e=true, bool _f=true);
320
322 void clear();
323
333 void clean();
334
342 void clean_keep_reservation();
343
344 // --- number of items ---
345 size_t n_vertices() const override { return vertices_.size(); }
346 size_t n_halfedges() const override { return 2*edges_.size(); }
347 size_t n_edges() const override { return edges_.size(); }
348 size_t n_faces() const override { return faces_.size(); }
349
350 bool vertices_empty() const { return vertices_.empty(); }
351 bool halfedges_empty() const { return edges_.empty(); }
352 bool edges_empty() const { return edges_.empty(); }
353 bool faces_empty() const { return faces_.empty(); }
354
355 // --- vertex connectivity ---
356
357 HalfedgeHandle halfedge_handle(VertexHandle _vh) const
358 { return vertex(_vh).halfedge_handle_; }
359
360 void set_halfedge_handle(VertexHandle _vh, HalfedgeHandle _heh)
361 {
362// assert(is_valid_handle(_heh));
363 vertex(_vh).halfedge_handle_ = _heh;
364 }
365
366 bool is_isolated(VertexHandle _vh) const
367 { return !halfedge_handle(_vh).is_valid(); }
368
369 void set_isolated(VertexHandle _vh)
370 { vertex(_vh).halfedge_handle_.invalidate(); }
371
372 unsigned int delete_isolated_vertices();
373
374 // --- halfedge connectivity ---
375 VertexHandle to_vertex_handle(HalfedgeHandle _heh) const
376 { return halfedge(_heh).vertex_handle_; }
377
378 VertexHandle from_vertex_handle(HalfedgeHandle _heh) const
379 { return to_vertex_handle(opposite_halfedge_handle(_heh)); }
380
381 void set_vertex_handle(HalfedgeHandle _heh, VertexHandle _vh)
382 {
383// assert(is_valid_handle(_vh));
384 halfedge(_heh).vertex_handle_ = _vh;
385 }
386
387 FaceHandle face_handle(HalfedgeHandle _heh) const
388 { return halfedge(_heh).face_handle_; }
389
390 void set_face_handle(HalfedgeHandle _heh, FaceHandle _fh)
391 {
392// assert(is_valid_handle(_fh));
393 halfedge(_heh).face_handle_ = _fh;
394 }
395
396 void set_boundary(HalfedgeHandle _heh)
397 { halfedge(_heh).face_handle_.invalidate(); }
398
401 { return !face_handle(_heh).is_valid(); }
402
403 HalfedgeHandle next_halfedge_handle(HalfedgeHandle _heh) const
404 { return halfedge(_heh).next_halfedge_handle_; }
405
406 void set_next_halfedge_handle(HalfedgeHandle _heh, HalfedgeHandle _nheh)
407 {
408 assert(is_valid_handle(_nheh));
409// assert(to_vertex_handle(_heh) == from_vertex_handle(_nheh));
410 halfedge(_heh).next_halfedge_handle_ = _nheh;
411 set_prev_halfedge_handle(_nheh, _heh);
412 }
413
414
415 void set_prev_halfedge_handle(HalfedgeHandle _heh, HalfedgeHandle _pheh)
416 {
417 assert(is_valid_handle(_pheh));
418 set_prev_halfedge_handle(_heh, _pheh, HasPrevHalfedge());
419 }
420
421 void set_prev_halfedge_handle(HalfedgeHandle _heh, HalfedgeHandle _pheh,
422 GenProg::TrueType)
423 { halfedge(_heh).prev_halfedge_handle_ = _pheh; }
424
425 void set_prev_halfedge_handle(HalfedgeHandle /* _heh */, HalfedgeHandle /* _pheh */,
426 GenProg::FalseType)
427 {}
428
429 HalfedgeHandle prev_halfedge_handle(HalfedgeHandle _heh) const
430 { return prev_halfedge_handle(_heh, HasPrevHalfedge() ); }
431
432 HalfedgeHandle prev_halfedge_handle(HalfedgeHandle _heh, GenProg::TrueType) const
433 { return halfedge(_heh).prev_halfedge_handle_; }
434
435 HalfedgeHandle prev_halfedge_handle(HalfedgeHandle _heh, GenProg::FalseType) const
436 {
437 if (is_boundary(_heh))
438 {//iterating around the vertex should be faster than iterating the boundary
439 HalfedgeHandle curr_heh(opposite_halfedge_handle(_heh));
440 HalfedgeHandle next_heh(next_halfedge_handle(curr_heh));
441 do
442 {
443 curr_heh = opposite_halfedge_handle(next_heh);
444 next_heh = next_halfedge_handle(curr_heh);
445 }
446 while (next_heh != _heh);
447 return curr_heh;
448 }
449 else
450 {
451 HalfedgeHandle heh(_heh);
452 HalfedgeHandle next_heh(next_halfedge_handle(heh));
453 while (next_heh != _heh) {
454 heh = next_heh;
455 next_heh = next_halfedge_handle(next_heh);
456 }
457 return heh;
458 }
459 }
460
461
462 HalfedgeHandle opposite_halfedge_handle(HalfedgeHandle _heh) const
463 { return HalfedgeHandle(_heh.idx() ^ 1); }
464
465
466 HalfedgeHandle ccw_rotated_halfedge_handle(HalfedgeHandle _heh) const
467 { return opposite_halfedge_handle(prev_halfedge_handle(_heh)); }
468
469
470 HalfedgeHandle cw_rotated_halfedge_handle(HalfedgeHandle _heh) const
471 { return next_halfedge_handle(opposite_halfedge_handle(_heh)); }
472
473 // --- edge connectivity ---
474 static HalfedgeHandle s_halfedge_handle(EdgeHandle _eh, unsigned int _i = 0)
475 {
476 assert(_i<=1);
477 return HalfedgeHandle((_eh.idx() << 1) + _i);
478 }
479
480 static EdgeHandle s_edge_handle(HalfedgeHandle _heh)
481 { return EdgeHandle(_heh.idx() >> 1); }
482
483 HalfedgeHandle halfedge_handle(EdgeHandle _eh, unsigned int _i = 0) const
484 {
485 return s_halfedge_handle(_eh, _i);
486 }
487
488 EdgeHandle edge_handle(HalfedgeHandle _heh) const
489 { return s_edge_handle(_heh); }
490
491 // --- face connectivity ---
492 HalfedgeHandle halfedge_handle(FaceHandle _fh) const
493 { return face(_fh).halfedge_handle_; }
494
495 void set_halfedge_handle(FaceHandle _fh, HalfedgeHandle _heh)
496 {
497// assert(is_valid_handle(_heh));
498 face(_fh).halfedge_handle_ = _heh;
499 }
500
502 //------------------------------------------------------------ vertex status
504 { return property(vertex_status_, _vh); }
505
506 StatusInfo& status(VertexHandle _vh)
507 { return property(vertex_status_, _vh); }
508
514 PropertyT<StatusInfo> &status_prop = property(vertex_status_);
515 PropertyT<StatusInfo>::vector_type &sprop_v = status_prop.data_vector();
516 std::fill(sprop_v.begin(), sprop_v.begin() + n_vertices(), StatusInfo());
517 }
518
519 //----------------------------------------------------------- halfedge status
520 const StatusInfo& status(HalfedgeHandle _hh) const
521 { return property(halfedge_status_, _hh); }
522
523 StatusInfo& status(HalfedgeHandle _hh)
524 { return property(halfedge_status_, _hh); }
525
526 //--------------------------------------------------------------- edge status
527 const StatusInfo& status(EdgeHandle _eh) const
528 { return property(edge_status_, _eh); }
529
530 StatusInfo& status(EdgeHandle _eh)
531 { return property(edge_status_, _eh); }
532
533 //--------------------------------------------------------------- face status
534 const StatusInfo& status(FaceHandle _fh) const
535 { return property(face_status_, _fh); }
536
537 StatusInfo& status(FaceHandle _fh)
538 { return property(face_status_, _fh); }
539
540 inline bool has_vertex_status() const
541 { return vertex_status_.is_valid(); }
542
543 inline bool has_halfedge_status() const
544 { return halfedge_status_.is_valid(); }
545
546 inline bool has_edge_status() const
547 { return edge_status_.is_valid(); }
548
549 inline bool has_face_status() const
550 { return face_status_.is_valid(); }
551
552 inline VertexStatusPropertyHandle vertex_status_pph() const
553 { return vertex_status_; }
554
555 inline HalfedgeStatusPropertyHandle halfedge_status_pph() const
556 { return halfedge_status_; }
557
558 inline EdgeStatusPropertyHandle edge_status_pph() const
559 { return edge_status_; }
560
561 inline FaceStatusPropertyHandle face_status_pph() const
562 { return face_status_; }
563
566 { return vertex_status_pph(); }
567
568 inline HalfedgeStatusPropertyHandle status_pph(HalfedgeHandle /*_hnd*/) const
569 { return halfedge_status_pph(); }
570
571 inline EdgeStatusPropertyHandle status_pph(EdgeHandle /*_hnd*/) const
572 { return edge_status_pph(); }
573
574 inline FaceStatusPropertyHandle status_pph(FaceHandle /*_hnd*/) const
575 { return face_status_pph(); }
576
579 {
580 if (!refcount_vstatus_++)
581 add_property( vertex_status_, "v:status" );
582 }
583
584 void request_halfedge_status()
585 {
586 if (!refcount_hstatus_++)
587 add_property( halfedge_status_, "h:status" );
588 }
589
590 void request_edge_status()
591 {
592 if (!refcount_estatus_++)
593 add_property( edge_status_, "e:status" );
594 }
595
596 void request_face_status()
597 {
598 if (!refcount_fstatus_++)
599 add_property( face_status_, "f:status" );
600 }
601
604 {
605 if ((refcount_vstatus_ > 0) && (! --refcount_vstatus_))
606 remove_property(vertex_status_);
607 }
608
609 void release_halfedge_status()
610 {
611 if ((refcount_hstatus_ > 0) && (! --refcount_hstatus_))
612 remove_property(halfedge_status_);
613 }
614
615 void release_edge_status()
616 {
617 if ((refcount_estatus_ > 0) && (! --refcount_estatus_))
618 remove_property(edge_status_);
619 }
620
621 void release_face_status()
622 {
623 if ((refcount_fstatus_ > 0) && (! --refcount_fstatus_))
624 remove_property(face_status_);
625 }
626
628
636 template <class HandleT>
638 {
639 public:
640 typedef HandleT Handle;
641
642 protected:
643 ArrayKernel& kernel_;
644
645 public:
646 const unsigned int bit_mask_;
647
648 public:
649 StatusSetT(ArrayKernel& _kernel, const unsigned int _bit_mask)
650 : kernel_(_kernel), bit_mask_(_bit_mask)
651 {}
652
654 {}
655
656 inline bool is_in(Handle _hnd) const
657 { return kernel_.status(_hnd).is_bit_set(bit_mask_); }
658
659 inline void insert(Handle _hnd)
660 { kernel_.status(_hnd).set_bit(bit_mask_); }
661
662 inline void erase(Handle _hnd)
663 { kernel_.status(_hnd).unset_bit(bit_mask_); }
664
666 size_t size() const
667 {
668 const int n = kernel_.status_pph(Handle()).is_valid() ?
669 (int)kernel_.property(kernel_.status_pph(Handle())).n_elements() : 0;
670
671 size_t sz = 0;
672 for (int i = 0; i < n; ++i)
673 sz += (size_t)is_in(Handle(i));
674 return sz;
675 }
676
678 void clear()
679 {
680 const int n = kernel_.status_pph(Handle()).is_valid() ?
681 (int)kernel_.property(kernel_.status_pph(Handle())).n_elements() : 0;
682
683 for (int i = 0; i < n; ++i)
684 erase(Handle(i));
685 }
686 };
687
688 friend class StatusSetT<VertexHandle>;
689 friend class StatusSetT<EdgeHandle>;
690 friend class StatusSetT<FaceHandle>;
691 friend class StatusSetT<HalfedgeHandle>;
692
694 template <class HandleT>
695 class AutoStatusSetT : public StatusSetT<HandleT>
696 {
697 private:
698 typedef HandleT Handle;
699 typedef StatusSetT<Handle> Base;
700
701 public:
702 explicit AutoStatusSetT(ArrayKernel& _kernel)
703 : StatusSetT<Handle>(_kernel, _kernel.pop_bit_mask(Handle()))
704 { /*assert(size() == 0);*/ } //the set should be empty on creation
705
707 {
708 //assert(size() == 0);//the set should be empty on leave?
709 Base::kernel_.push_bit_mask(Handle(), Base::bit_mask_);
710 }
711 };
712
713 friend class AutoStatusSetT<VertexHandle>;
714 friend class AutoStatusSetT<EdgeHandle>;
715 friend class AutoStatusSetT<FaceHandle>;
716 friend class AutoStatusSetT<HalfedgeHandle>;
717
722
724 template <class HandleT>
725 class ExtStatusSetT : public AutoStatusSetT<HandleT>
726 {
727 public:
728 typedef HandleT Handle;
730
731 protected:
732 typedef std::vector<Handle> HandleContainer;
733 HandleContainer handles_;
734
735 public:
736 typedef typename HandleContainer::iterator
737 iterator;
738 typedef typename HandleContainer::const_iterator
739 const_iterator;
740 public:
741 explicit ExtStatusSetT(ArrayKernel& _kernel, size_t _capacity_hint = 0)
742 : Base(_kernel)
743 { handles_.reserve(_capacity_hint); }
744
746 { Base::clear(); }
747
748 // Complexity: O(1)
749 inline void insert(Handle _hnd)
750 {
751 if (!Base::is_in(_hnd))
752 {
753 Base::insert(_hnd);
754 handles_.push_back(_hnd);
755 }
756 }
757
759 inline void erase(Handle _hnd)
760 {
761 if (is_in(_hnd))
762 {
763 iterator it = std::find(begin(), end(), _hnd);
764 erase(it);
765 }
766 }
767
769 inline void erase(iterator _it)
770 {
771 assert(_it != const_cast<const ExtStatusSetT*>(this)->end() &&
772 Base::is_in(*_it));
773 Base::erase(*_it);
774 *_it = handles_.back();
775 _it.pop_back();
776 }
777
778 inline void clear()
779 {
780 for (iterator it = begin(); it != end(); ++it)
781 {
782 assert(Base::is_in(*it));
783 Base::erase(*it);
784 }
785 handles_.clear();
786 }
787
789 inline unsigned int size() const
790 { return handles_.size(); }
791 inline bool empty() const
792 { return handles_.empty(); }
793
794 //Vector API
795 inline iterator begin()
796 { return handles_.begin(); }
797 inline const_iterator begin() const
798 { return handles_.begin(); }
799
800 inline iterator end()
801 { return handles_.end(); }
802 inline const_iterator end() const
803 { return handles_.end(); }
804
805 inline Handle& front()
806 { return handles_.front(); }
807 inline const Handle& front() const
808 { return handles_.front(); }
809
810 inline Handle& back()
811 { return handles_.back(); }
812 inline const Handle& back() const
813 { return handles_.back(); }
814 };
815
816 typedef ExtStatusSetT<FaceHandle> ExtFaceStatusSet;
817 typedef ExtStatusSetT<VertexHandle> ExtVertexStatusSet;
818 typedef ExtStatusSetT<EdgeHandle> ExtEdgeStatusSet;
819 typedef ExtStatusSetT<HalfedgeHandle> ExtHalfedgeStatusSet;
820
821private:
822 // iterators
823 typedef std::vector<Vertex> VertexContainer;
824 typedef std::vector<Edge> EdgeContainer;
825 typedef std::vector<Face> FaceContainer;
826 typedef VertexContainer::iterator KernelVertexIter;
827 typedef VertexContainer::const_iterator KernelConstVertexIter;
828 typedef EdgeContainer::iterator KernelEdgeIter;
829 typedef EdgeContainer::const_iterator KernelConstEdgeIter;
830 typedef FaceContainer::iterator KernelFaceIter;
831 typedef FaceContainer::const_iterator KernelConstFaceIter;
832 typedef std::vector<unsigned int> BitMaskContainer;
833
834
835 KernelVertexIter vertices_begin() { return vertices_.begin(); }
836 KernelConstVertexIter vertices_begin() const { return vertices_.begin(); }
837 KernelVertexIter vertices_end() { return vertices_.end(); }
838 KernelConstVertexIter vertices_end() const { return vertices_.end(); }
839
840 KernelEdgeIter edges_begin() { return edges_.begin(); }
841 KernelConstEdgeIter edges_begin() const { return edges_.begin(); }
842 KernelEdgeIter edges_end() { return edges_.end(); }
843 KernelConstEdgeIter edges_end() const { return edges_.end(); }
844
845 KernelFaceIter faces_begin() { return faces_.begin(); }
846 KernelConstFaceIter faces_begin() const { return faces_.begin(); }
847 KernelFaceIter faces_end() { return faces_.end(); }
848 KernelConstFaceIter faces_end() const { return faces_.end(); }
849
851 inline BitMaskContainer& bit_masks(VertexHandle /*_dummy_hnd*/)
852 { return vertex_bit_masks_; }
853 inline BitMaskContainer& bit_masks(EdgeHandle /*_dummy_hnd*/)
854 { return edge_bit_masks_; }
855 inline BitMaskContainer& bit_masks(FaceHandle /*_dummy_hnd*/)
856 { return face_bit_masks_; }
857 inline BitMaskContainer& bit_masks(HalfedgeHandle /*_dummy_hnd*/)
858 { return halfedge_bit_masks_; }
859
860 template <class Handle>
861 unsigned int pop_bit_mask(Handle _hnd)
862 {
863 assert(!bit_masks(_hnd).empty());//check if the client request too many status sets
864 unsigned int bit_mask = bit_masks(_hnd).back();
865 bit_masks(_hnd).pop_back();
866 return bit_mask;
867 }
868
869 template <class Handle>
870 void push_bit_mask(Handle _hnd, unsigned int _bit_mask)
871 {
872 assert(std::find(bit_masks(_hnd).begin(), bit_masks(_hnd).end(), _bit_mask) ==
873 bit_masks(_hnd).end());//this mask should be not already used
874 bit_masks(_hnd).push_back(_bit_mask);
875 }
876
877 void init_bit_masks(BitMaskContainer& _bmc);
878 void init_bit_masks();
879
880protected:
881
882 VertexStatusPropertyHandle vertex_status_;
883 HalfedgeStatusPropertyHandle halfedge_status_;
884 EdgeStatusPropertyHandle edge_status_;
885 FaceStatusPropertyHandle face_status_;
886
887 unsigned int refcount_vstatus_;
888 unsigned int refcount_hstatus_;
889 unsigned int refcount_estatus_;
890 unsigned int refcount_fstatus_;
891
892private:
893 VertexContainer vertices_;
894 EdgeContainer edges_;
895 FaceContainer faces_;
896
897 BitMaskContainer halfedge_bit_masks_;
898 BitMaskContainer edge_bit_masks_;
899 BitMaskContainer vertex_bit_masks_;
900 BitMaskContainer face_bit_masks_;
901};
902
903
904//=============================================================================
905} // namespace OpenMesh
906//=============================================================================
907#if defined(OM_INCLUDE_TEMPLATES) && !defined(OPENMESH_ARRAY_KERNEL_C)
908# define OPENMESH_ARRAY_KERNEL_TEMPLATES
909# include "ArrayKernelT_impl.hh"
910#endif
911//=============================================================================
912#endif // OPENMESH_ARRAY_KERNEL_HH defined
913//=============================================================================
Contains all the mesh ingredients like the polygonal mesh, the triangle mesh, different mesh kernels ...
Definition: MeshItems.hh:59
Mesh kernel using arrays for mesh item storage.
Definition: ArrayKernel.hh:88
VertexStatusPropertyHandle status_pph(VertexHandle) const
status property by handle
Definition: ArrayKernel.hh:565
void reset_status()
Reinitializes the status of all vertices using the StatusInfo default constructor,...
Definition: ArrayKernel.hh:513
void release_vertex_status()
Status Release API.
Definition: ArrayKernel.hh:603
size_t n_vertices() const override
You should not use this function directly.
Definition: ArrayKernel.hh:345
void request_vertex_status()
Status Request API.
Definition: ArrayKernel.hh:578
size_t n_edges() const override
You should not use this function directly.
Definition: ArrayKernel.hh:347
bool is_boundary(HalfedgeHandle _heh) const
Is halfedge _heh a boundary halfedge (is its face handle invalid) ?
Definition: ArrayKernel.hh:400
VertexHandle new_vertex()
Add a new vertex.
Definition: ArrayKernel.hh:216
const StatusInfo & status(VertexHandle _vh) const
Status Query API.
Definition: ArrayKernel.hh:503
size_t n_faces() const override
You should not use this function directly.
Definition: ArrayKernel.hh:348
VertexHandle new_vertex_dirty()
Same as new_vertex() but uses PropertyContainer::resize_if_smaller() to resize the vertex property co...
Definition: ArrayKernel.hh:234
size_t n_halfedges() const override
You should not use this function directly.
Definition: ArrayKernel.hh:346
— StatusSet API —
Definition: ArrayKernel.hh:638
void clear()
Note: O(n) complexity.
Definition: ArrayKernel.hh:678
size_t size() const
Note: 0(n) complexity.
Definition: ArrayKernel.hh:666
AutoStatusSetT: A status set that automatically picks a status bit.
Definition: ArrayKernel.hh:696
ExtStatusSet: A status set augmented with an array.
Definition: ArrayKernel.hh:726
void erase(iterator _it)
Complexity: O(1)
Definition: ArrayKernel.hh:769
void erase(Handle _hnd)
Complexity: O(k), (k - number of the elements in the set)
Definition: ArrayKernel.hh:759
unsigned int size() const
Complexity: 0(1)
Definition: ArrayKernel.hh:789
This class provides low-level property management like adding/removing properties and access to prope...
Definition: BaseKernel.hh:98
PropertyT< T > & property(VPropHandleT< T > _ph)
In most cases you should use the convenient PropertyManager wrapper and use of this function should n...
Definition: BaseKernel.hh:310
bool is_valid() const
The handle is valid iff the index is not negative.
Definition: Handles.hh:72
void invalidate()
reset handle to be invalid
Definition: Handles.hh:77
int idx() const
Get the underlying index of this handle.
Definition: Handles.hh:69
Handle for a vertex entity.
Definition: Handles.hh:121
Handle for a halfedge entity.
Definition: Handles.hh:128
Handle for a edge entity.
Definition: Handles.hh:135
Handle for a face entity.
Definition: Handles.hh:142
Add status information to a base class.
Definition: Status.hh:95
bool is_bit_set(unsigned int _s) const
is a certain bit set ?
Definition: Status.hh:157
void set_bit(unsigned int _s)
set a certain bit
Definition: Status.hh:159
void unset_bit(unsigned int _s)
unset a certain bit
Definition: Status.hh:161
Default property class for any type T.
Definition: Property.hh:93
vector_type & data_vector()
Get reference to property vector (be careful, improper usage, e.g. resizing, may crash OpenMesh!...
Definition: Property.hh:185

Project OpenMesh, ©  Visual Computing Institute, RWTH Aachen. Documentation generated using doxygen .