[Webinar] Streamline your web hosting managementRegister Today

x
?
Solved

How Can I DO That

Posted on 2015-01-09
5
Medium Priority
?
106 Views
Last Modified: 2015-02-06
Consider a two dimensional co-ordinate system with two axes; X & Y. This system is identified by positive integer co-ordinates. Meaning, every valid point in this system is represented by two values (x, y) where 0 < x,y <100.
 
You are given an input set of lines, specified by the co-ordinates of the two end-points.
 
Write a program to identify all closed shapes created by the specified lines.
 
Input Format (the program should accept this simple text file called "input.txt" placed in the classpath):
 
A1, B1; C1, D1
A2, B2; C2, D2

An, Bn; Cn, Dn
 
Expected Output (based on actual values of the input lines):
 
There are two triangles and 1 square based on the input.
Triangle 1  with vertices (a1,b1; a2, b2; a3,b3)
Triangle 2 with vertices (a5,b5; a6, b6; a7, b7)
Square 1 with vertices (a8, b8; a9, b9; a10, b10; a11, b11)
 
Note:
 
The input data may be such that some shapes overlap.
You don't have to find shapes formed by intersection of two shapes. For example, if a square and triangle overlap such that there is another small triangle formed at the intersection, you don't have to report that.
For the sake of scope, report only the following shapes, if any - triangle, any quadrilateral, pentagon. 

Open in new window

0
Comment
Question by:Naren Kumar
3 Comments
 
LVL 24

Expert Comment

by:Phillip Burton
ID: 40539898
Is this a homework task?
0
 
LVL 85

Accepted Solution

by:
ozo earned 1000 total points
ID: 40539902
For a brute force approach you could have a table for each of the 10201 possible points listing all the points to which it is connected by a line.

You could then take the triple, quadruple, and pentuple closures of that list.
0
 
LVL 86

Assisted Solution

by:Mike Tomlinson
Mike Tomlinson earned 1000 total points
ID: 40540632
You could also do it by building a graph where each node contains the two endpoints and they point to other nodes that have a point in common.  Then traverse the graph and count the number of edges you traveled before coming to a point you've already seen (meaning it is closed).  It simply specifies triangle, quadrilateral and pentagon (not regular pentagon or specific quads like parallelogram, rectangle or square) so you don't need to worry about angles or anything.
0

Featured Post

Free Tool: Path Explorer

An intuitive utility to help find the CSS path to UI elements on a webpage. These paths are used frequently in a variety of front-end development and QA automation tasks.

One of a set of tools we're offering as a way of saying thank you for being a part of the community.

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

This algorithm (in C#) will resize any image down to a given size while maintaining the original aspect ratio. The maximum width and max height are both optional but if neither are given, the original image is returned. This example is designed t…
We take a look at the fast-evolving changes in Search Engine Optimization rules and algorithms by Google.
I've attached the XLSM Excel spreadsheet I used in the video and also text files containing the macros used below. https://filedb.experts-exchange.com/incoming/2017/03_w12/1151775/Permutations.txt https://filedb.experts-exchange.com/incoming/201…
Stellar Phoenix SQL Database Repair software easily fixes the suspect mode issue of SQL Server database. It is a simple process to bring the database from suspect mode to normal mode. Check out the video and fix the SQL database suspect mode problem.
Suggested Courses
Course of the Month8 days, 13 hours left to enroll

613 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question