All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars
 perplexus dot info

 Points on a plane (Posted on 2006-08-18)
3 points are drawn on a plane, and inside their triangular region, more points are added such that no 3 are collinear, such that there are n points in total. What is the maximum possible number of line segments one could draw connecting two of these points such that none intersect other than at their endpoints?

 No Solution Yet Submitted by atheron Rating: 4.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
 re(2): How Leonhard would solve it Comment 5 of 5 |
(In reply to re: How Leonhard would solve it by Charlie)

"It's just that I did not know if merely being a triangulation would guarantee the maximum number of lines."

Yes, it suffices. If you have a full triangulation of all n points, there is no way to connect two points in such a way that the edge does not cross other line segments.

 Posted by Robby Goetschalckx on 2006-08-21 07:01:06

 Search: Search body:
Forums (0)