Let $P_1$ and $P_2$ be two polygons, and $V_1$, $V_2$, their respective sets of vertices. Then the set of vertices of the 4-dimensional duoprism $D$ formed by the Cartesian product of $P_1$ and $P_2$ is $V=\{(x,y,u,v) \mid (x,y) \in V_1, (u,v) \in V_2\}$. But how to get the edges of $D$? Currently, for convex polygons $P_1$ and $P_2$, then $D$ is convex and then I'm using a program to get the convex hull of $V$, and which provides the edges. Isn't there a straightforward mathematical way to get the edges?
2026-03-24 23:56:01.1774396561
How to get the edges of a duoprism?
44 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in GEOMETRY
- Point in, on or out of a circle
- Find all the triangles $ABC$ for which the perpendicular line to AB halves a line segment
- How to see line bundle on $\mathbb P^1$ intuitively?
- An underdetermined system derived for rotated coordinate system
- Asymptotes of hyperbola
- Finding the range of product of two distances.
- Constrain coordinates of a point into a circle
- Position of point with respect to hyperbola
- Length of Shadow from a lamp?
- Show that the asymptotes of an hyperbola are its tangents at infinity points
Related Questions in GRAPH-THEORY
- characterisation of $2$-connected graphs with no even cycles
- Explanation for the static degree sort algorithm of Deo et al.
- A certain partition of 28
- decomposing a graph in connected components
- Is it true that if a graph is bipartite iff it is class 1 (edge-coloring)?
- Fake induction, can't find flaw, every graph with zero edges is connected
- Triangle-free graph where every pair of nonadjacent vertices has exactly two common neighbors
- Inequality on degrees implies perfect matching
- Proving that no two teams in a tournament win same number of games
- Proving that we can divide a graph to two graphs which induced subgraph is connected on vertices of each one
Related Questions in CONVEX-HULLS
- Is every finite descending sequence in [0,1] in convex hull of certain points?
- What exactly the Ellipsoid method does?
- Why is the determinant test attractive for the Convex Hull algorithm?
- Unit-length 2D curve segment with maximal width along all directions
- A point in a convex hull
- Why is Sklansky algorithm convex hull wrong
- Proving this convex hull lemma
- Why do we check $n^2 - n$ pairs of points in SlowConvexHull algorithm?
- Convex combination of $2^n$ vectors from cartesian products of half-spaces
- There exists $\vec{w}$ such that $\vec{\beta}_j\cdot \vec{w}>0$ $\iff$ the origin is not in the convex hull of $\vec{\beta}_j$ and $\vec{e}_i$.
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Why, of course there is. Say, the vertices $(x_1,y_1)$ and $(x_2,y_2)\in V_1$ are joined by an edge, and so are $(u_1,v_1),\;(u_2,v_2)\in V_2$. Then the duoprism will have the following edges: $$\begin{array}{ccc} (x_1,y_1,u_1,v_1) & - & (x_1,y_1,u_2,v_2)\\ |& &| \\ (x_2,y_2,u_1,v_1) & - & (x_2,y_2,u_2,v_2)\\ \end{array} $$