Stack Overflow
Stack Overflow

Questions tagged [polyhedra]

84 questions
1
vote
5 answers

Arrange the vertices of a 3D convex polygonal plane in counter clockwise direction in MATLAB

I have a convex polygon in 3D. For simplicity, let it be a square with vertices, (0,0,0),(1,1,0),(1,1,1),(0,0,1).. I need to arrange these vertices in counter clockwise order. I found a solution here. It is suggested to determine the angle at the…
John Smith
  • 418
  • 7
  • 21
0
votes
1 answer

Cloog-ppl make error

I'm trying to install cloog-ppl 0.15-11 in my 64 bit ubuntu 10.10. I get the following error during make. I guess it is wrt linking. gcc -DHAVE_CONFIG_H -I. -I./include/cloog -I./include -I./include -Wall -fomit-frame-pointer -g -O2 -MT cloog.o…
psteelk
  • 1,305
  • 3
  • 16
  • 24
0
votes
0 answers

How do you find the orthographic projection of a convex polyhedron with maximum or minimum area?

An orthographic projection of a convex polyhedron has an outline which is a convex polygon whose shape depends on the projection direction. How do you choose the direction to maximise or minimise the area of this polygon?
user258279
  • 371
  • 4
  • 12
0
votes
0 answers

Determining the minimum distance vector between 3D objects

My question is regarding finding the vector corresponding to minimum distance between sphere and a polyhedron, or a point and a polyhedron. Is there a way to find the relevant vector corresponding to minimum distance between two 3D objects using DJK…
Thinesh
  • 1
0
votes
1 answer

Ploting Polygon in Maple with more then 3 Dimensions

I have a set of constraints with the variables x_1 and x_2. relations = [-1 <= x_1, x_1 <= 1, -1/2 <= x_2, x_2 <= 3/2] and plotting the polygon works just fine in Maple when I use Plot(PolyhedralSet(relations)) but now I want to plot x_3 and x_4…
ufg
  • 41
  • 3
0
votes
2 answers

Volume of the intersection of two polyhedron using CGAL

I am looking for a fast method to compute the approximate volume of the intersection of two polyhedrons. My program runs 20k iterations wherein each iteration I need to compute the volume of difference of two polyhedrons with ~100 vertices each (one…
spark
  • 1
  • 2
0
votes
1 answer

Given the number of total nodes and degrees of each node, is it possible to construct a graph?

Take the cube as an example, there are 8 nodes and 12 edges, and each node is connected with 3 nodes. With networkx, I must input all the edges manually. For example, the following code is to construct a graph containing all the edges of an…
akarui
  • 31
  • 3
0
votes
1 answer

inconsistencies between the original expression and the result one in apron

I'm using the OCaml interface of the Apron library. When I want to reduce the expression [| x + y -2 >= 0; x + y > - 3=0|], the result of tab is [|-3 + 1 * x + 1 * y >= 0|], How can I get the origin expression x + y - 3 >= 0? let _ = let vx =…
Frank Sheng
  • 195
  • 7
0
votes
0 answers

Is there a way to plot from Codeclocks to Matlab

So I've written a C++ code that given a concave Polyhedron decomposes it in convex polyhedra which I save in a list. Now I wanted to plot the Polyhedra that I obtain from this decomposition on Matlab to see if my Algorithm works. Does someone now if…
Vimar
  • 33
  • 5
0
votes
1 answer

Many-vertex test problems for the simplex method

I'm looking for ways to generate test problems for simplex-method linear programming solvers (A x <= b, x >= 0) that have many vertices, so (I believe) would make difficult test problems. There's quite a bit of theory that looks relevant, e.g. How…
denis
  • 21,378
  • 10
  • 65
  • 88
0
votes
1 answer

Triangulation of Polyhedron fails

I am trying to triangulate the faces of a polyhedron using CGAL 4.13 and the following code snippet, which takes a polyhedron definition file in OFF format on stdin: #include #include #include…
Ctx
  • 18,090
  • 24
  • 36
  • 51
0
votes
0 answers

Generating set of points satisfying constraints (logic conditions)

Suppose that we have the following formulation for a mixed-integer linear programming without considering its objective function. i.e. A set $$X = {(x,y) \in \mathbb{R}^n \times \mathbb{Z}^m \; | \; Ax +Bz <= d}$$ (I don't know how to put latex code…
Applicable Math
  • 171
  • 7
0
votes
1 answer

How to check the intersection of Polyhedron_3 in CGAL

I'm new in cgal and I need to check the intersection of two Polyhedron_3, I know that exist a function called intersection_Polyhedron_3_Polyhedron_3() that make this, but I don't know how to implement it. Can anyone give an example of how to use…
Rodrigo
  • 11
  • 1
0
votes
1 answer

use CGAL to store vertices,halfedges,adjecency list of polygon

I'm creating an application using qt-creator , it's read .off files and preview it's polygon . I want to store vertices , halfedges and adjacency list to add or remove specific vertices and storing adding and removing operations . any help or…
n.m
  • 485
  • 1
  • 5
  • 15
0
votes
1 answer

pyntcloud to polyhedral from pointcloud with normals

I have a pointcloud which I imported to the pyntcloud libray as a series of points, it is a fully 3D pointcloud, as in it bounds forms a volume. points = pd.DataFrame(points) points.columns = ['x', 'y', 'z'] cloud = PyntCloud(points) I calculate…
Spatial Digger
  • 1,883
  • 1
  • 19
  • 37
1 2 3
4
5 6