A simple algorithm for polygon intersection

by

I understand the original poster was looking for a simple solution, but unfortunately there really is no simple solution.

Nevertheless, I’ve recently created an open-source freeware clipping library (written in Delphi, C++ and C#) which clips all kinds of polygons (including self-intersecting ones). This library is pretty simple to use: http://sourceforge.net/projects/polyclipping/ .

More Related Contents:

  1. How to determine if a list of polygon points are in clockwise order?
  2. Projecting 3D points to 2D plane [closed]
  3. Perpendicular on a line from a given point
  4. Calculate distance between 2 GPS coordinates
  5. Generate a random point within a circle (uniformly)
  6. Turning a cylinder into a sphere without pinching at the poles
  7. How to calculate the volume of a 3D mesh object the surface of which is made up triangles
  8. Cone to box collision
  9. How do I calculate the normal vector of a line segment? [closed]
  10. Calculating area enclosed by arbitrary polygon on Earth’s surface
  11. How do I combine complex polygons?
  12. Using atan2 to find angle between two vectors
  13. correcting fisheye distortion programmatically
  14. Implementing Ray Picking
  15. Signed angle between two 3D vectors with same origin within the same plane
  16. How do I detect intersections between a circle and any other circle in the same plane?
  17. How to distribute points evenly on the surface of hyperspheres in higher dimensions?
  18. Finding the coordinates of points from distance matrix
  19. how map 2d grid points (x,y) onto sphere as 3d points (x,y,z)
  20. 3D coordinates on a sphere to Latitude and Longitude
  21. Calculate rotated rectangle size from known bounding box coordinates
  22. How to best approximate a geometrical arc with a Bezier curve?
  23. Get bounds of rotated rectangle
  24. How to calculate an angle from three points? [closed]
  25. Why must a nonlinear activation function be used in a backpropagation neural network? [closed]
  26. The possible number of binary search trees that can be created with N keys is given by the Nth catalan number. Why?
  27. Intersection of two lines defined in (rho/theta ) parameterization
  28. Flipping a quaternion from right to left handed coordinates
  29. Math – mapping numbers
  30. How to calculate rotation angle from rectangle points?

Leave a Comment