Skip to main content

computational geometry - Finding non-collinear vertices of a convex hull


I'm fairly new to Mathematica (and programming in general tbh) and need this for a math project I'm working on.


I generate large collections of (rational, 2d) points and need to find which of these points are the vertices of the convex hull.


Some googling suggested that MeshCoordinates would do this, but it does not exclude points on the edges of the convex hull that are collinear with the vertices. It also gives rounded decimals but that is less of an issue.


Is there a simple way to do this?


Edit to include a simplified example, the vertices of the unit square with a redundant point ({1, .5}):


pts = {{0, 0}, {1, 0}, {0, 1}, {1, 1}, {1, .5}}


Both MeshCoordinates[ConvexHullMesh[pts]] and ConvexHullMesh[pts]["VertexCoordinates"] return the point {1, .5}, which is clearly not a vertex of the unit square.


The points I'm generating are not random, they are the result of a fairly involved set of calculations and many of them can be collinear.



Answer



Update: a brute force approach to eliminate coordinates that lie in the convex hull of other coordinates:


ClearAll[noncollinearF]
noncollinearF[verts_]:= Function[{k}, Nor @@ (RegionMember[ConvexHullMesh[#],k]&/@ 
    Subsets[Complement[verts,{k}],{2}])]

Pick[#, noncollinearF[#] /@ #]&[Rationalize @ ConvexHullMesh[pts]["VertexCoordinates"]]



{{0, 0}, {1, 0}, {0, 1}, {1, 1}}



Pick[#, noncollinearF[#] /@ #]&[Rationalize@ConvexHullMesh[pts2]["VertexCoordinates"]]


{{0, 0}, {1, 1}, {1, 0}, {2, 1}}



Or define a function that picks the non-collinear vertices of the convex hull of a set of 2D points:



ncvF = With[{v = #}, Pick[v, Function[{k}, Nor @@ (RegionMember[ConvexHullMesh[#],k]&/@ 
    Subsets[Complement[v,{k}],{2}])]/@v]]&;

 ncvF[pts]


{{0, 0}, {1, 0}, {0, 1}, {1, 1}}



 ncvF[pts2]



{{0, 0}, {1, 1}, {1, 0}, {2, 1}}



Previous post:


The function Geometry`ConvexHull2 gives the desired coordinates for the simple example:


pts = {{0, 0}, {1, 0}, {0, 1}, {1, 1}, {1,1/2}};

chm = ConvexHullMesh[pts];
vertices = Rationalize[chm["VertexCoordinates"]] (* or MeshCoordinates[chm] *)



{{0, 0}, {1, 0}, {0, 1}, {1, 1}, {1, 1/2}}



strictvertices = Rationalize[Geometry`ConvexHull2[ pts]]


{{0, 0}, {1, 0}, {1, 1}, {0, 1}}



Show[chm, Graphics@Point[pts], Graphics[{Red, PointSize[Large], Point @ vertices}]]


Mathematica graphics


Show[chm, Graphics@Point[pts], Graphics[{Red, PointSize[Large], Point @ strictvertices}]]

Mathematica graphics


... but, it fails to eliminate some coordinates in an other example:


pts2 = {{0, 0}, {1/2, 0}, {1/2, 1/2}, {1, 1}, {3/2, 1}, {1, 0}, {2, 1}, {3/2, 1/2}}

Show[ConvexHullMesh[pts2], Graphics @ Point[pts2], 
 Graphics[{Red, PointSize[Large], Point @ Geometry`ConvexHull2[ pts2]}]]


Mathematica graphics


Comments

Post a Comment

Popular posts from this blog

functions - Get leading series expansion term?

Given a function f[x] , I would like to have a function leadingSeries that returns just the leading term in the series around x=0 . For example: leadingSeries[(1/x + 2)/(4 + 1/x^2 + x)] x and leadingSeries[(1/x + 2 + (1 - 1/x^3)/4)/(4 + x)] -(1/(16 x^3)) Is there such a function in Mathematica? Or maybe one can implement it efficiently? EDIT I finally went with the following implementation, based on Carl Woll 's answer: lds[ex_,x_]:=( (ex/.x->(x+O[x]^2))/.SeriesData[U_,Z_,L_List,Mi_,Ma_,De_]:>SeriesData[U,Z,{L[[1]]},Mi,Mi+1,De]//Quiet//Normal) The advantage is, that this one also properly works with functions whose leading term is a constant: lds[Exp[x],x] 1 Answer Update 1 Updated to eliminate SeriesData and to not return additional terms Perhaps you could use: leadingSeries[expr_, x_] := Normal[expr /. x->(x+O[x]^2) /. a_List :> Take[a, 1]] Then for your examples: leadingSeries[(1/x + 2)/(4 + 1/x^2 + x), x] leadingSeries[Exp[x], x] leadingSeries[(1/x + 2 + (1 - 1/x...
Post a Comment
Read more

mathematical optimization - Minimizing using indices, error: Part::pkspec1: The expression cannot be used as a part specification

I want to use Minimize where the variables to minimize are indices pointing into an array. Here a MWE that hopefully shows what my problem is. vars = u@# & /@ Range[3]; cons = Flatten@ { Table[(u[j] != #) & /@ vars[[j + 1 ;; -1]], {j, 1, 3 - 1}], 1 vec1 = {1, 2, 3}; vec2 = {1, 2, 3}; Minimize[{Total@((vec1[[#]] - vec2[[u[#]]])^2 & /@ Range[1, 3]), cons}, vars, Integers] The error I get: Part::pkspec1: The expression u[1] cannot be used as a part specification. >> Answer Ok, it seems that one can get around Mathematica trying to evaluate vec2[[u[1]]] too early by using the function Indexed[vec2,u[1]] . The working MWE would then look like the following: vars = u@# & /@ Range[3]; cons = Flatten@{ Table[(u[j] != #) & /@ vars[[j + 1 ;; -1]], {j, 1, 3 - 1}], 1 vec1 = {1, 2, 3}; vec2 = {1, 2, 3}; NMinimize[ {Total@((vec1[[#]] - Indexed[vec2, u[#]])^2 & /@ R...
Post a Comment
Read more

How to remap graph properties?

Graph objects support both custom properties, which do not have special meanings, and standard properties, which may be used by some functions. When importing from formats such as GraphML, we usually get a result with custom properties. What is the simplest way to remap one property to another, e.g. to remap a custom property to a standard one so it can be used with various functions? Example: Let's get Zachary's karate club network with edge weights and vertex names from here: http://nexus.igraph.org/api/dataset_info?id=1&format=html g = Import[ "http://nexus.igraph.org/api/dataset?id=1&format=GraphML", {"ZIP", "karate.GraphML"}] I can remap "name" to VertexLabels and "weights" to EdgeWeight like this: sp[prop_][g_] := SetProperty[g, prop] g2 = g // sp[EdgeWeight -> (PropertyValue[{g, #}, "weight"] & /@ EdgeList[g])] // sp[VertexLabels -> (# -> PropertyValue[{g, #}, "name"]...
Post a Comment
Read more