I want to draw an inscribed circle. A circle that is empty with no fill but making it have a full stroke. My code : /* * To change this template, choose Tools | Templates * and open the template in the editor. */ package simon; import java.awt.*; imp
As far as I know the method to find distance between 3D point to triangle is to check if the point is lie inside triangle's plane so the distance will be closest distance to triangle's plane, otherwise if the point lie outside of the triangle then th
For an OpenCV project I try to find projected rectangles in a camera image. I know the ratio of the rectangles. I have a calibrated camera and try to find rectangles in the image by means of findContour and approxPolyDP. So far this is working very w
I was asked this during a Google Interview. We are given a string consisting of letters- F,L,R. - which is the instruction a robot follows F- goes forward by one step. L-turn left. R- turn right. String length can be upto 2500 characters. The string
Linear functions in mathematics are those polynomials whose degree is 1 and hence they are straight in nature when plotted on a graph. But the constant functions like f(x) = 3, even though their degree is 0, are straight in nature when plotted on a g
While integrating google API in Java, I need to calculate another place's lat/long using existing lat/long, distance and direction. How to calculate that point? --------------Solutions------------- The following PHP code provides the point from $lat1
I am trying to convert a System.Windows.Shapes.Shape object into a System.Windows.Media.Geometry object. With the Geometry object, I am going to render it multiple times with a custom graph control depending on a set of data points. This requires tha
Here is the problem, Already made several researches about it, but did not find any clear and well explained solution about that. Some people are talking about functions like st_distance or st_within which refer to mysql/mariadb versions but these fu
I know the two points A(7,1) B(6,4) of the hypotenuse (and the distance), I know the angle of the adjacent (45°, but it can change) but I need to find where those two would meet to create a right triangle C(?,?). But I don't know how to find the coor
I'm using boost 1.56 on OS X, installed through homebrew. I'm running into a compilation problem - specifically, it appears that I cannot remove values from a boost::geometry::index::rtree. Here's the code I've come up with so far: #include <iostr
I need to find the closest distance between a box and a circle, however, I realize this can be broken up into the closest distance between a line segment and a circle. Given I have a line segment of two points point1_x,point1_y and point2_x, point2_y
I am trying to calculate the coordinates along a circle corresponding to the tap location. The coordinates should be on the border of the circle nearest to the tap location (e.g. the border that is less distant from the radius). To facilitate this I
I am currently trying to write a shader in unity that draws a triangular pattern around countries in a risk-styled game if both countries are not owned by the same player (visual aid to see your borders). Right now, I'm having an issue with making th
I'm writing script, that splits too long edges of faces (make 2 faces instead 1 big) Result exports to .obj file Geometry reduces ok, but after rendering the result, reduced faces have wrong light reflection and WebGl event doesn't show some faces. h
This python code draws a sierpinski triangle. It starts by drawing the main triangle and then draws a bunch of smaller characters import turtle def drawTriangle(points,color,myTurtle): myTurtle.fillcolor(color) myTurtle.up() myTurtle.goto(points[0][0
I'm trying to fit some data points in order to find the center of a circle. All of the following points are noisy data points around the circumference of the circle: data = [(2.2176383052987667, 4.218574252410221), (3.3041214516913033, 5.223500807396
My goal is to find the area of a triangle using the vertices that are in a dictionary. For the sake of simplicity, i am using the coordinates (0,0), (1,0), and (0,2): vertices = {1: (0,0), 2: (1,0), 3: (0,2)} How can i access the specific numbers in
The vertices inside my THREE.Geometry object are positioned as groups of 4 (2D squares), and I want to be able to increase and decrease the sparseness of the location of the those squares (i.e. alter the space in-between the squares without affecting
I'm currently trying to orthographically project a 3 dimensional point (p - 3-D vector in homogeneous coordinates) onto a 2 dimensional camera plane (q - 2-D vector in homogeneous coordinates). To achieve this i build up this projection matrix: D is
Given circle centre: vectorA and another Vector on the circle's perimeter:vectorB, how can you determine the shorter route for vectorB to translate to another point on the circle's perimeter that is variable:vectorC? Will the shorter route be clockwi