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

2
votes
0answers
30 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, rotation angle from horizontal And I ...
2
votes
0answers
56 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 ...
0
votes
0answers
41 views

What is the shape of the set of integer sided acute triangles with largest side n?

I played around with Gauss circle problem and found that if you take a certain sum in reverse and "in forward" and subtract the resulting sequences you get the OEIS sequence: https://oeis.org/A247588 ...
1
vote
0answers
61 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 ...
2
votes
3answers
234 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
197 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 ...
1
vote
0answers
50 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 ...
2
votes
0answers
87 views

Fitting a rotated ellipse to data points [closed]

I have a bunch of x,y scatter data and I am trying to fit an ellipse through them. I understand that this question has been asked before and there are resources for this, e.g.: Fitting ellipse to 5 ...
0
votes
0answers
62 views

Von Neumann's method to generate points uniformly distributed on a region of a n-sphere surface

I am trying to generate points uniformly distributed on a region of a single n-sphere surface (all angles in hyperspheric coordinates are between 0 and Pi/2). I decided to use von Neumann's method ...
0
votes
0answers
67 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 ...
22
votes
3answers
569 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 ...
5
votes
2answers
120 views

Discretizing regions with pointy boundaries

I'm trying to discretize a region with "pointy" boundaries to study dielectric breaking on electrodes with pointy surfaces. So far I've tried 3 types of boundaries, but the meshing functions stall ...
1
vote
1answer
94 views

Distinguishing left from right adjacent triangles in triangle mesh

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 ...
1
vote
0answers
75 views

Dirichlet conditions being ignored

I have the following domain: ...
1
vote
1answer
75 views

Toroidal implicit region looks weird

I have the following toroid surface: ...
5
votes
3answers
137 views

Find Unconnected Subregions

If I have a region, how can I identify sub regions that may be disconnected, if any exist? region defines a rectangular region given two diagonally opposed ...
1
vote
0answers
49 views

How can I define a metric in xAct?

I'm using "xAct" package and I want to define a my metric, that is a non standard metric. For example, my metric is diagonal ...
4
votes
2answers
173 views

Extracting ragged array from an image

I have a list of points, which represent positions of peaks in an image. The nature of the image itself shouldn't matter, as I already have the peak positions. As a simple example, consider the ...
20
votes
1answer
279 views

Bug in ArcLength?

With Mathematica 10.0.2: ArcLength[Line[{{0, 0}, {1, 0}, {2, 0}}]] ArcLength[Line[{{0}, {1}, {2}}]] (* 2 *) (* 2 *) However, ...
3
votes
3answers
234 views

Cut a polygon by a line

I have a polygon, says, Polygon[{0,0},{10,0},{10,10}{0,10}]. I would like to cut it by a line (through two points) and take one half of it. Could you please suggest ...
1
vote
2answers
146 views

Only show part of a cube below an intersecting plane

I plot a cube and a plane. I just want to show the part below the plane. The code: ...
5
votes
2answers
143 views

Test existence of a path from one side of a graph to another

I'm trying to determine how I can test if a path exists from one side of a graph to another as efficiently as possible. If I have the Lines given by: ...
6
votes
5answers
846 views

How to check if a line segment intersects with a polygon?

The naive method is to bisect the line segment iteratively as asked here, and then check the bisection points using How to check if a 2D point is in a polygon?. Would there be an other way? I'm ...
6
votes
1answer
167 views

Obtain polygons describing all intersections of many polygons

