I have the coordinates (x,y) of 2 points. I want to build the third point so that these 3 po开发者_运维知识库ints make an equilateral triangle.
I would like to know if is there any way to determine if a cone is intersecting with a (finite) line segment. The cone is actually a circle located at P(x,y) with theta degree field of view and radius
I want to draw a line with thickness in j2me. This can easily be achieved in desktop java by setting Pen width as thickness value. However in j2me, Pen class does not support width. My idea is to gene
NOTE: This is a challenging problem for anybody who likes logic problems, etc. Consider a rectangular two-dimensional grid of height H and width W. Every space on the grid has a value, either 0 1 or
I\'m trying to programmatically generate beveled edges for 2D polygons. For example, given an array of 4 vertices defining a square, I want to generate something like this:
I have x1,y1 and x2,y2 which forms a line segment. How can I get another line x3,y3 - x4,y4 which is p开发者_StackOverflow社区arallel to the first line as in the picture. I can simply add n to x1 and
I have photo of a room with three walls and floor/ceiling or both. I am trying to reconstruct this room in 3d asking user for minimal input. R开发者_开发知识库ight now I use 8 points defined by user,
As noted in an earlier question, How to Zip enumerable with itself, I am working on some math algorithms based on lists of points.I am currently working on point in polygon.I have the code for how to
Imagine开发者_C百科 a GPS tracking system that is following the position of several objects. The points are stored in a database (PostgreSQL + PostGIS).
How can I programmatically detect whether or not two triangles touch each other, given their vertices on a 2D coordinate plane? This includes touching points or edges, as well 开发者_如何学JAVAas if o
加载中,请稍侯......