lycantropos / gon Goto Github PK

We need a way to check if polygon is contained inside another one.

API may be similar to Python's set/frozenset types:

• <= for "is subset",
• < for "is proper subset",
• >= for "is superset",
• > for "is proper superset".

Reference.

Following Delaunay triangulation support (issue #5): it is reasonable to have support for Voronoi diagram of polygon vertices.

Reference.

We need a way to construct difference of two geometries.

API may be similar to Python's set/frozenset types:
- for difference.

Reference.

We need to be able to scale geometries by given factor.

Adding method like

def scale(self,  ratio_x: Coordinate, ratio_y: Optional[Coordinate] = None) -> Geometry:
    if ratio_y is None:
        ratio_y = ratio_x
    ...

will help.

Reference.

Since it is a very useful techique to decompose polygon into set of simpler ones (and triangles are the simplest polygons), we need a support for it too.

Reference.

We need to be able to translate geometries by given step.

Adding method like

def translate(self, step_x: Coordinate, step_y: Optional[Coordinate] = None) -> Geometry:
    if step_y is None:
        step_y = step_x
    ...

will help.

Reference.

We need a way to check if polygons do not overlap, or in other words -- if polygons are disjoint.

API may be a method called is_disjoint_with that takes 2 polygons: self & other, similar to __eq__ & other rich comparison methods.

Reference.

We need to be able to rotate geometries around given point by given angle.

Adding method like

def rotate(self, angle: Coordinate, point: Optional[Point] = None) -> Geometry:
    result = (self
			  if point is None
		 	  # move origin to point
		      self.translate(-point.x, -point.y))
    ... # rotate around origin
    return (result
			if point is None
		 	# move origin back
		    result.translate(point.x, point.y))

will help.

Reference.

We need a way to construct intersection of two polygons: empty for non-overlapping ones and non-empty otherwise.

API may be similar to Python's set/frozenset types:
& for intersection.

Reference.

We need a way to construct symmetric difference of two geometries.

API may be similar to Python's set/frozenset types:
^ for symmetric difference.

Reference.

We need a way to construct union of two polygons: disjoint for non-overlapping ones and "merged" otherwise.

API may be similar to Python's set/frozenset types:
| for union.

Reference.

Hi,

I am working on a project with character shapes and I need to triangulate some polygons with holes (e.g. the character B). Does your project offer any possibility to solve such a problem?

Cheers,

We need to be able to calculate distance between geometries.

Adding method like

def distance_to(self, other: Geometry) -> Coordinate:
    ...

will help.

Reference.