An algorithm for splitting line segments at their intersections.

A simple computational geometry C++ base class library with GLUT wrappers.

convert text to polygonal data using the outline of a specified font

1-D total variation filter: O(N) time algorithm and analysis

A Computational Geomemtry Class Project that implements DCEL data struture and Polygon triangulation as well as Plannar point location using persistent search trees.

Implementation of convex hull in 3D during a mentorship time at 360imaging.

Open-source C++ library for geometry and linear algebra

Repository for Computational Geometry Project (CS F441)

An experimental Cinder + OpenVDB toolchain for doing realtime volumetric processing.

The public CGAL repository, see the README below

A DCEL (doubly connected edge list) implementation using C++ 11

An interactive program for creating polygons and determining if a given point is inside or outside the polygons

Summer internship at USI Lugano: The Farthest Line-Segment Voronoi Diagram

Hugues Hoppe surface reconstruction implementations for grad thesis

Source code for UIST 2017 paper "AirCode: Unobtrusive Physical Tags for Digital Fabrication". C++ Computational Camera Imaging code, and MATLAB robust decoding implementation.

🔺 Fast and simple polygon triangulation library.

This software generates a dense packing of regular tetrahedra @ Arash Nemati Hayati Dec 15, 2017 Email: a.nematihayati@gmail.com The scheme used for optimization is a tight bipyramid propagation algorithm

Polygon Mapping // This program maps an arbitrary polygon into a structured two-dimensional grid of an arbitrary size // It's assumed that the polygon is inside the defined grid // If a cell intersects with the polygon, the code prints X // if a cell is outside the polygon, the code prints O // If a cell is inside the polygon, the code prints I

Computational geometry course homework at SPbAU 7th term