Skip to main content

Questions tagged [geometry]

0 votes
2 answers
430 views

I'm trying to make a curved line move relative to the movement of a straight line. I'm thinking that I want the points on the curved line to keep their relative positions to the two points on the ...
Dan Anderson's user avatar
-3 votes
1 answer
282 views

The divide and conquer strategy for closest point problem sorts the points according to x coordinates so that the median could be found. But what does sorting the strip (strip array contains all the ...
user12208242's user avatar
-5 votes
3 answers
249 views

I have a group of squares on a 2d grid, here's an example I need an algorithm to find out whether we are able to remove a square while keeping the entire group connected. Below is an image where I ...
mazore's user avatar
  • 115
-2 votes
1 answer
3k views

I have a grid of squares, let's say 12x12. I want to split this grid into equal sections of 8 squares, which is 18 total sections. There is no requirement for sections being convex or compact, and ...
mazore's user avatar
  • 115
1 vote
0 answers
224 views

I have multiple rectangular frames, with different fixed heights. The width should be minimized and there is a maximum width. Then there are many different smaller rectangles. These should be packed ...
Wombosvideo's user avatar
-3 votes
2 answers
2k views

Given a series of points, I need to assert that the plotted points form an arc (with a certain level of confidence), and I need to approximate the radius of the arc. For example, the following points ...
Yanick Rochon's user avatar
1 vote
1 answer
535 views

I am trying to design an object-oriented library to handle geometric calculations. However, I am trying to exaggerate on being "tightly" object-oriented and applying relevant "best practices". I know ...
Vector Zita's user avatar
  • 2,502
1 vote
4 answers
995 views

Are there any algorithms related to the following problem that could be usefull for solving it? I have a convex hull built on some point set. I would like to simplify it (reduce number of points) by ...
Anton Petrov's user avatar
5 votes
4 answers
344 views

I have a Circle class and a LineSegment class, and I want to implement a method that returns two points (or one, or none) for the intersections. How do I know which class to put this method in? Would ...
MCMastery's user avatar
  • 173
2 votes
1 answer
86 views

Imagine a LineSegment class that represents a line segment using two arbitrary endpoints. Should the constructor throw if it is passed two approximately equal endpoints? Obviously this would require ...
davidvandebunte's user avatar
1 vote
3 answers
348 views

When I want to implement axis aligned 2d rectangles I always go with {x, y, w, h}, because that is the natural approach to it. With 3d axis aligned rectangles you need {x, y, z, w, h, d(depth)}. For a ...
hgiesel's user avatar
  • 831
12 votes
5 answers
930 views

Below is an example image, if I have a point of the white dot in the middle and I want to find the nearest possible location for the blue circle (which is obviously at the location where I placed it) ...
Botanic's user avatar
  • 129
1 vote
2 answers
344 views

I want to create a minimal polygon which approximates the boundary of an arbitrary (semi-random) shape. By "minimal" I mean, "as few points as possible". The original shape (to be bounded) is in ...
ChrisW's user avatar
  • 3,427
1 vote
0 answers
70 views

I'd like to know or have other ideas --other than my solution-- about how to check if a car on a given position (lat, lng) is getting away (let's say a distance D away) from the path where the car ...
Sergio Guillen Mantilla's user avatar
0 votes
1 answer
2k views

There are two points (x1, y1) and (x2, y2), each of which can be any real integer pair. These define a rectangle R with vertices {(x1, y1), (x2, y2), (x1, y2), (x2, y1)}. The rectangle exists in a ...
AaronF's user avatar
  • 101

15 30 50 per page
1
2 3 4 5