A nearly output sensitive parallel hidden surface removal algorithm in object space

Show simple item record
dc.contributor.authorMeyer, Klaus
dc.contributor.editorSkala, Václav
dc.date.accessioned2015-09-22T10:50:52Z
dc.date.available2015-09-22T10:50:52Z
dc.date.issued1998
dc.description.abstract-translatedWe present a new method for solving the hidden surface removal (HSR) problem in parallel on a crew pram using a combination of new observations and known methods for solving related geometric problems. The new algorithm obtains the bounds of O (log2 n) time and O (n long n + 1) processors, where n is the amount of given endpoints of the input and l is the number of intersections in the viewing plane. In contrast to most known algorithms solving the HSR problem in object space, this method is able to process input scenes where penetrations of line segments and polygonal areas are allowed. The ability to process such an input has enormous advantage for integrating three dimensional curves c ∩ IR3, which have been approximated by segments. Since a penetration of two polygonal areas will be detected during run time, this algorithm could also be used for testing given scenes for intersections of polygonal areas. In this case the algorithm is able to solve the hidden line removal problem in the same bounds. For practical purposes this algorithm allows also non convex (but simple and planar) polygons as input. You do not have to have triangulated scenes. According to the constraints of object space HSR algorithms, we will construct the visibility graph of the given scene as a planar graph in the viewing plane. Although the number of processors depends on the number of intersections in the viewing plane, in most given scenes this method will work like an output sensitive algorithm. Typical examples like "one big rectangle is covering all intersections" will be detected and these intersections are not computed.en
dc.format10 s.cs
dc.format.mimetypeapplication/pdf
dc.identifier.citationJournal of WSCG. 1998, vol. 6, no. 1-3.en
dc.identifier.issn1213-6972 (print)
dc.identifier.issn1213-6980 (CD-ROM)
dc.identifier.issn1213-6964 (online)
dc.identifier.urihttp://hdl.handle.net/11025/15847
dc.identifier.urihttp://wscg.zcu.cz/wscg1998/wscg98.htm
dc.language.isoenen
dc.publisherVáclav Skala - UNION Agencycs
dc.relation.ispartofseriesJournal of WSCGen
dc.rights© Václav Skala - UNION Agencycs
dc.rights.accessopenAccessen
dc.subjectparalelní algoritmuscs
dc.subjectparalelní výpočetní geometriecs
dc.subjectparalelní a distribuovaná grafikacs
dc.subjectpočítačová grafikacs
dc.subject.translatedparallel algorithmen
dc.subject.translatedparallel computational geometryen
dc.subject.translatedparallel and distributed graphicsen
dc.subject.translatedcomputer graphicsen
dc.titleA nearly output sensitive parallel hidden surface removal algorithm in object spaceen
dc.typečlánekcs
dc.typearticleen
dc.type.statusPeer-revieweden
dc.type.versionpublishedVersionen

Files

Original bundle
Showing 1 - 1 out of 1 results
No Thumbnail Available
Name:
Meyer_98.pdf
Size:
254.59 KB
Format:
Adobe Portable Document Format
Description:
Plný text
Download
License bundle
Showing 1 - 1 out of 1 results
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Volume 6, number 1-3 (1998)