Commit c1c64d6e authored by Mohcine Chraibi's avatar Mohcine Chraibi

Silence some warning

parent 34e8f039
......@@ -32,11 +32,11 @@
namespace p2t {
AdvancingFront::AdvancingFront(Node& head, Node& tail)
AdvancingFront::AdvancingFront(Node& Head, Node& Tail)
head_ = &head;
tail_ = &tail;
search_node_ = &head;
head_ = &Head;
tail_ = &Tail;
search_node_ = &Head;
Node* AdvancingFront::LocateNode(double x)
......@@ -62,7 +62,7 @@ struct Node {
class AdvancingFront {
AdvancingFront(Node& head, Node& tail);
AdvancingFront(Node& Head, Node& Tail);
// Destructor
This diff is collapsed.
......@@ -1849,7 +1849,7 @@ namespace VisiLibity
* \remarks O(n log(n)) average case time complexity, where n is the
* number of vertices in the Evironment (resp. Polygon).
Visibility_Polygon(const Point& observer,
Visibility_Polygon(const Point& Observer,
const Environment& environment_temp,
double epsilon=0.0);
/** \brief visibility set of a Point in a Polygon
......@@ -1977,7 +1977,7 @@ namespace VisiLibity
bool is_spike( const Point& observer,
bool is_spike( const Point& Observer,
const Point& point1,
const Point& point2,
const Point& point3,
......@@ -1988,9 +1988,9 @@ namespace VisiLibity
//Point is added to vertices.
void chop_spikes_at_back(const Point& observer,
double epsilon);
void chop_spikes_at_wrap_around(const Point& observer,
void chop_spikes_at_wrap_around(const Point& Observer,
double epsilon);
void chop_spikes(const Point& observer,
void chop_spikes(const Point& Observer,
double epsilon);
//For debugging Visibility_Polygon constructors.
//Prints current_vertex and active_edge data to screen.
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment