Questions on constructing graphical objects using relatively complex computations relating to the mathematical structures defining those objects. Examples include convex hulls, mathematical constructions, symmetries, genuses of curves and graphs and programmatic constructions of polyhedra.

learn more… | top users | synonyms

6
votes
2answers
278 views

How to get UV mapping of 3D tube

Here is cylinder data: file We can mesh the surface, thanks to lalmei, Belisarius and Simon (link) How to achieve uv mapping from a 3d straight and curved tube? Working code: ...
17
votes
4answers
718 views

How to calculate the volume of a convex hull?

Given a spatial curve represented by a parametric equation, is it possible in Mathematica 9 to calculate symbolically (or at least numerically) the volume of its convex hull?
3
votes
0answers
41 views

How to measure cross sectional area of tube

Actually, all I want to do is measure cross-sectional area, major & minor axis length as move along the center line. is it possible to intersect tube using a plane and calculate cross-sectional ...
2
votes
1answer
60 views

How to draw a 3D convex hull of a set of points with styling

I´m trying to obtain the convex hull (with transparent faces) of a small number of points. I would like the Plot to have the points shown with small spheres numbers 1, 2, 3, ... along the axes ...
10
votes
2answers
236 views

Probable Bug in ConvexHullMesh

Consider points taken from the following parametric plot. See this question ...
2
votes
1answer
66 views

About TetGenTetrahedralize Mesh Size

I have used TetGenTetrahedralize to generated a cubic mesh. I want that the edge size of the triangle to be 0.2, how can realized this? And What does the word "pq1.414a1" mean? inst1 = ...
6
votes
1answer
77 views

Can't plot rotated region

I was experimenting with the code from this question when I ran into another problem with regions. ...
2
votes
2answers
118 views

Are there built-in functions for testing if a point lies within Graphics3D primitives?

I noticed in this question, Behavior of Graphics`Mesh`InPolygonQ with self-intersecting polygons, that Mathematica has some "psuedo-hidden" functionality for allowing one to quickly perform a winding ...
7
votes
3answers
890 views

Convex hull of a 3D object?

I am trying to find a convex hull command for a Graphics3D object. Does it exist in Mathematica? ...
21
votes
4answers
2k views

Efficiently determining if 3D points are within a surface composed of polygons

This is the 2nd part of a previous question which I edited to make into 2 separate questions: Extracting polygons from 3D contour plot surface As an extension of my earlier question involving simple ...
1
vote
0answers
107 views

How to define two polyhedron intersect or not?

Recently I have used Mathematica to simulate the concrete structure. The most important point is generate random concrete aggregate. As you know, concrete aggregate can be looked as a polyhedron. We ...
3
votes
1answer
81 views

What kind of object results from RegionIntersection function?

I'm trying to use RegionIntersection in a couple of Polygons. The polygons are the following: ...
5
votes
1answer
77 views

“The function DiscretizeGraphics is not implemented for GraphicsComplex” confusion

Why does DiscretizeGraphics seems to work on one GraphicsComplex and not the other? Here is an example that works: ...
0
votes
0answers
48 views

Death of parallel sub-kernels

EDIT : Finally, the new Mathematica 10.0 seems to fix it. I have a little parallelization problem. I wrote a code to generate a quasicrystal by dynamical generation. Here the code: ...
20
votes
5answers
900 views

How can I define a 3D version of the built-in VoronoiDiagram (VoronoiMesh in V10) function?

Can anybody point me in a direction that will guide me to extend the VoronoiDiagram function in Mathematica to handle 3D (three dimensional) situations (i.e. points in 3D)? Any help will be greatly ...
6
votes
1answer
150 views
5
votes
1answer
162 views

Difference (or intersection) of two convex polyhedra

I have two convex polyhedra stored in the following form: a set of vertices vertices = {{x1,y1,z1},...}, a set of faces, where each face is a convex polygon ...
15
votes
3answers
1k views

How to get actual triangles from DelaunayTriangulation[]?

The ComputationalGeometry package has a DelaunayTriangulation[] function. It returns a list of points connected to each point, ...
1
vote
1answer
74 views
34
votes
7answers
3k views

Intersecting graphics

Does the Mathematica graphics system have any concept of intersecting graphics? I've not found much in the documents so far. For example, if I want to show the intersection of two shapes: ...
17
votes
3answers
2k views

How to calculate volume of convex hull and volume of a 3D object

I have a set of random 3D data points. How can I calculate the volume of the convex hull?
4
votes
2answers
186 views

How to use a ConvexHull as RegionFunction?

I have a set of data supported over a region in 2D. I want to use RegionPlot and ContourPlot on interpolations of my data, but want to restrict the Plots to the region over which my data is supported. ...
45
votes
10answers
8k views

How to check if a 2D point is in a polygon?

Background: I use code from An Efficient Test For A Point To Be In A Convex Polygon Wolfram Demonstration to check if a point ( mouse pointer ) is in a ( convex ) polygon. Clearly this code fails for ...
16
votes
5answers
1k views

How to speed up the function DelaunayTriangulation?

First define a function meshGrid to generate some points: ...
1
vote
1answer
72 views

how to find iso-cost contours on a 2d plot efficiently

Consider a 2D plot in which dimension 1 and 2 represent quantity 1 and 2 respectively ranging over 0 to 100. Each point in the space corresponding to (x,y) represent cost of choosing quantity 1 as x ...
3
votes
1answer
198 views

