Reputation
6,071
Next privilege 10,000 Rep.
Access moderator tools
Badges
13 28
Newest
 Nice Answer
Impact
~55k people reached

Apr
29
comment How to find the concave points of a point-set?
What do you mean by long edge? Is it the longest edge?
Apr
15
comment Plot: Option MeshStyle: color rotation matching PlotStyle color rotation
If Mesh is other than All, can try this: Block[{pts}, Plot[{t, 2 t}, {t, 0, 180}, PlotPoints -> 40, MaxRecursion -> 0, Mesh -> 7, PlotStyle -> Rest[ColorData[97, "ColorList"]]] /. {Point[x_] :> (pts = x; Nothing)} /. {Line[x_] :> {Line[x], Point[Intersection[x, pts]]}}]
Apr
11
comment Finding face vertices from the face adjacency graph
yes, to be safe..
Apr
11
comment Finding face vertices from the face adjacency graph
g1 uses predefined coordinates, so to generate corresponding faces you should use the second argument (second example in my answer): FindFace[g1, GraphEmbedding[g1]]. And FindFace generate all faces including outer like I mentioned. Here it's the largest one. To filter out, you can try faces = Most[SortBy[FindFace[g1, GraphEmbedding[g1]], Length]]
Apr
11
revised Defining a MeshRegion from a list of points and Polygons with duplicate points does not work in 10.4
add computational-geometry tag
Apr
8
comment Finding face vertices from the face adjacency graph
@yode I just checked on 10.4 and it works fine. What is not working?
Apr
8
awarded  Nice Answer
Apr
6
answered How to change the bipartite into a normal form
Apr
5
answered A unexpected behavior in RelationGraph
Mar
30
answered DirectedEdges -> False not working
Mar
29
comment Tom's family how to cross the bridge
@barrycarter just evaluate g, then you see the graph.
Mar
17
comment Is there a numerical method/built-in to calculate the boundary of a set of graphs?
@MartinBüttner this would work: Last[SortBy[ConnectedMeshComponents[reg], RegionMeasure]]
Mar
16
revised How to make a two letter monogram in 3d like the one on www.mymo.is?
add computational-geometry tag
Feb
24
awarded  Yearling
Jan
30
revised How can I make this code to count Hamiltonian paths faster?
added 11 characters in body
Jan
30
answered How can I make this code to count Hamiltonian paths faster?
Jan
27
answered Printing graphics files on a 3D printer
Jan
27
revised Printing graphics files on a 3D printer
add computational-geometry tag
Jan
27
comment VertexLabels with Graph Properties
Yes, you can. You can just map properties over you vertices. What do you have?
Jan
26
answered VertexLabels with Graph Properties