Logo Questions Linux Laravel Mysql Ubuntu Git Menu
 

New posts in computational-geometry

How to approximate a polygon with n rectangles?

Is there a case where the perimeter of a convex poly is greater than the perimeter of its bounding box?

Convex Hull and SciPy

How to calculate the blast area of a bomb?

Given weighted points on a plane, find locations for U squares such that the total enclosed weight would be maximized

Trilateration in a 2D plane with signal strengths

How to detect if a polygon has self-intersections?

How can I find all rectangles that bound regions in a bitmap?

How to get minimum count rectangles that covers another pile of rectangle?

Computational complexity and shape nesting

How to determine if a solid fits inside a given box in O(N^2)?

Efficient algorithm to find the largest rectangle from a set of points

Detecting the axis of rotation from a pointcloud

segment-polygon intersection

computational-geometry

How to fastest check if point (3D) is inside convex hull given by set of point

Fast, big and extensible geometry library for C++ [closed]

Efficient checking of whether a point is inside a large number of triangles in 2D