Re: Painting Negative
On Sat, 17 May 2008 23:22:06 +0200, Flo 'Irian' Schaetz <iryan@xxxxxx>
wrote, quoted or indirectly quoted someone who said :
So the big question is: How can I fill everything EXCEPT the polygons?
fill the entire rectangle to start, then draw on top. Try
experimenting with various transparencies of paint till you see all
the effects possible.
--
Roedy Green Canadian Mind Products
The Java Glossary
http://mindprod.com
.
Relevant Pages
- Re: geometry algorithm needed
... the the area of the sorrounding rectangle is minimal. ... The polygons can touch each other, ... What I need is an approximation algorithm (which provides a good ... as you wish on the plane, as long as they don't overlap. ...
(rec.puzzles) - Re: geometry algorithm needed
... the the area of the sorrounding rectangle is minimal. ... The polygons can touch each other, ... What I need is an approximation algorithm (which provides a good ... as you wish on the plane, as long as they don't overlap. ...
(rec.puzzles) - Re: geometry algorithm needed
... the the area of the sorrounding rectangle is minimal. ... The polygons can touch each other, ... orientation of second polygon [0,2pi) ... you need to search for the minimum distance between the centers of the ...
(rec.puzzles) - Re: A partitioning problem
... The total number of polygons is the same as points, ... By "mass center" I assume you mean centroid. ... The weighted average is in the convex hull of the points being ... So if the centroid of the rectangle is not in the convex hull ...
(sci.math) - Re: A partitioning problem
... Hans wrote: ... Assume a 2D rectangular area, within which there are N different points. ... The total number of polygons is the same as points, ... If N=1 P must be in the center of rectangle. ...
(comp.graphics.algorithms) |
|
