Quadratic bounds for hidden line elimination
SCG '86 Proceedings of the second annual symposium on Computational geometry
Worst-case optimal hidden-surface removal
ACM Transactions on Graphics (TOG)
Intersecting line segments in parallel with an output-sensitive number of processors
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
An efficient output-sensitive hidden surface removal algorithm and its parallelization
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Computation of the axial view of a set of isothetic parallelepipeds
ACM Transactions on Graphics (TOG)
Hidden curve removal for free form surfaces
SIGGRAPH '90 Proceedings of the 17th annual conference on Computer graphics and interactive techniques
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Efficient hidden surface removal for objects with small union size
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
A simple output-sensitive algorithm for hidden surface removal
ACM Transactions on Graphics (TOG)
Efficient collision detection for moving polyhedra
Proceedings of the eleventh annual symposium on Computational geometry
An Improved Output-size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains
Mathematical and Computer Modelling: An International Journal
An O(log N) parallel time exact hidden-line algorithm
EGGH'87 Proceedings of the Second Eurographics conference on Advances in Computer Graphics Hardware
| Hi-index | 0.00 |