aloy Posted February 25, 2013 Share Posted February 25, 2013 I attach a drawing showing points from a corridor survey (which was given originally as an excel file which was converted to a lisp file with a simple manupulation). I wish to carry out triangulation of these points. The algorithm recommended by some uni students and professors is first to prepare the convex hull (the points on the periphery as I understand it)and then start with the shortest base. My problem is how to prepare the list of those points in the convex hull. Any help would be very much appreciated. Aloy Convex_hull.dwg Quote Link to comment Share on other sites More sharing options...
Join the conversation
You can post now and register later. If you have an account, sign in now to post with your account.
Note: Your post will require moderator approval before it will be visible.