A multi-processor system for hidden-surface-removal

1981 ◽  
Vol 15 (4) ◽  
pp. 405-436 ◽  
Author(s):  
P. Chang ◽  
Ramesh Jain
Keyword(s):  
Hidden Surface Removal ◽  
Surface Removal

Hidden surface removal

2013 ◽  
pp. 131-156
Author(s):  
Alexey Boreskov ◽  
Evgeniy Shikin
Keyword(s):  
Hidden Surface Removal ◽  
Surface Removal

TRANSLATION QUERIES FOR SETS OF POLYGONS

1995 ◽  
Vol 05 (03) ◽  
pp. 221-242 ◽  
Author(s):  
MARK DE BERG ◽  
HAZEL EVERETT ◽  
HUBERT WAGENER
Keyword(s):  
Data Structure ◽  
Convex Hulls ◽  
N Storage ◽  
Polyhedral Terrains ◽  
Hidden Surface Removal ◽  
Few Vertices ◽  
Surface Removal

Let S be a set of m polygons in the plane with a total of n vertices. A translation order for S in direction [Formula: see text] is an order on the polygons such that no collisions occur if the polygons are moved one by one to infinity in direction [Formula: see text] according to this order. We show that S can be preprocessed in O(n log n) time into a data structure of size O(m) such that a translation order for a query direction can be computed in O(m) time, if it exists. It is also possible to test in O(log n) time whether a translation order exists, with a structure that uses O(n) storage. These results are achieved using new results on relative convex hulls and on embeddings with few vertices. Translation orders correspond to valid displaying orders for hidden surface removal with the painter’s algorithm. Our technique can be used to generate displaying orders for polyhedral terrains, for parallel as well as perspective views.

Hidden surface removal of computer-generated holograms for arbitrary diffraction directions

2013 ◽  
Vol 52 (20) ◽  
pp. 4871 ◽  
Author(s):  
Yusuke Sando ◽  
Daisuke Barada ◽  
Toyohiko Yatagai
Keyword(s):  
Hidden Surface Removal ◽  
Computer Generated Holograms ◽  
Surface Removal
Sign in / Sign up

Export Citation Format

Share Document