Path: utzoo!attcan!uunet!crdgw1!rpi!maharaj
From: maharaj@ecse.rpi.edu (Maharaj Mukherjee)
Newsgroups: comp.graphics
Subject: RE. Need Algorithm for False Edge Intersection
Message-ID: <?*S$RH|@rpi.edu>
Date: 10 Jul 90 20:30:08 GMT
Distribution: all
Organization: Rensselaer Polytechnic Institute, Troy NY
Lines: 21
Keywords:False edge, data base, polygon

In Reply to <10710@chaph.usc.edu>


If your problem is just to create one single polygon why do you have to follow
step 1 and step 2 rigorously?

Here are some ideas.

1. Assume the polygons and the holes are in a kind of multilevel forest
hierarchy. The problem is to attach disjoint holes at one stage and the
outer polygon enclosing them at the previous stage to create one single
polygon.

2. Let us do it the following way.

a. Join the closest hole to the outer polygon (define closest by some
distance metric of vertices) and rename the polygon so created as the
outer polygon.

b. Join rest of the holes in a similar manner incrementally, one at a
time.