Questions tagged [computational-geometry]
Questions on constructing graphical objects using relatively complex computations relating to the mathematical structures defining those objects. Examples include convex hulls, Voronoi diagrams, Delaunay triangulations, mathematical constructions, symmetries, genuses of curves and graphs and programmatic constructions of polyhedra.
787 questions
2
votes
2
answers
207
views
How should we formulate angle geometry constraints in Mathematica to help the solving system work more efficiently and speed up the solution process?
Quadrilateral $ABCE$ is a parallelogram. Point $D$ lies on segment $AE$. The diagonals of quadrilateral $ABCD$ intersect at point P. If $△ABP∼△CBD$ and $AB<BC$, find the ratio $\frac{AB}{BC}$.
The ...
5
votes
4
answers
846
views
Are there any good ways to improve this code so that it can solve the geometry problem?
While using Mathematica to solve the following geometry problem, my computation has been running for a long time without producing any result.
The geometry problem is:
Quadrilateral $ABCE$ is a ...
6
votes
3
answers
458
views
Turning Goldberg Graphs/Skeletons into Goldberg Polyhedrons (possibly skew)
I want to be able to turn the 1-skeletons from the Goldberg Graphs into polyhedrons.
An example is to turn this tetrahedral goldberg graph on the left into the polyhedron on the right:
which was ...
5
votes
3
answers
549
views
Compute the integer hull of a polyhedral set in Mathematica
Computing the integer hull of a polyhedral set creates the smallest convex set (polytope) containing all the integer points within the original polyhedral set.
(? The two convex hulls have the same ...
5
votes
3
answers
330
views
How to improve the symbolic computation speed for plane geometry with multiple constraint conditions?
This is the simple geometry problem I want to solve:
In triangle ABC with side lengths a, b, c respectively, there is a point D on side AB, where AD = d. Find the length of CD.
When solving this ...
4
votes
3
answers
509
views
Plotting the surface gained by joining every point of a line to every point of another line in 3D space
How can I write code for displaying two lines in 3D space at random and connecting all points of line A with all points of line B and displaying the resulting surface in Mathematica (what would it's ...
3
votes
1
answer
118
views
Is there a built-in function or custom function that can perform symbolic solving under `GeometricScene` constraints?
In the new version of Mathematica, there is a new function called GeometricSolveValues that can solve for unknown geometric quantities in a geometric scene with ...
1
vote
1
answer
157
views
How to improve the accuracy of the coordinates generated by the GeometricScene and RandomInstance functions?
When using the GeometricScene function and RandomInstance function, I noticed that the coordinate precision appears insufficient ...
5
votes
3
answers
366
views
How does one parallelize WindingPolygon?
Consider this toy model: a list 100,000 simple point sets, and we Map WindingPolygon over it:
...
7
votes
3
answers
467
views
(discrete) Surface parametrization in Mathematica
In Python there are very easy to use and efficient libraries for surface parametrization (for instance igl). I wonder if in Mathematica we have a ready-made implementation.
The parametrization is ...
3
votes
0
answers
183
views
Mathematica demonstration of the expected volume of a random polytope in a ball
Related MSE post
I'm trying to make Mathematica demonstration of the paper The expected volume of a random polytope in a ball.
In the $d$-dimensional Euclidean space $E^d$ ($d \geq 2$), consider the ...
3
votes
1
answer
278
views
Calculating maximal area of constrained SSS triangle
In triangle ABC, the lengths of the three sides are $a$, $b$, $c$, and they satisfy the equation $$3a^2 + 2b^2 + c^2 = 1.$$ I want to find the maximum possible area of the triangle.
Both the ...
6
votes
1
answer
273
views
Finding General Solution for Straight-Line Films between Two Closed Shapes [duplicate]
Given two closed shapes, I want to see if there exists a 'film' between the two shapes and if one exists what they are for various solutions where the film is formed by non-intersecting straight lines ...
0
votes
0
answers
91
views
is it possible to automatically cluster the points constructing iso-surfaces?
I’m working with a hexahedral mesh and analyzing how a level-set function intersects it. Below are the vertices, edges, and facets defining my hexahedron:
...
5
votes
3
answers
472
views
Frame of discrete curve
I have a collection of points $p_1,\cdots, p_n$ in 3d that defines a discrete space curve. I wish to compute/approximate the discrete-analog of the Frenet-Serret system/frame without interpolating to ...