songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Adress some items of Issue #8802

This commit is contained in:
Andreas Fabri 2025-04-28 15:39:43 +01:00
parent 338b31bf32
commit 9a134d2145
4 changed files with 7 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
Triangulation/benchmark/Triangulation/bench6d.cpp
View File

@ -50,6 +50,7 @@ int main(int argc, char* argv[])
std::vector<Triangulation::Full_cell_handle> infinite_cells; std::vector<Triangulation::Full_cell_handle> infinite_cells;
t.tds().incident_full_cells(t.infinite_vertex(), std::back_inserter(infinite_cells)); t.tds().incident_full_cells(t.infinite_vertex(), std::back_inserter(infinite_cells));
return 0;
std::set<std::pair<std::ptrdiff_t, std::ptrdiff_t>> edges; std::set<std::pair<std::ptrdiff_t, std::ptrdiff_t>> edges;
for(auto ch : infinite_cells) { for(auto ch : infinite_cells) {

2
Triangulation/doc/Triangulation/CGAL/Triangulation.h
View File

@ -520,7 +520,7 @@ position `p`. Returns a handle to that vertex.
\pre The boundary of the union of full cells incident to `f` must be a triangulation of a \pre The boundary of the union of full cells incident to `f` must be a triangulation of a
sphere of dimension `tr`.`current_dimension()`). sphere of dimension `tr`.`current_dimension()`).
*/ */
Vertex_handle collapse_face(const Point & p, const Face & f); Vertex_handle contract_face(const Point & p, const Face & f);
/// @} /// @}

6
Triangulation/doc/Triangulation/Concepts/TriangulationDataStructure.h
View File

@ -456,14 +456,14 @@ Insertion in a hole, \f$ d=2\f$
\cgalAdvancedEnd \cgalAdvancedEnd
*/ */
template< class ForwardIterator > Vertex_handle template< class ForwardIterator > Vertex_handle
insert_in_hole(ForwardIterator start, ForwardIterator end, Facet f); insert_in_hole(ForwardIterator s, ForwardIterator e, Facet f);
/*! /*!
Same as above, but handles to the new full cells are Same as above, but handles to the new full cells are
appended to the `out` output iterator. appended to the `out` output iterator.
*/ */
template< class ForwardIterator, class OutputIterator > template< class ForwardIterator, class OutputIterator >
Vertex_handle insert_in_hole(ForwardIterator start, ForwardIterator end, Facet Vertex_handle insert_in_hole(ForwardIterator s, ForwardIterator e, Facet
f, OutputIterator out); f, OutputIterator out);
/*! /*!
@ -594,7 +594,7 @@ Calls `delete_full_cell` over an iterator range of value type `Full_cell_handle`
\cgalAdvancedEnd \cgalAdvancedEnd
*/ */
template< typename ForwardIterator > void template< typename ForwardIterator > void
delete_full_cells(ForwardIterator start, ForwardIterator end); delete_full_cells(ForwardIterator s, ForwardIterator e);
/// @} /// @}

4
Triangulation/include/CGAL/Triangulation_data_structure.h
View File

@ -309,10 +309,10 @@ public:
return s->mirror_index(i); return s->mirror_index(i);
} }
int mirror_vertex(Full_cell_handle s, int i) const /* Concept */ Vertex_handle mirror_vertex(Full_cell_handle s, int i) const /* Concept */
{ {
CGAL_precondition(Full_cell_handle() != s && check_range(i)); CGAL_precondition(Full_cell_handle() != s && check_range(i));
return s->mirror_vertex(i); return s->mirror_vertex(i, current_dimension);
} }
// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - FACETS OPERATIONS // - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - FACETS OPERATIONS