Please use this identifier to cite or link to this item: doi:10.22028/D291-26449
Title: Hidden line elimination for isooriented rectangles
Author(s): Mehlhorn, Kurt
Näher, Stefan
Uhrig, Christian
Language: English
Year of Publication: 1990
DDC notations: 004 Computer science, internet
Publikation type: Report
Abstract: We consider a special case of the hidden line elimination problem. The scene consists of n isooriented rectangles in R^{3} and an observer at z=+\infty. We give an algorithm that computes the visible parts of the edges on a random access machine in time O(n\log n+k\log\frac{n^{2}}{k}), where k is the number of line segments in the output, and uses O(nlog n) space.
Link to this record: urn:nbn:de:bsz:291-scidok-51409
Series name: Technischer Bericht / A / Fachbereich Informatik, Universität des Saarlandes
Series volume: 1990/02
Date of registration: 3-Apr-2013
Faculty: MI - Fakultät für Mathematik und Informatik
Department: MI - Informatik
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes

Files for this record:
File Description SizeFormat 
fb14_1990_02.pdf12,37 MBAdobe PDFView/Open

Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.