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

16
votes
5answers
1k views

Insphere for Irregular Tetrahedron

I am looking for existing Mathematica code to compute the unique sphere inscribed inside an irregular tetrahedron. I can write it myself, but I would love to find that someone already performed this ...
118
votes
4answers
15k 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, ...
4
votes
1answer
44 views

DelaunayMesh in a specified closed region

I have a list of discrete points wich I want to use as nodes for creating a 2D mesh. I used DelaunayMesh and it works fine. The problem that I have is that some elements/polygons are outside of the ...
10
votes
2answers
178 views

How to convert a surface into a solid

Context I am interested in converting surfaces into solids (so I can make a 3D mesh out of them using ToElementMesh) Say I have the following cool surface ...
21
votes
2answers
855 views

How can the {x,y,z} points that fall on the outer boundary of a set of values be selected and smoothly surfaced?

For a given set of x,y,z values, that may, or may not form a uniform shape, how can the center of the data cloud be found, and the surface points be located and a solid smooth surface created from ...
9
votes
6answers
3k views

How do I draw a hemisphere?

I want to draw a solid or partially transparent hemisphere above a partially transparent cuboid object in Graphics3D. However, I do not know how to do this s.t. only half the sphere is drawn. Here's ...
5
votes
1answer
109 views

DiscretizeGraphics and BoundaryDiscretizeGraphics Fail on CapsuleShape and SphericalShell

It seems the new Graphics3D primitives have some incomplete features. Earlier, I uncovered a problem with computing their exact surface area see here. Now, I ...
10
votes
2answers
121 views

Possible Bug in Computing Surface Area of Certain Geometric Regions

Mathematica 10.2 introduced some new geometric regions. Two of the new regions include SphericalShell and CapsuleShape. ...
5
votes
0answers
86 views

Possible Bug with Options in DelaunayMesh

Update: It turns out after some testing, none of the Options work in DelaunayMesh when 3D point sets are involved. Original ...
36
votes
2answers
832 views

Numerically solving Helmholtz equation in 3D for arbitrary shapes

Context While studying manifold Learning I got interested in finding the eigenvectors of the Laplacian. (also in connection to this problem of solving the heat equation) Following this and that ...
1
vote
1answer
79 views

How to reconstruct a surface given points {x, y, z} and the surface normals {nx, ny, nz} at these points

I have 3D points above a 2D regular grid. At those points I know the normal vector of the surface. I am looking a command or function in Mathematica, like ...
6
votes
1answer
101 views

Why is RegionMeasure so slow when calculating intersection area of a 2D and a 3D object?

If you think this description is too long, you can read the problem directly I know normally when one wants to calculate an region, this guide is useful. However, when it comes to calculating an ...
2
votes
0answers
210 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: ...
0
votes
0answers
34 views

Finding intersection of two infinitely long lines using points [duplicate]

EDITED In the Find intersection of pairs of straight lines problem, it is assumed that line are intersected by default and the purpose is to find the intersection points. In the present problem, two ...
2
votes
1answer
545 views

Creating hexahedral finite elements in Mathematica

Is it possible to do FEM using hexahedral elements in Mathematica? If it possible, is there any help to do that?
2
votes
2answers
223 views

Finding integral points on a surface

Suppose I have a dimension formula (for a Lie algebra representation) that is as follows: $$ d(a,b) = {(a+1)(b+1)(a+b+2) \over 2} $$ Now consider the surface $F(a,b,n) = 0 = d(a,b) -n$ where $n \in ...
3
votes
0answers
58 views

Simple ways to implement vector dilation

Suppose we have a singly connected but not necessarily convex polygon. Something like shape = CountryData["Chad", "Coordinates"]. Is there a simple way to ...
9
votes
2answers
140 views

VoronoiMesh without edges

How can I remove the edges of a VoronoiMesh? I would like to display only the closed cells not touching the border of the image. This is my binarized source image (imgbw): I am doing this: ...
3
votes
1answer
130 views

Meshing of a cube

I want to mesh a cube and what I use is ToElementMesh[Cuboid[ {-1, -1, -1}, {1, 1, 1}]]. This creates a regular grid of the cube. Is there a way to specify that ...
0
votes
0answers
36 views

MaxCellMeasure fails in 3D?

Question How come MaxCellMeasure works in 2D but fails in 3D? Indeed if I try ...
4
votes
1answer
792 views

How to split compound polygons into convex polygons?

Is it possible to split non-convex polygons into convex plygons with Mathematica 9? For example: ...
2
votes
1answer
171 views

Distinguishing left from right adjacent triangles in triangle mesh [closed]

What I'm trying to do: I'm trying to create a path-drawing function which will produce a path like the one I-P in the diagram below. The way this path was generated requires me to swap between the ...
2
votes
1answer
90 views

ToElementMesh fails on DodecahedronIcosahedronCompound

Context I would like to compute the eigenmodes of a DodecahedronIcosahedronCompound. Why? Because it is cool! and I wonder how it rings… Starting with: ...
3
votes
1answer
76 views

ConvexHullMesh sometimes excludes valid points from convex hull

I have a sequence of polytopes that I am trying to visualize, and I find that ConvexHullMesh sometimes excludes points from the convex hull, and it does so inconsistently. In particular, notice these ...
2
votes
0answers
74 views

Defining a region from combination of data and geometric region

