polygons question

From: makc.the.great@xxxxxxxxx
Date: 7 Nov 2005 02:49:33 -0800

suppose there are lots of polygons, z-ordered. how do you find if
particular polygon is visible?

that is, how do you check that an edge (line segment) lies within an
area covered by several polygons?

I was thinking about "collapsing" all foregound polygons into one union
shape, then you could just check one vertex and intersections with its
edges; but 1 how do I find union 2 is there better way?

.

Follow-Ups:
- Re: polygons question
  - From: RobertSzefler

Prev by Date: i-C&P "Computers + Philosophy" int'l conference -LAST CALL (1000+150 wds.)
Next by Date: Re: polygons question
Previous by thread: i-C&P "Computers + Philosophy" int'l conference -LAST CALL (1000+150 wds.)
Next by thread: Re: polygons question
Index(es):
- Date
- Thread

Relevant Pages

2D graphics library c#
... Union, intersect of two polygons, checking if point is inside polygon etc. ... Pierwszy łyk z pucharu nauk przyrodniczych czyni ateistą, ...
(microsoft.public.dotnet.languages.csharp)
Re: Distance between two polylines
... measuring orthogonal distance from the ... lies within the line segment. ... I haven't included the third for-loop because ... The polygons need not be closed paths. ...
(comp.soft-sys.matlab)
Re: Extracting polygons from a given set of lines
... all polygons from a given set of lines? ... load the PQ with the LOWER endpoint of each line segment. ... CLOSE the polygon below the intersection ...
(comp.graphics.algorithms)
Re: Determining which polygon is one point inside
... > You can store the polygons in a smart way, for example in a BSP. ... Prev by Date: ...
(comp.graphics.algorithms)
Re: Determining which polygon is one point inside
... You can store the polygons in a smart way, for example in a BSP. ... Prev by Date: ...
(comp.graphics.algorithms)