The power of geometric duality
BIT - Ellis Horwood series in artificial intelligence
Visibility of disjoint polygons
Algorithmica
Quadratic bounds for hidden line elimination
SCG '86 Proceedings of the second annual symposium on Computational geometry
Upper and lower time bounds for parallel random access machines without simultaneous writes
SIAM Journal on Computing
Constructing arrangements of lines and hyperplanes with applications
SIAM Journal on Computing
Worst-case optimal hidden-surface removal
ACM Transactions on Graphics (TOG)
A linear-processor algorithm for depth-first search in planar graphs
Information Processing Letters
An O(logN) parallel time exact hidden-line algorithm
Advances in computer graphics hardware II
SIAM Journal on Computing
Visibility problems for polyhedral terrains
Journal of Symbolic Computation
An efficient output-sensitive hidden surface removal algorithm and its parallelization
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
An efficient algorithm for hidden surface removal
SIGGRAPH '89 Proceedings of the 16th annual conference on Computer graphics and interactive techniques
Planar depth-first search in O(log n) parallel time
SIAM Journal on Computing
A simple output-sensitive algorithm for hidden surface removal
ACM Transactions on Graphics (TOG)
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
An introduction to parallel algorithms
An introduction to parallel algorithms
A polygonal approach to hidden-line and hidden-surface elimination
CVGIP: Graphical Models and Image Processing
Efficient hidden surface removal for objects with small union size
Computational Geometry: Theory and Applications
Output-sensitive methods for rectilinear hidden surface removal
Information and Computation
Journal of the ACM (JACM)
A Characterization of Ten Hidden-Surface Algorithms
ACM Computing Surveys (CSUR)
An algorithm for hidden line elimination
Communications of the ACM
On Computing the Upper Envelope of Segments in Parallel
IEEE Transactions on Parallel and Distributed Systems
Topological Lower Bounds on Algebraic Random Access Machines
SIAM Journal on Computing
The notion of quantitative invisibility and the machine rendering of solids
ACM '67 Proceedings of the 1967 22nd national conference
A linear time exact hidden surface algorithm
SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
A PRAM-on-Chip Vision (invited abstract)
SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
Computer-Aided Design
A Method for Solving the Visibility Problem
IEEE Computer Graphics and Applications
A Solution to the Hidden-Line Problem for Computer-Drawn Polyhedra
IEEE Transactions on Computers
Handbook of Parallel Computing: Models, Algorithms and Applications (Chapman & Hall/Crc Computer & Information Science Series)
Queue - GPU Computing
Overview of the IBM Blue Gene/P project
IBM Journal of Research and Development
Fundamental parallel algorithms for private-cache chip multiprocessors
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Computing the visibility map of fat objects
Computational Geometry: Theory and Applications
Using simple abstraction to reinvent computing for parallelism
Communications of the ACM
Geometric algorithms for private-cache chip multiprocessors
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Algorithms and theory of computation handbook
An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.01 |
Given a collection of non-intersecting simple polygons possibly with holes and with a total of n edges in three-dimensional space; parallel algorithms are given for the problems called hidden-line and hidden-surface removal in computer graphics. More precisely, algorithms are proposed to find the portions of the edges visible from (0, 0, ∞) and to find the upper envelope (i.e., the pointwise maximum) of the polygons. The proposed solution for the hidden-line problem is the parallelization of the optimal sequential algorithm given by Dévai in 1986. As the optimal sequential algorithm for the hidden-surface problem given by McKenna in 1987 is rather involved, a new optimal sequential algorithm is proposed, which is amenable to parallelization and might also have practical significance in its own right. Both of the parallel hiddenline and hidden-surface algorithms take Θ(log n) time using n2/ log n CREW PRAM processors.