Delaunay

Value Members

1. final def !=(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

4. val _faceIncidentToVertex: Map[Int, HalfEdge[Int, Point]]

   

5. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

6. val boundary: HalfEdge[Int, Point]

   

   Provides a handle on the bounding loop of a Delaunay triangulation.

   Provides a handle on the bounding loop of a Delaunay triangulation. All of the half-edges reachable by applying next to boundary have no bounding face information. That is boundary(.next)*.face == None.

7. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

8. final def eq(arg0: AnyRef): Boolean

   

   Definition Classes

   AnyRef

9. lazy val faceIncidentToVertex: Map[Int, HalfEdge[Int, Point]]

   

   A catalog of edges incident on the vertices of a Delaunay triangulation.

   A catalog of edges incident on the vertices of a Delaunay triangulation. These half edges may be used to navigate the faces that have a given point as a vertex. For example, all edges incident on vertex i may be visited by repeated application of the rotCCWDest() method of HalfEdge on faceIncidentToVertex(i).

10. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

11. final def getClass(): Class[_]

    

    Definition Classes

    AnyRef → Any

12. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

13. final def ne(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

14. final def notify(): Unit

    

    Definition Classes

    AnyRef

15. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

16. final def synchronized[T0](arg0: ⇒ T0): T0

    

    Definition Classes

    AnyRef

17. lazy val triangles: Map[(Int, Int, Int), HalfEdge[Int, Point]]

    

    A catalog of the triangles produced by the Delaunay triangulation as a Map from (Int,Int,Int) to HalfEdge[Int,Point].

    A catalog of the triangles produced by the Delaunay triangulation as a Map from (Int,Int,Int) to HalfEdge[Int,Point]. All integers are indices of points in verts, while the Points describe the center of the circumscribing circle for the triangle. The Int triples give the triangle vertices in counter-clockwise order, starting from the lowest-numbered vertex.

18. val verts: Array[Point]

    

19. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

20. final def wait(arg0: Long, arg1: Int): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

21. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )