is a branch of computer science devoted to the study of algorithms which can be stated in terms of geometry.
Below are 2 rectangles. Given the coordinates of the rectangle vertices - (x1, y1)...(x8, y8), how can the area of …
c++ math computational-geometrySo I have about 16,000 75-dimensional data points, and for each point I want to find its k nearest neighbours (using …
algorithm data-structures computational-geometry nearest-neighbor dimensionality-reductionI am trying to implement a line simplification algorithm. The main 2 algorithms I found are: Ramer-Douglas-Peucker Visvalingam-Whyat Currently I am …
algorithm polygon computational-geometry simplificationI have a kind of cutting problem. There is an irregular polygon that doesn't have any holes and a list …
algorithm polygon computational-geometry rectanglesI am trying to use CGAL to do some Delaunay triangulation. I used one of the CGAL samples to compute …
c++ computational-geometry triangulation cgal delaunayCan anyone recommend a good set of CGAL tutorials for beginners? I have tried to read the documentation but it …
c++ computational-geometry cgalAs of early 2014, SVG spec does not have any built-in support for Boolean Operations Boolean operations are methods for altering …
javascript svg computational-geometryI have a very nice & tricky question for you. I need to align two meshes using a very fast …
c computational-geometry mesh