Solved

How Can I DO That

Posted on 2015-01-09
5
86 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
[X]
Welcome to Experts Exchange

Add your voice to the tech community where 5M+ people just like you are talking about what matters.

  • Help others & share knowledge
  • Earn cash & points
  • Learn & ask questions
5 Comments
 
LVL 24

Expert Comment

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

Accepted Solution

by:
ozo earned 250 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 250 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

On Demand Webinar: Networking for the Cloud Era

Did you know SD-WANs can improve network connectivity? Check out this webinar to learn how an SD-WAN simplified, one-click tool can help you migrate and manage data in the cloud.

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…
Prime numbers are natural numbers greater than 1 that have only two divisors (the number itself and 1). By “divisible” we mean dividend % divisor = 0 (% indicates MODULAR. It gives the reminder of a division operation). We’ll follow multiple approac…
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…
There are cases when e.g. an IT administrator wants to have full access and view into selected mailboxes on Exchange server, directly from his own email account in Outlook or Outlook Web Access. This proves useful when for example administrator want…

696 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