EMODnet Quantized Mesh Generator for Cesium
Functions
cgal_utils.h File Reference

Set of miscellaneous functions extending the functionality of the CGAL library. More...

#include "tin_creation/tin_creation_cgal_types.h"
#include <fstream>
#include <CGAL/Polyhedron_incremental_builder_3.h>
#include <CGAL/Polyhedron_3.h>
#include <CGAL/Delaunay_triangulation_2.h>
#include <CGAL/Triangulation_2.h>

Go to the source code of this file.

Functions

template<class Polyhedron >
bool isTileCorner (typename Polyhedron::Halfedge_const_handle e)
 
template<class Delaunay >
void delaunayToOFF (const std::string &outFilePath, const Delaunay &dt)
 Exports a 2D Delaunay on a 3D point set (i.e., using the Projection_traits_xy_3) to an OFF file, for debugging purposes.
 
template<class Polyhedron >
bool isBorder (typename Polyhedron::Vertex_handle &v)
 Checks if a vertex in the polyhedron is in the border.
 
template<class Polyhedron >
bool isBorder (typename Polyhedron::Vertex_const_handle &v)
 Checks if a vertex in the polyhedron is in the border.
 
template<class K >
bool isPointInArc (const typename K::Point_2 &query, const typename K::Point_2 &center, const typename K::Point_2 &p0, const typename K::Point_2 &p1)
 Computes if a point query falls within the arc defined by the vectors p0 - center and p1 - center.
 

Detailed Description

Set of miscellaneous functions extending the functionality of the CGAL library.

Function Documentation

◆ isTileCorner()

template<class Polyhedron >
bool isTileCorner ( typename Polyhedron::Halfedge_const_handle  e)

Checks if a given halfedge is incident to a corner vertex in the tile Note that this check only works on our specific case...