Lior Sinai • 1/11/2025

Notes on the Martinez-Rueda Polygon Clipping algorithm

Read Original

This technical article details the author's implementation and modifications of the Martinez-Rueda algorithm for computing boolean operations (intersection, union, difference, XOR) between polygons. It compares the algorithm to Weiler-Atherton, discusses its segment-level approach and sensitivity to numerical inaccuracies, and focuses on fixes for issues arising from the strict ordering in the Bentley-Ottmann line intersection component.

0 comments
#algorithm #computational geometry #Polygon Clipping
Notes on the Martinez-Rueda Polygon Clipping algorithm

Comments

No comments yet

Be the first to share your thoughts!

Browser Extension

Get instant access to AllDevBlogs from your browser

Top of the Week

1
React, useEffect, and Stale Closures: How to Avoid Them with Dependencies and useRef
Jivbcoop • 4 votes
2
Better react-hook-form Smart Form Components
Maarten Hus • 2 votes
3
AGI, ASI, A*I – Do we have all we need to get there?
John D. Cook • 1 votes
4
Quoting Thariq Shihipar
Simon Willison • 1 votes
5
Dew Drop – January 15, 2026 (#4583)
Alvin Ashcraft • 1 votes
6
Using Browser Apis In React Practical Guide
Jivbcoop • 1 votes