1.
Triangulation_3<TriangulationTraits_3,TriangulationDataStructure_3>
bool, Triangulation_3<GT, Tds> t1 == Triangulation_3<GT, Tds> t2. Equality operator. Returns true iff there exist a bijection between the vertices of t1 and ...
2.
Kinetic::Simulator
The class Kinetic::Simulator controls kinetic data structures by maintaining a the current time and ensuring that events are processed when necessary. ...
3.
Copyright (c) 2005 Stanford University (USA). // All rights ...
It listens for PICTURE_IS_VALID notifications from the CGAL::Kinetic::Qt_gui_2 and DIRECTION_OF_TIME notifcations from the CGAL::Kinetic::Simulator and ...
4.
CGAL and the Boost Graph Library
#include "arr_rational_nt.h" #include <CGAL/Cartesian.h> #include .... In our case graph vertices represent arrangement faces. template <class IndexMap> ...
5.
Envelopes of Curves in 2D
The maximization diagram is symmetrically defined for upper envelopes. In the rest of this chapter, we refer to both these diagrams as envelope diagrams. ...
6.
Copyright (c) 1997 Utrecht University (The Netherlands), // ETH ...
Jan 24, 2007 ... begin); valid = valid && ( begin->opposite()->opposite() == begin); if ( ! valid) { verr << " opposite pointer integrity corrupted. ...
7.
Copyright (c) 1997 Utrecht University (The Netherlands), // ETH ...
Halfedge_const_handle()); return edges_push_back( h, *(h.opposite())); } Face_handle faces_push_back( const Face& f) { CGAL_precondition( 1+size_of_faces() ...
8.
Copyright (c) 1997 Utrecht University (The Netherlands), // ETH ...
Halfedge `h->opposite()' is the new // successor of v and `h->next()' will be set to `v->next()'. The // vertex of h will be set to the vertex v refers to ...
9.
Copyright (c) 1997 Utrecht University (The Netherlands), // ETH ...
0); h->HBase::set_vertex( v); h = h->next()->opposite(); } while ( h != end); } void set_vertex_in_vertex_loop( Halfedge_handle h, Vertex_handle v) const ...
10.
Coding Conventions
However, there are some programming conventions (Section 2.2) that should be ... For iterators and functions returning them we extend the STL names with a prefix .... template < class GeometricTraits_2 > class Something { public: typedef ... Fo
