EVOLUTION-MANAGER
Edit File: convex_hull.html
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><title>R: Convex hull of a set of vertices</title> <meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> <link rel="stylesheet" type="text/css" href="R.css" /> </head><body> <table width="100%" summary="page for convex_hull {igraph}"><tr><td>convex_hull {igraph}</td><td style="text-align: right;">R Documentation</td></tr></table> <h2>Convex hull of a set of vertices</h2> <h3>Description</h3> <p>Calculate the convex hull of a set of points, i.e. the covering polygon that has the smallest area. </p> <h3>Usage</h3> <pre> convex_hull(data) </pre> <h3>Arguments</h3> <table summary="R argblock"> <tr valign="top"><td><code>data</code></td> <td> <p>The data points, a numeric matrix with two columns.</p> </td></tr> </table> <h3>Value</h3> <p>A named list with components: </p> <table summary="R valueblock"> <tr valign="top"><td><code>resverts</code></td> <td> <p>The indices of the input vertices that constritute the convex hull.</p> </td></tr> <tr valign="top"><td><code>rescoords</code></td> <td> <p>The coordinates of the corners of the convex hull.</p> </td></tr> </table> <h3>Author(s)</h3> <p>Tamas Nepusz <a href="mailto:ntamas@gmail.com">ntamas@gmail.com</a> </p> <h3>References</h3> <p>Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, Second Edition. MIT Press and McGraw-Hill, 2001. ISBN 0262032937. Pages 949-955 of section 33.3: Finding the convex hull. </p> <h3>Examples</h3> <pre> M <- cbind( runif(100), runif(100) ) convex_hull(M) </pre> <hr /><div style="text-align: center;">[Package <em>igraph</em> version 1.3.5 <a href="00Index.html">Index</a>]</div> </body></html>