is a branch of computer science devoted to the study of algorithms which can be stated in terms of geometry.
What is the right approach for slicing a 3D mesh? The mesh are all closed surfaces and the slices need …
c++ graphics visualization computational-geometry meshThe question is: Given N points(in 2D) with x and y coordinates, find a point P (in N given …
algorithm computational-geometryThe problem: N points are given on a 2-dimensional plane. What is the maximum number of points on the same …
algorithm geometry computational-geometryI'm working on a game where I create a random map of provinces (a la Risk or Diplomacy). To create …
geometry computational-geometry voronoi delaunayHow can I find the largest circle that can fit inside a concave polygon? A brute force algorithm is OK …
algorithm polygon computational-geometry geometryI have a question very similar to this: How to know if a line intersects a plane in C#? I …
c# geometry 2d bing-maps computational-geometryI am extracting image features from 10 classes with 1000 images each. Since there are 50 features that I can extract, I am …
machine-learning computational-geometry classification knnAn O(n) algorithm to detect if a line intersects a convex polygon consists in checking if any edge of …
algorithm line computational-geometry asymptotic-complexity convex-polygonHow does one compute the area of intersection between a triangle (specified as three (X,Y) pairs) and a circle (…
algorithm geometry computational-geometry intersection areaI'm working on implementing various subdivision algorithms (such as catmull-clark); to do this efficiently requires a good way to store …
algorithm data-structures computational-geometry polygons