computational-geometry Questions
7
Solved
I have a line segment defined by two pointFs, along with a 2D bounding rectangle. I want to extend the line segment as much as possible in both directions so that the segment is flush with the wall...
Nazarius asked 29/8, 2011 at 23:3
2
Solved
What is the main difference between a quadtree and kd-tree? I understand they split points in many dimensions, but I do not understand why we would use one over the other.
I need a structure that a...
Stiffen asked 21/11, 2012 at 6:59
5
Solved
I have a polygon consists of lots of points. I want to find the intersection of the polygon and a circle. Providing the circle center of [x0,y0] and radius of r0, I have wrote a rough function to s...
Familial asked 15/6, 2015 at 11:51
3
Solved
I'm working on implementing various subdivision algorithms (such as catmull-clark); to do this efficiently requires a good way to store information about a grid of tesselated polygons. I implemente...
Bilbe asked 12/3, 2013 at 15:35
7
Solved
I have three points on the circumference of a circle:
pt A = (A.x, A.y);
pt B = (B.x, B.y);
pt C = (C.x, C.y);
How do I calculate the center of the circle?
Implementing it in Processing (Java)....
Dandy asked 5/11, 2010 at 3:35
5
Solved
See the image above; basically, I want a simple test to check if a point is within the line segment's range. The information (or input, if you prefer) I have is the point's coordinates, and the l...
Aymara asked 10/7, 2013 at 22:4
4
Solved
Is there any algorithm that would allow to approximate a path on the x-y plane (i.e. an ordered suite of points defined by x and y) with a limited number of line segments and arcs of circles (const...
Anson asked 24/3, 2017 at 9:27
4
Solved
I am trying to create a shape similar to this, hexagons with 12 pentagons, at an arbitrary size.
(Image Source)
The only thing is, I have absolutely no idea what kind of code would be needed to...
Rosenberg asked 16/10, 2017 at 19:20
2
Problem
Given are n=10000 points and m=1000 line segments in a plane. The task is to determine the closest segment to each point. A fast solution in Python is preferred.
Specifications
Line segment...
Gurgle asked 4/2 at 22:37
9
Solved
Given an array of x,y points, how do I sort the points of this array in clockwise order (around their overall average center point)? My goal is to pass the points to a line-creation function to end...
Specialistic asked 8/8, 2011 at 21:57
4
Solved
Given a polygon (not necessary convex) in the Cartesian coordinate, i wonder if there are any way to check the symmetricalness of that polygon?
I can think of an O(N) solution: using rotating cali...
Backspace asked 4/5, 2011 at 9:1
9
Solved
Disclaimer: Yes, this is a homework and I am thinking about it for a couple of days but couldn't find a way to go.
So there are n straight lines (y= ax + b) and I want to find upper envelopes of t...
Cloverleaf asked 14/9, 2011 at 17:6
2
Solved
This is a problem I came across frequently and I'm searching a more effective way to solve it. Take a look at this pics:
Let's say you want to find the shortest distance from the red point to a ...
Amateur asked 27/6, 2014 at 22:27
11
From the man page for XFillPolygon:
If shape is Complex, the path may self-intersect. Note that contiguous coincident points in the path are not treated as self-intersection.
If shape is Conv...
Shorter asked 23/1, 2009 at 5:16
9
Solved
How does one compute the area of intersection between a triangle (specified as three (X,Y) pairs) and a circle (X,Y,R)? I've done some searching to no avail. This is for work, not school. :)
It wou...
Chateau asked 12/2, 2009 at 4:24
11
Solved
I am trying to find an efficient solution for finding overlapping of n rectangles where rectangles are stored in two separate lists. We are looking for all rectangles in listA that overlap with rec...
Chalfant asked 16/11, 2016 at 0:16
3
I need some help with writing this algorithm.
For a given set of lines in space, I am trying to find the accessible volume when the origin (reference point) is 0.5,0.5,0.5. Currently, I do the foll...
Bonham asked 7/2, 2018 at 21:50
15
Solved
How can I draw a perpendicular on a line segment from a given point? My line segment is defined as (x1, y1), (x2, y2), If I draw a perpendicular from a point (x3,y3) and it meets to line on point (...
Diurnal asked 28/11, 2009 at 4:25
5
Solved
I'm working on a game where I create a random map of provinces (a la Risk or Diplomacy). To create that map, I'm first generating a series of semi-random points, then figuring the Delaunay triangul...
Rasorial asked 17/9, 2008 at 16:53
2
Solved
Looking for a O(logn) algorithm to identify the line segments of the convex polygon which intersect with an extended line segment. It is known for sure that the line segment lies inside the convex ...
Hiroko asked 28/11, 2013 at 15:23
8
Solved
In Matlab you can draw a circle by just specifying the center and the radius like this:
R = 10;
Center = [5,8];
circle(Center,R,1000,'b-');
hold on
plot(Center(1),Center(2),'g.')
The same code f...
Demount asked 1/11, 2011 at 19:0
6
Solved
I'm not sure how to approach this problem. I'm not sure how complex a task it is. My aim is to have an algorithm that generates any polygon. My only requirement is that the polygon is not complex (...
Intine asked 25/1, 2012 at 2:16
3
Solved
Let N be the number of inner nodes in a quadtree. Why is the number of leaves equal to 1 + 3 * N? I don't understand how we need to argue.
Chinaware asked 13/3, 2016 at 22:4
3
Solved
I want to find the minimum distance between two polygons with million number of vertices(not the minimum distance between their vertices). I have to find the minimum of shortest distance between ea...
Remiss asked 13/9, 2010 at 13:44
15
Solved
How would I "inflate" a polygon? That is, I want to do something similar to this:
The requirement is that the new (inflated) polygon's edges/points are all at the same constant distance ...
Bimestrial asked 10/7, 2009 at 13:32
1 Next >
© 2022 - 2024 — McMap. All rights reserved.