Algorithm to Compute the Shortest Distance between Points on Two Lines
Let U = represent a increasing series of points; xu0 < xu1 && yu0 < yu1, etc. Let D = represent a decreasing series of points; xd0 < xd1 …
Category: geometry
How to Check if Any Three Points can Make a Triangle?
How to Check if Any Three Points can Make a Triangle? There are many ways to check if any given three points in 2D plane can make a triangle. …
Algorithms to Check If Four Points can Make a Valid Square (C++ and Java)?
Given the coordinates of four points in 2D space, return whether the four points could construct a square. The coordinate (x,y) of a point is represented by an integer …
How to Compute the Projection Area of 3D Shapes?
On a N * N grid, we place some 1 * 1 * 1 cubes that are axis-aligned with the x, y, and z axes. Each value v = …
C++ Coding Exercise – Self Crossing
You are given an array x of n positive numbers. You start at point (0,0) and moves x metres to the north, then x metres to the west, x …