All Questions
Tagged with computational-geometry programming-challenge
16 questions
7
votes
3
answers
2k
views
Counting the triangles that can be formed from segments of given lengths
Problem Statement:
Given an unsorted array of positive integers. Find the number of
triangles that can be formed with three different array elements as
lengths of three sides of triangles.
...
3
votes
1
answer
490
views
Given a list of coordinates, find the rectangle with minimal area
A problem on leetcode asks the coder to write an algorithm to take a bunch of coordinates in the xy-plane and return the minimum area of a rectangle made from four of these coordinates (or return <...
2
votes
1
answer
121
views
Project Euler Problem #102 in F#: counting triangles that contain the origin
I've recently decided to get into functional programming with F#, and decided to learn the language through Project Euler. The following is my implementation of problem 102:
Problem:
Three distinct ...
3
votes
4
answers
172
views
Solving for <45 degree angles of a multi-vector system
I'm working on a problem from codechef.com. The goals are:
Solve for whether or not the driver took a "sharp turn", meaning for some angle θ, θ > 45°.
Test each point \$ (x_i, y_i) \$ in the system ...
26
votes
8
answers
3k
views
Area of the triangle generated by the hands of a clock
Problem explanation:
Let’s suppose we have a clock that has an hour hand 3 units long, a minute hand 4 units long, and a second hand 5 units long. The hour hand moves once every hour, the minute hand ...
12
votes
2
answers
742
views
Compute the perimeter of a polygon
This is taken from HackerRank, which I hope is okay.
I've been playing around with Haskell and I haven't really been able to find anything that really goes beyond toy examples in terms of how to ...
7
votes
3
answers
650
views
Counting points on a given irregular grid that are inside or outside a circle
Given some points that are represented as (X, Y) coordinates, my task is to count the points that are inside a circle, on the circle, and outside the circle.
The input is given in the following way: ...
7
votes
1
answer
216
views
Kattis "Hitting the Targets" utilizing a polymorphic relashionship
In order to learn C++ I have written a solution to this Kattis "Hitting the Targets" problem
Basically the program is to accept some shapes (circles and rectangles) on std in and a set of points and ...
9
votes
1
answer
220
views
Determining position of point W.R.T to given line equation
Problem from HackerRank::
Problem Statement:
There are \$N\$ lines. Each line has an index between \$1\$ and \$N\$. The slope of each line is negative, i.e. it goes from upper-left to lower-...
5
votes
1
answer
7k
views
Perimeter of a polygon given its vertices
I recently completed this code challenge so just looking for some feedback on my code. The task is to read polygon coordinates from a file and calculate the perimeter, I was provided with a script ...
8
votes
3
answers
2k
views
Given a set of points and pairs of lines, count the number of points that are between the pairs of lines
This is a contest problem. The entire description is here.
In resume:
The question gives a point simulating a light explosion that always has a negative x coordinate, a set of pairs line segments on ...
4
votes
1
answer
628
views
Project Euler 91 (via HackerRank): Right triangles with integer coordinates
This is my code to solve HackerRank's version of Project Euler Problem 91: on an N × N grid, find the number of possible right triangles where one vertex is (0, 0) and the other two vertices are ...
11
votes
5
answers
1k
views
Segment Intersection — Failing on Unknown Edge Cases
I was recently at a programming competition. One of the problems was to determine whether two line segments are parallel, intersect, or do not intersect.
For all of the test cases I ran, my solution ...
14
votes
2
answers
2k
views
CodeEval's SkyScrapers challenge
This is a solution to CodeEval's SkyScrapers challenge.
You are given a list of triples \$(l, h, r)\$. Each triple represents an axis-aligned rectangle, with top-left corner at \$(l, h)\$ and bottom-...
25
votes
2
answers
2k
views
Speed up solution to Project Euler problem 75
I wrote this code for Project Euler problem 75, which asks how many integers ≤ 1500000 exist, where the integer is a perimeter length that can be divided into three integer-length sides of a right ...