Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with computational-geometry
Search options not deleted
user 3056
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.
40
votes
Accepted
How to exactly calculate the volume?
No numerics hacks here; this really computes the volume symbolically. It is a bit tedious and demands some tricks which may appear more obvious in this answer than they would really be on the first tr …
- 19.1k
23
votes
Accepted
Divide a geometric region by (many) lines
You can find symbolic connected components (which are those regions you are asking about) in this case using CylindricalDecomposition. This can be a bit of an overkill if your goal is only to visualiz …
- 19.1k
22
votes
How to generate approximately equally spaced points efficiently
Many solutions similar to how to get $n$ equidistributed points on the unit sphere are possible, especially if one can accept that points are not on the edges of a region. For instance, one can use an …
- 19.1k
13
votes
Accepted
How to visualize a spherical mesh on a squared plane?
I wouldn't try to do this on a square (assuming you want at least some sort of systematic correspondence between edges on the sphere and their projections), at least if you don't want crossings on squ …
- 19.1k
12
votes
Accepted
Decomposition of a semialgebraic set into connected components
EDIT: CylindricalDecomposition has been improved since I wrote this answer, probably in v11.2! Now it takes an optional topological operation argument. As a result, one can achieve the results describ …
- 19.1k
12
votes
Mark all points in a triangle that have a certain property
If we phrase out the problem as "for each point {x, y} in the sought region there exists a line passing through it on which both points at the distance l/2 from {x, y} are inside the triangle", the pr …
- 19.1k
11
votes
Unexpected behavior of the procedure `Area` on the object 'Polygon'
EDIT: Reported to WRI as CASE:4237867 - fixed on V12. :)
Seems like a bug in my opinion. Consider the following:
With[{poly0 = Polygon[{{0, 0}, {4, 0}, {2, 2}, {4, 4}, {0, 4}}]},
With[{poly = Tran …
- 19.1k
11
votes
RegionMember[ ] in polygon
This seems like a bug. It might even be a bug I have reported in the past.
In particular, your polygon is slightly degenerate: it has {-3, 16} twice in a row, creating a zero-length edge. (This doesn …
- 19.1k
5
votes
Inflate and unite a list of 0D to 2D regions
Somewhat dumb method (for instance, every line has both two Disks and a StadiumShape overlapping), but it's not at least very complicated:
hulls0 = ConvexHullMesh /@ RandomReal[{-10, 10}, {3, 1, 2}]; …
- 19.1k
5
votes
How to generate approximately equally spaced points efficiently
Since Mma v12.2 spatial point processes have opened yet another possibility with HardcorePointProcess, which prevents processes from resulting points being pairwise closer than a specified distance fr …
- 19.1k
5
votes
2
answers
195
views
How to find intersection points of $n$ $n$-spheres reliably and efficiently when $n$ is large
I have positions and radii of $n$ $n$-dimensional hyperspheres and want to find their intersection points efficiently. A very-straight-forward solution seems quite reliable:
Timing@With[{d = 50},
Wi …
- 19.1k
4
votes
Accepted
Simplify behavior: assumption as Interval versus assumption as bounds
Element treats Intervals as geometric regions, and members of those geometric regions are vectors, even when they are of single dimension. (I don't think this is really properly documented anywhere - …
- 19.1k
4
votes
3
answers
189
views
Simplifying an expression to a sensible conic section polynomial
I have an expression which represents an intersection of the unit sphere and a cone, projected to two-dimensional plane:
expr = x^2 + y^2 <= 1 &&
1/Sqrt[5] (2 (1 + Sqrt[5]) x^2 + (-1 + Sqrt[5]) x …
- 19.1k
3
votes
0
answers
91
views
Better discretization for intersections of algebraic surfaces
I am looking for better, preferably analytical approaches to discretize intersections of algebraic surfaces. When surfaces are not identical, these solutions are either curves or points.
An extremely …
- 19.1k
2
votes
Find duplicates in list of InfiniteLine
RegionEqual, like many region functions, is able to compute symbolic results as long as arguments are fully specified. This allows more efficient constructions of the following kind - where the symbol …
- 19.1k