wu :: forums
« wu :: forums - Polygon »
Welcome, Guest. Please Login or Register.
Jan 8th, 2025, 7:56pm

RIDDLES SITE WRITE MATH! Home Home Help Help Search Search Members Members Login Login Register Register
   wu :: forums
   riddles
   cs (Moderators: towr, william wu, ThudnBlunder, SMQ, Eigenray, Grimbal, Icarus)
   Polygon		 « Previous topic | Next topic »
Pages: 1  Reply Reply Notify of replies Notify of replies Send Topic Send Topic Print Print
   Author  Topic: Polygon  (Read 562 times)
gotit
Uberpuzzler
*****





   
Email

Gender: male
 Posts: 804
Polygon  
« on: Aug 31st, 2007, 1:38pm »		 Quote Quote Modify Modify
You are given cordinates of n points on a plane and you are asked to draw a polygon through some or all of these points such that no point lies outside the polygon.What algorithm should be used?Also,the polygon should have the minimum number of sides possible.
IP Logged
All signatures are false.
Barukh
Uberpuzzler
*****






   


Gender: male
 Posts: 2276
Re: Polygon  
« Reply #1 on: Aug 31st, 2007, 10:57pm »		 Quote Quote Modify Modify
Convex Hull?
IP Logged
Aryabhatta
Uberpuzzler
*****






   


Gender: male
 Posts: 1321
Re: Polygon  
« Reply #2 on: Aug 31st, 2007, 11:34pm »		 Quote Quote Modify Modify
Convex Hull is probably the intent, but the wording makes it seem like finding a triangle passing through one of the points will do, which i guess can be done on O(n) time.
IP Logged
Pages: 1  Reply Reply Notify of replies Notify of replies Send Topic Send Topic Print Print

« Previous topic | Next topic »

Powered by YaBB 1 Gold - SP 1.4!
Forum software copyright © 2000-2004 Yet another Bulletin Board