|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
public interface Triangulation
| Method Summary | |
|---|---|
void |
insertPoint(Point_dt p)
insert the point to this Delaunay Triangulation. |
Iterator<Triangle_dt> |
trianglesIterator()
computes the current set (vector) of all triangles and return an iterator to them. |
int |
trianglesSize()
|
Iterator<Point_dt> |
verticesIterator()
returns an iterator to the set of points compusing this triangulation. |
| Method Detail |
|---|
void insertPoint(Point_dt p)
p - new vertex to be inserted the triangulation.Iterator<Triangle_dt> trianglesIterator()
Iterator<Point_dt> verticesIterator()
int trianglesSize()
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||