helderco / univ-polyclip
Efficient Clipping of Arbitrary Polygons using OpenGPL, based on a paper by Günther Greiner and Kai Hormann, for a Graphical Computation class. Provided Python and Java versions. Switch branches for each.
☆21Updated 13 years ago
Alternatives and similar repositories for univ-polyclip:
Users that are interested in univ-polyclip are comparing it to the libraries listed below
- Polygon clipping in pure Python☆15Updated 8 years ago
- IGES geometry system implemented in python☆16Updated 5 years ago
- A Viewer for Rhino OpenNURBS 3DM files.☆23Updated 10 years ago
- OpenMesh 2.0, slightly modified for Otherlab use☆22Updated 11 years ago
- XML based Constructive Solid Geometry based on carve. Moved to https://gitlab.com/arnholm☆28Updated 2 years ago
- Implementation of "A Simple and Correct Even-Odd Algorithm for the Point-in-Polygon Problem for Complex Polygons"☆36Updated 8 years ago
- Simplified python wrapper for OpenCASCADE☆35Updated 7 years ago
- Simple Express-G Viewer. Tiny implementation. Based on STEPCode☆45Updated 2 years ago
- stable polygon intersection☆33Updated 5 years ago
- Mirrored implementations of polygon clipping/CSG/operations algorithm, in C (original, by Martínez et al) and ActionScript3 (port, by Mah…☆47Updated 8 years ago
- A 2D and 3D geometry library in python☆53Updated 11 years ago
- Straight skeleton implementation in Python☆81Updated 4 years ago
- Medial Axis Transform - Library☆134Updated 11 months ago
- An algorithm to find the minimum bounding box.☆78Updated 3 years ago
- a ifc file viewer by opencascade and glfw☆11Updated last year
- My sample code and solutions to some programming exercises for the book "Curves and Surfaces for CAGD" by Gerald Farin☆44Updated 13 years ago
- Cork Computational Library forked from source code by Gilbert Bernstein.☆44Updated last year
- A port of the General Polygon Clipper☆17Updated 2 years ago
- An implementation and presentation of selected mesh generation algorithms☆81Updated 4 years ago
- Kirkpatrick's Algorithm for Log(n) point location in planar subdivisions.☆70Updated 11 years ago
- Implementation of Fortune's Algorithm in Processing☆16Updated 8 years ago
- Fast Delaunay triangulation of 2D points implemented in Python.☆51Updated 10 months ago
- Universal 3D Sample Software☆49Updated 8 years ago
- 2D and 3D maths module for Python☆96Updated 7 years ago
- GTS stands for the GNU Triangulated Surface Library. (original page: http://gts.sourceforge.net)☆21Updated 9 years ago
- Miscanellous pythonocc contributions and experiments. Anayone can request for an write access.☆19Updated 8 years ago
- straight skeleton code implementing Aichholzer and Aurenhammer's Triangulation based algorithm☆22Updated 4 years ago
- Provides CAD, CAM, CAE, and computer graphics software developers the tools to accurately transfer 3-D geometry between applications. Old…☆51Updated 6 years ago
- OCCT live Draw Harness examples☆19Updated last month
- An open source implementation of a texture bin packing algorithm. It's similar to texture tools like the TexturePacker.☆39Updated 4 years ago