Hello, if the far field connection in DUAL_GRAPH->ADJACENCY has a smaller index than number of data point n. I assume that this is a valid connection? I made a comparison with annother Voronoi algorithm and found these connections missing. My mistake was, that I ignored the extra facet and every far...
Hello again, I realized the "beneath_beyond" mode, thanks for the last posts. But now, I am a little bit confused... (sorry) I know, that the "beneath_beyond" mode works on the convex hull of a polytope with one additional dimension. I assume that polymake does not do the additio...
Good morning, thanks for your quick response. Right now, i am launching polymake from prompt with Attributes: polymake 'my $VD = new VoronoiDiagram(SITES=>[[1,1,1],[1,0,1],[1,-1,1],[1,1,-1],[1,0,-1],[1,-1,-1]]);$VD->DUAL_GRAPH->ADJACENCY;save($VD,"OUTPUT.xml");' or polymake ‘my $points=new...
Hello, I started again to work on Voronoi Tessellation with polymake. Right know I am able to get DUAL_GRAPH->ADJACENCY with the "cdd" method with: my $VD = new VoronoiDiagram(SITES=>[[1,1,1],[1,0,1],[1,-1,1],[1,1,-1],[1,0,-1],[1,-1,-1]]);$VD->DUAL_GRAPH->ADJACENCY;save($VD,”OUTPUT.xml”); ...
Hi, I was able to solve the problem on my own... Puh! The Solution is quite simple: 1. Run Polymake with: polymake 'my $VD = new VoronoiDiagram(SITES=>[[1,1,1],[1,0,1],[1,-1,1],[1,1,-1],[1,0,-1],[1,-1,-1]]);$VD->DUAL_GRAPH->ADJACENCY;save($VD,"OUTPUT.xml");' 2. Eval the output file The Mem...
Hi, iam pretty new to polymake, and I want to do some validation of my Voronoi algorithmn with polymake. Somehow I was able to visualize the dual_graph of some sites with VISUAL_DUAL_GRAPH, but I need this information as ascii output in order to do the comparison. Can somebody please help me? Furthe...