class_docstr: A `Cell`'s centroid property is a potential solution to finding the pole
  of inaccessibility for a given polygon. Rich comparison operators are used
  for sorting `Cell` objects in a priority queue based on the potential
  maximum distance of any theoretical point within a cell to a given
  polygon's exterior boundary.
class_docstr_tok: ["A","`","Cell","`","'s","centroid","property","is","a","potential","solution","to","finding","the","pole","of","inaccessibility","for","a","given","polygon",".","Rich","comparison","operators","are","used","for","sorting","`","Cell","`","objects","in","a","priority","queue","based","on","the","potential","maximum","distance","of","any","theoretical","point","within","a","cell","to","a","given","polygon","'s","exterior","boundary","."]
docstr: Signed distance from Cell centroid to polygon outline. The returned
  value is negative if the point is outside of the polygon exterior
  boundary.
docstr_tok: ["Signed","distance","from","Cell","centroid","to","polygon","outline",".","The","returned","value","is","negative","if","the","point","is","outside","of","the","polygon","exterior","boundary","."]
code: def _dist(self, polygon):
      """Signed distance from Cell centroid to polygon outline. The returned
      value is negative if the point is outside of the polygon exterior
      boundary.
      """
      inside = polygon.contains(self.centroid)
      distance = self.centroid.distance(polygon.exterior)
      for interior in polygon.interiors:
          distance = min(distance, self.centroid.distance(interior))
      if inside:
          return distance
      return -distance
  
file_path: shapely/shapely/algorithms/polylabel.py
imports: from heapq import heappop, heappush
  from shapely.errors import TopologicalError
  from shapely.geometry import Point
label_desc: Use image node_id 8 for calling the Cell obj's underlying member method code with example usage: obj._dist(polygon) and returns: unknown, distance