DelaunayStitcher

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. def advance(e0: Int): Int

   

5. def advanceIfNotCorner(e0: Int): Int

   

6. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

7. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

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

   

   Definition Classes

   AnyRef

9. def equals(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

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. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

13. def insertBase(left0: Int, isLeftLinear: Boolean, right0: Int, isRightLinear: Boolean, debug: Boolean): Int

    

    Finds, inserts, and returns the unique half edge on the boundary of the convex hull of the two convex boundary loops given by left and right; the returned edge points from right to left.

    Finds, inserts, and returns the unique half edge on the boundary of the convex hull of the two convex boundary loops given by left and right; the returned edge points from right to left. Left and right must be correctly initialized to be corners of their respective bounding loops (according to Predicates.isCorner), and isLeftLinear/isRightLinear must be set to true if the respective meshes have only boundary edges.

    To be clear, this algorithm is impartial to absolute position despite the inputs being named left and right. It does, however, require that the bounding loops represented by left and right be convex and mutually non-intersecting.

14. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

15. def joinToVertex(bound: Int, isLinear: Boolean, vertex: Int, triangles: TriangleMap, debug: Boolean = false): (Int, Boolean)

    

16. def merge(left: Int, isLeftLinear: Boolean, right: Int, isRightLinear: Boolean, triangles: TriangleMap, debug: Boolean = false): (Int, Boolean)

    

    Stiches two non-intersecting Delaunay triangulations, given as half edges on the outside boundary of each constituent triangulation.

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

    

    Definition Classes

    AnyRef

18. final def notify(): Unit

    

    Definition Classes

    AnyRef

19. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

20. val predicates: TriangulationPredicates

    

21. def reverse(e0: Int): Int

    

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

    

    Definition Classes

    AnyRef

23. def toString(): String

    

    Definition Classes

    AnyRef → Any

24. final def valid(e: Int, b: Int): Boolean

    

    Annotations

    @inline()

25. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )