All Posts

• Efficient algorithm for minimum Euclidean distance between points in non-overlapping regions in a 2D array March 19, 2025
• How to compute a point on a line in CGAL August 5, 2022
• How to find the smallest ellipse covering a given fraction of a set of points? December 4, 2021
• How do I find the minimum-area ellipse that encloses a set of points? November 22, 2021
• Find Minimum area ellipse enclosing a set of points in c++ November 22, 2021
• How do you get the medial axis of a multipolygon using CGAL? September 18, 2021
• What are some algorithms to calculate the width of an arbitrary polygon when a bounding box approximation is inaccurate August 8, 2020
• Choosing subset of farthest points in given set of points March 31, 2020
• Find shortest path around a cylinder represented by 3d triangular mesh October 9, 2019
• The point that minimizes the sum of euclidean distances to a set of n points July 30, 2019
• How can I find a line segment with the most intersections along with the coordinates of the intersection points? April 25, 2019
• Divide a region into parts efficiently Python July 14, 2018
• How to print the faces of a Voronoi diagram? May 5, 2018
• Optimize bruteforce solution of searching nearest point March 23, 2018
• The Maximum Volume of Trapped Rain Water in 3D January 24, 2017
• Algorithm to find the largest empty rectangle amid other polygons October 9, 2015