How to map vertex points from the surface of a straight pipe onto 2D plane

How to map vertex points from the surface of a straight pipe onto 2D plane. The 3D surface points of the straight pipe can be found here: data Working code: ...
7
votes
4answers
366 views

Distances between points in periodic cube

How can one implement more efficiently/elegantly/memory savvily the following function which returns a matrix of all Euclidian distances between points in 3D within a cube of width ...
5
votes
1answer
100 views
2
votes
0answers
37 views

Voronoi diagram for line segments in Mathematica [duplicate]

I know that mathematica has built in functions for creating triangulations and Voronoi diagrams. However I haven't found a function that would create a Voronoi diagram for line segments. Is there a ...
1
vote
0answers
68 views

Trying to study the three points theorem of the Mobius Transformation

I am trying to study the three points theorem of the Mobius transformation. This theorem says that the Mobius transformation $M$ maps three distinct points p, q, r to three distinct points p', q', r'. ...
16
votes
2answers
1k views

Generating convex polyhedron from face planes?

Suppose I have lists of normals and points for planes. There's a convex polyhedron whose faces lie on these planes and are bounded by plane intersections. What would be the easiest way to produce an ...
3
votes
1answer
88 views

Problem with PlanarGraphPlot And ConvexHull

I'm getting a lot of strange errors when using PlanarGraphPlot with a simple list of 11 points. This is using Mma 9.0.1 64-bit Mac OS X. ...
0
votes
1answer
136 views

Area of a convex polygon with a set of points [duplicate]

I have a set of points Pts[a_,b_,c_]:={{a, b}, {b, a}, {c, a}, {a, c}, {b, c}, {c, b}} which define a convex polygon and I would like to find its area. There is ...
14
votes
2answers
770 views

Implementation of Balaban's Line intersection algorithm in Mathematica

I'm trying to implement a Brillouin Zone algorithm within Mathematica, including the generation of Brillouin zones of higher order in 2D and 3D. There is a nice implementation of generating these ...
2
votes
2answers
290 views

Image processing: extracting ordered contour

Continuing the question How to extract the edge from a set of points and its answer by Simon Woods, I would like to ask if there is a way to extract the boundary of obtained as ...
4
votes
4answers
207 views

Choosing $n$ equidistant points on a circle with given radius and center

I would like to have a function circle which takes two inputs: a tuple {x,y} and a real number ...
29
votes
8answers
4k views

Circuit drawing in Mathematica

This past semester I taught an introductory electromagnetism course and had quite a nice time using Mathematica to draw all sorts of figures and diagrams (mostly for problems and etc.). However, I was ...
2
votes
0answers
217 views

Visualising Special Relativity

Mathematica newbie learning by doing (or not so far, in this case). Problem: Special Relativity - consider two inertial frames $A$ & $A'$ in relative motion. At a time $t0$ as measured in $S$, ...
-6
votes
1answer
107 views

Poincaré section for 3BP

I try to plot the Poincaré section for the 3BP i use the following code that works very well: ...
1
vote
2answers
131 views

intersection between function and plane

I try to solve a ODE system of equations and i want to plot the intersection of the 3D solutions with a costant plane. To do this i use the follow code: ...
93
votes
3answers
12k views

How to create word clouds?

Word clouds are rather useless fancy and visually appealing plots, where words are plotted with different sizes according to their frequency in a corpus. Many applications exist out there (Wordle, ...
12
votes
1answer
633 views

Proving inequalities with Mathematica

Question summary: I would like to learn some tips and tricks on how to prove inequalities with Mathematica. I'm studying various inequalities in triangle that have the form $R+ar + bs\geq 0$, where ...
2
votes
0answers
137 views

4 circular arcs, how plot the minimal surface?

By using Sjoerd de Vries code for circular arcs: ...
11
votes
1answer
233 views

Finding minimal region with padding and linear map to circle

Suppose I have n ordered points. I would like to find a simple region that contains all the points and is close to the smallest region that contains the points except it is smooth and has some ...
27
votes
3answers
1k views

Create a torus with a hexagonal mesh for 3D-printing

I am new to Mathematica, and I'm looking for a way to create patterns on the surface of 3D objects. One thing I have not been able to do is create a hexagonal mesh on a torus. What I would like to ...
2
votes
1answer
228 views

Bounded Voronoi Diagram

I am trying to compute a Voronoi diagram bounded by a box. In some cases, the points used to compute the diagram form a diagram such that at least two boundary points are within the same polygon. For ...
-2
votes
1answer
299 views

Perimeter and area are positive integers

In Geometry 3D, How can I find the vertices with integer coordinates of a triangle whose perimeter and area are positive integers with Mathematica? Suppose its vertices $(x,y,z)$ has coordinates ...
3
votes
6answers
394 views

How to find the vertices of a regular tetrahedron? a dodecahedron?

My question is: how to find the coordinates of the vertices of regular tetrahedron and dodecahedron? I tried to find the coordinates of the vertices of a regular tetrahedron as the solutions of a ...
3
votes
0answers
151 views

How to get vertices of a polytope given by equalities and inequalities?

I have a polytope given by some equalities and inequalities, how can I get all the vertices of the polytope? If there's a way to deal with the one given by inequalities only, how can I reduce the ...
3
votes
1answer
89 views

BoundedDiagram Error

Although BoundedDiagram function worked well for a small data set, I got errors in a specific case that I cannot explain. I am sorry I am pasting here a large list ...