Polygon decomposition

Article View: aus.computers.parallel

Article #546

Back to aus.computers.parallel Previous Next

#546

From: Steffen Koehler
Date: Wed, 15 May 1996 00:00

12 lines
777 bytes

Hello, 

I looking for some polygon decompositions for simple polygons, which work
on parallel computers. Spezially I'am interested at non overlapping 
decompositions into convex, star-shapped or spiral-shaped polygons
and their Time-complexity and the numbers of processors used.

Thanks in advance
Steffen K"ohler

PS: Please mail, because I read this newsgroup not regulary.

Technical Details

Message-ID: <4ncdot$o8e@fsuj19.rz.uni-jena.de>

Path: arc1-ca.pugleaf.net!unknown!not-for-mail

Show Full Headers

Complete Article Headers

X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: f9e8f,67f2da1da5a3892b,start
X-Google-Attributes: gidf9e8f,public
From: msk@rz.uni-jena.de (Steffen Koehler)
Subject: Polygon decomposition
Date: 1996/05/15
Message-ID: <4ncdot$o8e@fsuj19.rz.uni-jena.de>
X-Deja-AN: 154921850
organization: Friedrich-Schiller-University Jena, Germany
newsgroups: aus.computers.parallel