Linked Questions

9 votes
1 answer
2k views

(Non-Convex) Polygon Union and Intersection Functions [duplicate]

Possible Duplicate: Intersecting graphics Back in 2009 I posted a question in comp.soft-sys.math.mathematica looking for a function which generates the union of two (not necessarily convex) ...
Cassini's user avatar
  • 5,636
89 votes
11 answers
20k 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 ...
nilo de roock's user avatar
149 votes
4 answers
27k 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, ...
István Zachar's user avatar
68 votes
8 answers
11k views

How to plot Venn diagrams with Mathematica?

How does one plot Venn diagrams with Mathematica? I've searched quite a bit and I've found one source at MathWorld which provides the source code for doing them. But I don't understand this code, can ...
Red Banana's user avatar
  • 5,573
50 votes
6 answers
9k views

Filling a polygon with a pattern of insets

I am trying to fill a shape with diagonal lines. I am aware of Texture, but it rasterizes the fill pattern, which is not desirable. Here was my crack at it: ...
Guillochon's user avatar
  • 6,197
44 votes
2 answers
5k views

Animating a Voronoi Diagram

edit: Excellent answers have been provided and I made an animation which is suitable for my use, however, all the examples rely on bitmap/rasterized data; is there a vector based approach? I would ...
s0rce's user avatar
  • 9,692
26 votes
2 answers
3k 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 ...
Rainer's user avatar
  • 2,951
22 votes
3 answers
1k views

LocatorPane and PlotRange

Consider the following snippet from the documentation on LocatorPane ...
nilo de roock's user avatar
23 votes
2 answers
3k views

Weather Maps with Mathematica

I've been trying to set up a weather map with Mathematica similar to what NOAA publishes in their website. So far I've been successful to bring the data over and extend it across the whole picture ...
Zviovich's user avatar
  • 9,328
20 votes
2 answers
2k views

Interactively extract points from a plot (ListPlot or SmoothDensityHistogram)

Is there a way to dynamically define a polygon on a plot (I'm working with ListPlot and SmoothDensityHistogram) to select a ...
Daniel S's user avatar
  • 233
17 votes
3 answers
9k views

Graphics3D: Finding intersection of 3d objects and lines

I found these two nice links 1) intersecting graphics 2) Implementation of Balaban's Line intersection algorithm in Mathematica which works for 2d. However, I need to find whether a ray(line) ...
s.s.o's user avatar
  • 4,577
17 votes
2 answers
2k views

What is the best way to clip a graphic to a region?

What is the best way to clip a graphic to a certain region? Here's a very simple implementation to show what I mean: ...
Szabolcs's user avatar
  • 236k
8 votes
4 answers
1k views

Cut out circle out of circle

In the documentation of FilledCurve, one can create a circle "cut-out" of a bigger circle using FilledCurve and ...
Gabriel's user avatar
  • 1,887
22 votes
1 answer
1k views

Cropping a Voronoi diagram

Someone know how can I get the correct crop of this Voronoi image using RegionFunction? As you can see, there is a lot of undesired white regions inside the left ...
Murta's user avatar
  • 26.4k
10 votes
1 answer
549 views

How to compile Heike's winding number function?

Heike gave the following function for winding number: ...
Duns's user avatar
  • 275
5 votes
2 answers
1k views

How to decompose a self intersecting polygon into simple polygons?

I want to divide a self intersecting polygon into simple polygons with winding number. For example ...
Aster's user avatar
  • 3,896