is a branch of computer science devoted to the study of algorithms which can be stated in terms of geometry.
Having a list of points, how do I find if they are in clockwise order? For example: point[0] = (5,0) point[1] = (6,4) point[2] = (4,5) …
math geometry polygon computational-geometryHow would I "inflate" a polygon? That is, I want to do something similar to this: The requirement is that …
algorithm geometry polygon computational-geometry bufferingGiven an array of x,y points, how do I sort the points of this array in clockwise order (around …
algorithm math lua geometry computational-geometryFrom the man page for XFillPolygon: If shape is Complex, the path may self-intersect. Note that contiguous coincident points in …
algorithm geometry polygon computational-geometry xlibI would like to determine a polygon and implement an algorithm which would check if a point is inside or …
algorithm computational-geometryI have drawn a triangle mesh with 10000 vertices(100x100) and it will be a grass ground. I used gldrawelements() for …
c++ opengl computational-geometry normalsI'm looking for an algorithm to detect if a circle intersects with any other circle in the same plane (given …
math computational-geometry geometryI am trying to figure out what algorithms there are to do surface reconstruction from 3D range data. At a …
algorithm 3d computational-geometryWhat is the fastest way to find closest point to the given point in data array? For example, suppose I …
algorithm data-structures computational-geometryHow can I draw a perpendicular on a line segment from a given point? My line segment is defined as (…
math geometry 2d computational-geometry