I have the following geometry problem: You are given a circle with the center in origin - C(0, 0), and radius 1. Inside the circle are given N points which represent the centers of N different circle
I have a very large point cloud (> 100000 points) that I\'d like to detect planar arrangements in. I decided to use an octree to break the points into very small planar clusters and then merge neighbo
i get tired to calculate the volume of 3D object (Cube, Cylinder ...) can any one help with this problem ? the question is , how to calculate the volume of object from his
I need to remove some hidden faces that are inside a closed triangular mesh. I\'ve found a way to do it using MeshLab, but there are two problems: 1) the article says that it could fail in some cases
I have a 2D computational geometry / GIS problem that I think should be common and I\'m hoping to find some existing code/library to use.
I have as an input a 2D polygon with holes, and I need to find it\'s straight skeleton, like in the picture:
I am trying to understand what it means for dual transformation to be incidence and order preserving. The开发者_如何学Python book has the following example: (a, b) => y = ax - b and= mx + b => (m, -b)
Given a set of points with unequal x-coordinates, I want to calculate the value v > 0 such that 开发者_运维技巧the shear transformation (x, y) -> (x + v*y, y) doesn\'t change the order in the x-direct
Given two set A and B of lines with n lines in total and a poin开发者_如何转开发t p. How do u determine if A lines lie in one side of p and B lines lie in the other side?Unless all of the lines are mu
I posted this question on mathoverflow but I want to know your opinion regarding this also. What I want to do is to draw a cu开发者_如何学JAVArve that is always at a certain distance from the normal t
加载中,请稍侯......