I would like to define a region in (x,y) by combining the region RegionPlot[ ImplicitRegion[ Sqrt[x^2 + y^2] <= 0.99, {{x, 0.01, 0.99}, {y, 0.01, 0.99}}]] ...
17
votes
2answers
590 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 ...
4
votes
2answers
125 views

ToElementMesh problem on Ball defined by ImplicitRegion?

Could any one please confirm the following bug in mathematica 10.0.2 ? If I define this ball Ω = ImplicitRegion[0 <= x^2 + y^2 + z^2 <= 1, {x, y, z}]; and ...
5
votes
1answer
115 views

How to fill the closed region by ParametricPlot with solid color?

I am interested in the following implicit curve with parametric equation: $$ \left\{\quad \begin{array}{rl} x=& 9 \sin 2 t+5 \sin 3 t \\ y=& 9 \cos 2 t-5 \cos 3 t \\ \end{array} \right. $$ ...
3
votes
0answers
90 views

Region Intersection for MeshRegion objects embedded in 3D

How can I create a logical intersection of MeshRegion objects that are three-dimensional? The RegionIntersection function will ...
6
votes
1answer
96 views

Need help on the proper use of a formula to produce a cambered airfoil

Following the book on "The Theory of Thin Wing Sections" page #112 describes the method to combine a camber line (i.e Mean Line) and a thickness distribution to form a cambered wing section. Data ...
58
votes
11answers
11k 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 ...
0
votes
1answer
35 views

Parse notation recursively

For a special notation I would like to get the help of Mathematica to expand complex expressions through a set of Notation rules. However since this tasks involves applying the notation recursively ...
19
votes
2answers
2k 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 ...
8
votes
1answer
126 views

Decomposition of a semialgebraic set into connected components

Is there any built-in function for doing decomposition of a semialgebraic set into connected components? The only way I now can think of is to use ...
0
votes
0answers
43 views
1
vote
1answer
88 views

Package for symbolic computation of christoffel symbols and parallel transports in Riemannian geometry, given the metric

I've no knowledge in mathematica (but I do in matlab), but I'd really appreciate if someone could mention what is/are the best and easy to learn mathematica package(s) for symbolic and numerical ...
1
vote
0answers
46 views

How to speed up geometric Resolve query involving $\exists$ and $\forall$?

I would want to test connectedness of semialgebraic sets with naive code like this: ...
9
votes
3answers
591 views

How to ensure that Polygon[list] plots a simple polygon?

Consider the following code which plots a triangle. p = {{0, 0}, {.2, 0}, {0, .2}}; {Cyan, Polygon[Dynamic[p]]} // Graphics Then adding (for example) ...
-2
votes
1answer
55 views

Solve on parametric equation produces inequal results

I have a parametric (parameter t) equation in two dimensions (vectors). s = Solve[pt[t] == qt[t], {a, b}] Both pt and qt are parametric lines using a and b as ...
13
votes
3answers
2k views

Finding a Concave Hull

I have a 3d clustered data: Is there any other way to get concavehull of 3D data points?
2
votes
1answer
171 views

Region bounded by Ellipse and Line

I have an ellipse defined either as algebraic or geometric: algebraic: ax^2 + bxy +cy^2 + dx +ey +f = 0 geometric: major Axis, minor Axis, x center, y center, ...
0
votes
0answers
69 views

Broad Phase Collision Detection with Mathematica and using CUDA

In this and this post, I asked the question about a fast sweep and prune algorithm implementation for broad phase collision detection. To further speed up things a CUDA implementation would be even ...
24
votes
2answers
324 views

Bug in ArcLength?

fixed in 10.1 (windows) With Mathematica 10.0.2: ArcLength[Line[{{0, 0}, {1, 0}, {2, 0}}]] ArcLength[Line[{{0}, {1}, {2}}]] (* 2 *) (* 2 *) However, ...
3
votes
0answers
85 views

Differential Geometry on a MeshRegion

For many many years (honestly, since 1987) I've had my own MMa computational geometry code for dealing with 3D meshes. I principally (there's a joke there somewhere) use it to calculate coordinate ...
1
vote
0answers
101 views

Collision detection algorithm (discrete) with sweep and prune algorithm for periodic boundary conditions

EDIT: Question Updated with solution approach, but solution much slower than original implementation. Any ideas to speed up implementation? In the discussion on collision detection (see here) I asked ...
28
votes
3answers
749 views

Can Mathematica solve Plateau's problem (finding a minimal surface with specified boundary)?

Given a closed curve $\mathcal C$ in three dimensions, is it possible to use Mathematica's built-in functionality to compute a minimal surface whose boundary is $\mathcal C$? For simplicity, let us ...
2
votes
3answers
251 views

Surface area of a cylinder [closed]

Evaluating expr = {Sin[t], Cos[t], Sin[p]}; ParametricPlot3D[expr, {t, 0, 2 π}, {p, 0, 2 π}] Area[expr, {t, 0, 2 π}, {p, 0, 2 π}] gives an area of ...
2
votes
2answers
261 views

Finding if a point is in a region bounded by a curve and the axes (curve made of discrete points)

Here's a small example this is not the real curve but a simple example I made for this question. Here's the plot of a list with a point A of known coordinates. Now I need to find if the point A ...
20
votes
6answers
2k views
1
vote
0answers
71 views

Implementation of Lubaehevsky-Stillinger Algorithm to pack hard spheres

To generate a model of a polycrystalline material with specified grain size distribution (e.g coming from a Monte Carlo Grain Growth simulation) the Paper "Effects of grain size distribution and ...