Polygons and Polylines
| URL | Description |
|---|---|
| How to Union Many Polygons Efficiently | |
| Point-Line Distance 3D | 
 |
| Polygon Union without Holes | Im looking for some fairly easy (I know polygon union is NOT an easy operation but maybe someone could point me in the right direction with a relativly easy one) algorithm on merging two intersecting polygons. Polygons could be concave without holes and also output polygon should not have holes in it. Polygons are represented in counter-clockwise manner. What I mean is presented on a picture. As you can see even if there is a hole in union of polygons I dont need it in the output. Input polygons are for sure without holes. I think without holes it should be easier to do but still I dont have an idea.  |
| Two Line Segments Intersection - elegant approach |  |
