---

Vertex.h

// Mesh Algorithms: a library of algorithms to manipulate 3D meshes
// Copyright (C) 2001 Tim Garthwaite and Jason Reposa

// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
// License as published by the Free Software Foundation; either
// version 2.1 of the License, or (at your option) any later version.

// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
// Lesser General Public License for more details.

// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA

#ifndef VERTEX_H
#define VERTEX_H

class Vertex;

#include "options.h"
#include <iostream>
#include <vector>
#include <set>
#include <cmath>
#include "Triangle.h"
#include "Color.h"
#include "Normal.h"
#include "Point.h"
#include <GL/gl.h>

class Vertex : public Point {
  std::set <Triangle *> triangles;

  std::set <Vertex *> neighbors;

  std::set <Triangle *> shared;

  GLfloat distance;

  Color color;

  Normal normal;

  bool corner;

  GLint ID;

  GLvoid calculateNormal();

  GLvoid calculateDistance();

 public:

  Vertex(
    float x, 
    float y, 
    float z, 
    float w = 1.0 
  );

  GLfloat getDistance();

  bool isCorner();
  
  GLvoid isCorner(bool b);

  GLvoid addNeighbor(Vertex * v);

  GLvoid addTriangle(Triangle * t);

  bool removeNeighbor(Vertex * v);

  bool removeTriangle(Triangle * t);

  GLvoid setColor(Color * c);

  GLvoid setNormal(Normal * n);

  bool replace(Vertex * v1, Vertex * v2);

  bool contains(Vertex * v);

  bool contains(Triangle * t);

  Color * getColor();

  Normal * getNormal();

  std::set <Triangle *> * getTriangles();

  std::set <Vertex *> * getNeighbors();

  std::string toString();

  GLint getID();

  GLvoid setID(GLint id);
  
  std::set <Triangle *> * getSharedTriangles(Vertex * v);
};

struct less_than_distance {
  bool operator () (Vertex * v0, Vertex * v1) const {
    return (v0->getDistance() < v1->getDistance());
  }
};

typedef std::set <Vertex *> VS;
typedef std::set <Vertex *>::iterator VSI;

#endif

---