class_docstr: Constrained delaunay triangulation
  
  Implementation based on [1]_.
  
  Parameters
  ----------
  pts : array
      Nx2 array of points.
  edges : array
      Nx2 array of edges (dtype=int).
  
  Notes
  -----
  * Delaunay legalization is not yet implemented. This produces a proper
    triangulation, but adding legalisation would produce fewer thin
    triangles.
  * The pts and edges arrays may be modified.
  
  References
  ----------
  .. [1] Domiter, V. and Žalik, B. Sweep‐line algorithm for constrained
     Delaunay triangulation
class_docstr_tok: ["Constrained","delaunay","triangulation","Implementation","based","on","[","1","]","_.","Parameters","--","--","--","--","--","pts",":","array","Nx2","array","of","points",".","edges",":","array","Nx2","array","of","edges","(","dtype=int",")",".","Notes","--","--","-","*","Delaunay","legalization","is","not","yet","implemented",".","This","produces","a","proper","triangulation",",","but","adding","legalisation","would","produce","fewer","thin","triangles",".","*","The","pts","and","edges","arrays","may","be","modified",".","References","--","--","--","--","--","..","[","1","]","Domiter",",","V.","and","\u017dalik",",","B.","Sweep\u2010line","algorithm","for","constrained","Delaunay","triangulation"]
docstr: Return 1 if edges intersect completely (endpoints excluded)
docstr_tok: ["Return","1","if","edges","intersect","completely","(","endpoints","excluded",")"]
code: def _edges_intersect(self, edge1, edge2):
      """Return 1 if edges intersect completely (endpoints excluded)"""
      h12 = self._intersect_edge_arrays(
          self.pts[np.array(edge1)], self.pts[np.array(edge2)]
      )
      h21 = self._intersect_edge_arrays(
          self.pts[np.array(edge2)], self.pts[np.array(edge1)]
      )
      err = np.geterr()
      np.seterr(divide="ignore", invalid="ignore")
      try:
          out = (0 < h12 < 1) and (0 < h21 < 1)
      finally:
          np.seterr(**err)
      return out
  
imports: from __future__ import division, print_function
  from itertools import permutations
  import numpy
  from collections import OrderedDict
label_desc: Use image node_id 23 for calling the Triangulation obj's underlying member method code with example usage: obj._edges_intersect(edge1, edge2) and returns: out