I have 6894 polygons describing zones in a state plane (i.e., cartesian) coordinate system. Most are not very complex, and I believe none have holes. A random example is Polygon[{{351633., ...
0
votes
0answers
46 views

How to determine if a point is within a geopositioned RegionMember

I have a KML file which contains an area of interest, I also have a number of lat/long geo positions. I'm trying to filter out the points not within my AOI. So I have my KML file. I convert it to a ...
2
votes
1answer
54 views

RegionUnion issues with many Regions

The new RegionUnion[] function is just what I needed if only I could get it to work. I have many non-overlapping regions that I will need to use as plotting domains ...
17
votes
5answers
289 views

Find the nearest locations for multiple points

Assume that there are many holes with their locations fixed, and the same number of balls distributed randomly. What is the smallest total distance for the balls fitting into the holes on the ...
1
vote
0answers
65 views

projecting a RegionProduct into 3D space

Apparently, RegionProduct should allow you to generate convolution-generated shapes. For instance, take a 1D curve and a sphere, and the region product I would ...
1
vote
2answers
175 views

Rotating a plane about an arbitrary axis

I would like to rotate a plane by $k$ degrees about an arbitrary axis. How should I do it using RotationTransform? hmm i realise if I do the following ...
5
votes
1answer
283 views

Areas of Voronoi cells from image file

I have an binary image with non-point objects. Does anyone have any suggestions how to determine area of each Voronoi cell in Voronoi diagram (goal is area distribution)? Thank you in advance.
6
votes
1answer
270 views

Collision detection algorithm (discrete) with sweep and prune algorithm

For a more complex collision detection approach, I need an efficient (aka fast) algorithm to prune the elements by using boundary boxes. A classical algorithm is the so called sweep and prune (SAP) ...
5
votes
3answers
311 views

Triangulated Mesh from Voronoi Diagram

I want to generate a mesh (using Mathematica 10) in the following manner: Generate a Voronoi diagram, like so: and then triangulate each individual Voronoi grain, were an edge is formed by ...
3
votes
1answer
89 views

Region plot of transformed region giving odd result

I tried applying a transformation to a rectangle: RegionPlot[TransformedRegion[Rectangle[{0, 0}, {1, 1}], {#1^(1/3) + #2, 1 + #2} &]] giving In reality, ...
11
votes
3answers
690 views

Finding the surface area of a 3D convex hull

I have noted several instances here and here where ConvexHullMesh, introduced in v10 has been used to greatly simplify some geometry problems. Determining the ...
1
vote
0answers
61 views

Use of Mathematica to put equation into vector form

Is there a way to put the following equation of a line into vector form using Mathematica (or a Mathematical package)? $\displaystyle ...
6
votes
2answers
192 views

A question regarding “DiscretizeGraphics”

I want to find the volume of a torus torus = RevolutionPlot3D[{2 + Cos[t], Sin[t]}, {t, 0, 2 Pi}] ...
6
votes
3answers
215 views

Speed of ConvexHullMesh

Pick $N$ random points on the surface of the sphere, then use ConvexHullMesh[] to compute their convex hull. Empirically, this takes time quadratic time in $N,$ ...
1
vote
1answer
106 views

how to find the vector intersection in a collection of triangulated 3D points?

I'm trying to calculate the 3D point coordinates for the intersection of a vector with a plane. I have been using the following code to do this: ...
7
votes
1answer
283 views

How to draw quantum circuit with mathematica?

How to draw quantum circuit as the following one with mathematica? I only find the quantum package which is designed for MMA 7.0 as the author said. But the version of my Mathematica is 9.0 and when ...
30
votes
6answers
1k views

Finding length of intersection of two surfaces

I would like to know how we find the length of the intersection of two surfaces. For instance, in the following example,a surface intersects with a plane: How do we find the length of intersection ...
16
votes
3answers
361 views

Site - Cell Correspondence in Voronoi Diagram obtained via VoronoiMesh

Consider the following: ...
19
votes
2answers
481 views

Object separation from a 2.5D surface

I'm trying to identify the shape and the boundaries of objects. The data was generated with a laser scanner and represent the surface of an area in which many boulders lay on the ground and making up ...
4
votes
5answers
359 views

Ordering the Boundary points of a Polygon

I feel like this should be simple, but I keep running into walls. Say someone gives you the coordinates of the vertices of a pentagon and the center point of the hexagon. Is there any way to get an ...
8
votes
2answers
300 views

How can I only draw outer common tangent to two circles?

I have code worked for drawing common tangent lines to two circles(http://en.wikipedia.org/wiki/Tangent_lines_to_circles), now I want to delete the inner common tangent lines, how? ...
5
votes
0answers
172 views

Convex hull of a large data set of 3D points

I recently needed to deal with a large data set of 600.000 points in three dimensions. My task was to find a convex hull for this data. I have Mathematica 10, so I could use the function ...
8
votes
3answers
369 views

Torus triangulation

I'd like to plot something similar to this but with a triangle instead of a pentagon. Also, I'd like to triangulate the faces, that is, to insert the diagonals for each face of the 3 prisms used. In ...
2
votes
1answer
146 views

RegionPlot3D run forever when plotting 3D ParametricRegion

when working with 2D, RegionPlot works fine with ParametricRegion as can be seen in this example: ...
1
vote
1answer
151 views

Is it necessary to introduce ImplicitRegion and ParametricRegion in version 10?

In version 10.0, Mathematica introduced a new function about region plotting: ImplicitRegion. But I'm wondered that haven't this function been already existed in the older version? That is, ...
10
votes
2answers
234 views

How can I decide whether a closed surface is intersected by a triangle?

A closed surface consisted of Polygons or GraphicsComplex and a triangle made by 3 points are in a 3D space. How can I decide ...