Is there an algorithm that computes the boundary edges of a solid model to be used for robot gripping?
458053
Convex Hull: Quick Hull Algorithm\nhttp://nereida.deioc.ull.es/html/casiano/qhull.html\n\nVoronoi: Boundary Extraction\nhttp://cgm.cs.mcgill.ca/~godfried/teaching/projects.pr.98/sergei/project.html
111743
There is a great Cal Tech Video on that.  The one dealing with vectors.  It should be at most larger libraries.
1802
I haven't tried it, but check out MatPy (linked below).  Another possibility is Numerical Python (also linked below).
909305
you might try a figure 8 knot, or a stopper knot.\n\nhttp://www.chockstone.org/TechTips/Stopper.htm
878309
Diamond-Square is a great height-map generation algorithm. It's kind of cool that something that simple could create realistic landscapes.
747730
use Eulers formula\n\nF+ V = E+2\n\nhere F = faces = 8\nV = vertices =12\nE = edges = 18\n\ntherefore it is possible to construct the solid.\n\nit is a hexagonal cylinder
13548
This will depend somewhat on the version of Photoshop. Assuming it's 7.0 or later, there are three main methods. If the subject is on a fairly flat background, you can use the magic wand tool. If it's on a more detailed or tonally variant background, you're likely best to use the lasso tool and manually trace around it's edges.\n\nIf it's somewhere in between you may be able to get away with the Filter > Extract feature, which let's you highlight the edges (roughly) and then fill the area you want to keep. You can then extract it and PS will try to keep the edges intact for you.
803641
http://images.google.com\n\nSearch for whatever types of motion you are interested in.
913865
http://www.webreference.com/3d/ Try that, good luck with the assignment.
1112455
You might be thinking of a Reuleaux (or Rouleaux) triangle, but it has rounded sides, not rounded corners.
616705
You should view this site,\nhttp://usa.autodesk.com/ most like it may help you.
159298
A Google search for Workshop on Meshless methods 2003 found\n\n International Workshop on MeshFree Methods 2003\n http://www.math.ist.utl.pt/meshfree/\n\nI couldn't find the proceedings online, but the Program link at\n\n http://www.math.ist.utl.pt/meshfree/Wmm2003-pg.html\n\nlinks to abstracts of the presentations.  Searching for the titles and authors of the presentations of interest may lead to online copies of them.
138562
http://mathworld.wolfram.com/ThomassenGraph.html
3693
Hello, \n\nHere's a great site http://autodesk.blogs.com/between_the_lines/2005/05/autocad_2006_tu.html\n\nIf you feel I've answerd your question please close the question so I can recieve points for my answer. \n\nThanks,\n\nV
104358
MAZE NAVIGATION ALGORITHM\n\nPart 1\n\n    A guaranteed way to to solve a maze is to stick to a wall and always try to turn one direction or the other.  It is not the most efficient way but it works all the time.  This is how the Boe-Bot solves mazes.  It hugs the left wall.  IR sensors are mounted on the left and front sides of the robot.  It begins the maze with a forward movement.  After that it checks the left IR.  If left is open, it turns left, moves forward, and repeats the process.  If left is closed, the robot checks the front.  If front is open, the robot moves forward and repeats the process.  If the front is also closed, the  robot turns right.  It then checks the front IR sensor to determine if the new front is open.  If its open, the robot moves forward and repeats the process.  If it is closed, the robot again turns right and moves forward (the way it just came) and repeats the process.  The flow chart summarizes all these instructions.  Each time the robot makes a movement (forward, left, or right) it records a F,L, or R to a memory block in the EEPROM by using the WRITE function in Stamp BASIC.  The variable 'total_moves' is incremented each time a movement is written.  \n\n    The forward, left, and right subroutines use the PULSOUT function to move the servos.  The pulsout variables for each servo (eg. 699, 879) are not set in stone.  They have been changed numerous times and will probably need to be played with more.   We determined them partly by experiment and largely by trial and error.  The results of those experiments are also published in this site.  \n\n    At the beginning of the forward subroutine is the BUTTON function.  Each time through this subroutine, the programs checks to see if the button has been depressed.  If it has not, the program continues.  If the button has been pressed, control is moved to the find_RR subroutine.\n\nPart 2\n\n    When the program enters part 2, the robot has already left the maze and the button has been pressed.  It enters the find_RR subroutine and first pauses for 10 seconds so the robot can be repositioned at the starting point to re-do the maze.  Find_RR is a superfluous piece of code that originated from poor planning.  It reads in the movement from each memory block and the following memory block (blocks n and n+1) and compares them to each other.  If it detects a R,R combo, it replaces the first R with an A.  It then copies each movement into the previous one.  For example, it would change a FFRRFLF to a FFAFLF.  Each time it finds an RR combo and replaces it with an A, all the code following the last R must be adjusted. Therefore, the 'total_moves' variable is reduced by 1 each time RR is detected.  The write_A subroutine handles that task.  If no RR combo is found (they've all been switched) control moves to the find_A subroutine.\n\n    Find_A searches each memory block for the 'A' movement.  If no 'A' is found, control moves to the done subroutine.  However, this will only occur after all the 'A' have been dealt with.  When an 'A' is found, the memory location is stored in variable 'counter' and control goes to subroutine surround_A.  The purpose of surround_A is to determine all of the movements before and after the 'A' that need to be ignored for successful completion of the maze.  \n\n    After the robot completes the maze for the first time, and changes the 'RR' to 'A' the code will something like:\n\n        F F F L F A F R F F L F  this is for the hypothetical situation shown here:\n\n\n\n To eliminate the unwanted code, the pairs of movements surrounding A are examined and compared to the green, blue and purple patterns.\n\nF                F                F            L                F            A                F                R                F                F            L            F\n\n0                1                 2            3                4
663831
Assuming that you are using Autocad, or a variation of the program, you can plot control points, or nodes, several ways.  You can enter the X and Y values, for example, 5000.000, 5000.000.  Then you can plot the next set of point pairs.  Remember to keep them in order, for example, Northing (Y), Easting (X).  You can plot all of the point pairs and then connect the dots.  The survey portion of the respective program can do this pretty much automatically.  You can also plot the first point pair, and then come off of those with a direction and a distance and it will automatically calculate the next point pair.  It just takes some time to learn the program and its features.  There is also an elevation component, Z.  \nHere are some equations that might help:\nXb = Xa + sin(AZ)dist(AB)\nYb = Ya + cos(AZ)dist(AB)\nA and B are the first set of point pairs.  Just keep using the formula as you travel through the control points.
792270
Hi I assume you mean an unsymmetrical item. I also assume you want a best fit. I have done similar things on a computer but not by hand. The computer finds three point most distant from the centroid and uses these points as pivots for three orthogonal planes. Not sure of the rest.