LARS
LARS (Light Augmented Reality System) is an open-source framework for light-based interaction and real-time tracking in multi-robot experiments. Inspired by ARK, LARS extends the augmented reality paradigm to robotic collectives by projecting dynamic visual cues and environments onto the arena, enabling new experimental possibilities for collective robotics research, education, and outreach. LARS features integrated tracking, light projection, and modular experiment control with a user-friendly Qt GUI.
Loading...
Searching...
No Matches
rcsc::DelaunayTriangulation::Edge Class Reference

triangle's edge data. More...

#include <delaunay_triangulation.h>

Public Member Functions

 Edge (const int id, const Vertex *v0, const Vertex *v1)
 create edge with two vertices. vertices must not be NULL.
 ~Edge ()
 nothing to do
void removeTriangle (TrianglePtr tri)
 remove pointer to the triangle that this edge belongs to. This edge is NOT removed.
void setTriangle (TrianglePtr tri)
 set the triangle that this edge belongs to.
int id () const
 get Id number of this edge
const Vertexvertex (const std::size_t i) const
 get the raw pointer to the vertex that this edge has
Triangletriangle (const std::size_t i) const
 get the raw pointer to the triangle that this edge belongs to
bool hasVertex (const Vertex *v) const
 check if this edge has the specified vertex or not.

Detailed Description

triangle's edge data.

Constructor & Destructor Documentation

◆ Edge()

rcsc::DelaunayTriangulation::Edge::Edge ( const int id,
const Vertex * v0,
const Vertex * v1 )
inline

create edge with two vertices. vertices must not be NULL.

Parameters
idId number of this edge.
v0raw pointer to the first vertex
v1raw pointer to the second vertex

Member Function Documentation

◆ hasVertex()

bool rcsc::DelaunayTriangulation::Edge::hasVertex ( const Vertex * v) const
inline

check if this edge has the specified vertex or not.

Parameters
vraw pointer to the vertex
Returns
true if this edge has the specified vertex.

◆ id()

int rcsc::DelaunayTriangulation::Edge::id ( ) const
inline

get Id number of this edge

Returns
Id number

◆ removeTriangle()

void rcsc::DelaunayTriangulation::Edge::removeTriangle ( TrianglePtr tri)
inline

remove pointer to the triangle that this edge belongs to. This edge is NOT removed.

Parameters
tripointer to the target triangle

◆ setTriangle()

void rcsc::DelaunayTriangulation::Edge::setTriangle ( TrianglePtr tri)
inline

set the triangle that this edge belongs to.

Parameters
triraw pointer to the triangle.

It is not checked whether this edge belongs to that triangle. If the target triangle is already set or two triangle is already set, this function has no effect. So, this method should be called from Triangle's constructor.

◆ triangle()

Triangle * rcsc::DelaunayTriangulation::Edge::triangle ( const std::size_t i) const
inline

get the raw pointer to the triangle that this edge belongs to

Parameters
ispecifies array index
Returns
pointer to the triangle

◆ vertex()

const Vertex * rcsc::DelaunayTriangulation::Edge::vertex ( const std::size_t i) const
inline

get the raw pointer to the vertex that this edge has

Parameters
ispecifies array index
Returns
const pointer to the vertex

The documentation for this class was generated from the following file: