Hey, I\'m trying to write a method that takes a starting Cartesian coordinate(x,y) an angle (in degrees), a length and a number of sides and draws a shape to an applet. So far thi开发者_运维知识库s is
I am very new in working with GIS or geometry data. I have geometr开发者_如何学编程y data (polygon) in oracle10g database. Is there any Spatial function to find a point inside that polygon. If not the
Please help with the algorithm of calculating the slope So we have a Cartesian coordinate system. X right at Y the top. There is a line which passes through the center of coordinates.
I am using setPixel and getPixel functions but they are using matrices which is开发者_开发问答 naturally rectangle.I am trying to copy pixels shaped like circle !
I\'m trying to draw a gradient in a rectangle object, with a given angle (Theta), where the ends of the gradient are touching the perimeter of the rectangle.
I have a line l_1 given with a point series p_1,...,p_n. I now want a new line l_2 having k points: q_1,...,q_k. But for all i \\in {1,...,k-1}: abs( q_i - q_i+1 ) = const, meaning the segments of l_2
I can\'t figure out how to implement this in a performing way, so I decided to ask you guys. I have a list of rectangles - actually atm only squares, but I might have to migrate to rectangles later,
I am just messing around with some geometry shaders taking a list of GL_POINTS and outputting a box with triangle strips.i have it basically working but when i zoom in/out or pan around the triangle s
For a polygon defined as a sequence of (x,y) points,开发者_高级运维 how can I detect whether it is complex or not?A complex polygon has intersections with itself, as shown:
I have following task: In the program we should draw lines on a bit mapped display. An array of n pairs of reals (ai,bi) defined the n linesyi = ai*x + bi开发者_StackOverflow社区. The lines were ord
加载中,请稍侯......