Back to Math and Physics

Algorithm for polygon clipping and set operations (union, intersection, difference)

Math and Physics Programming

Started by f_shaukat June 28, 2008 01:17 PM

1 comment, last by alvaro 15 years, 10 months ago

f_shaukat

122

Author

June 28, 2008 01:17 PM

Dear All, Does any one know how can i get implementation of the following algorithm for the concave polygon(with holes) operations (union, intersection, difference). Polygon Comparison using a Graph Representation by Kevin Weiler - 1980. Thanks in advance Faisal

Advertisement

flounder

100

June 28, 2008 02:13 PM

google turned up cgal. This page looks like it deals with what you want.

agogsoft

21,604

June 29, 2008 02:08 AM

I've used GPC with good results.

This topic is closed to new replies.

Advertisement

Popular Topics

The promise of freedom in story games Game Design and Theory

robertrobert

Facebook Ads for sales on steam, does it work? Games Business and Law

MrK45

Inheriting from application registered class AngelCode

Advertisement

Recommended Tutorials

Myopic Rhino

An Introduction to Developing for Mobile Devices Using J2ME/MIDP (Part 1) General and Gameplay Programming

Myopic Rhino

Simple STL Logging System General and Gameplay Programming

Myopic Rhino

Precalculated Pathfinding Revisited Artificial Intelligence

Myopic Rhino

The C++ Pimpl General and Gameplay Programming

FrancisXavier

Stringizing C++ Enums General and Gameplay Programming