scholarly journals An input-size/output-size trade-off in the time-complexity of rectilinear hidden surface removal

2005 ◽  
pp. 689-702 ◽  
Author(s):  
Michael T. Goodrich ◽  
Mikhail J. Atallah ◽  
Mark H. Overmars
Keyword(s):  
Time Complexity ◽  
Trade Off ◽  
Input Size ◽  
Hidden Surface Removal ◽  
Surface Removal

scholarly journals A Space-Optimal Hidden Surface Removal Algorithm for Iso-Oriented Rectangles

2020 ◽  
Vol 31 (05) ◽  
pp. 539-549
Author(s):  
Andreas Kosmatopoulos ◽  
Athanasios Tsakalidis ◽  
Kostas Tsichlas
Keyword(s):  
Linear Space ◽  
Time Complexity ◽  
Hidden Surface Removal ◽  
Surface Removal

We investigate the problem of finding the visible pieces of a scene of objects from a specified viewpoint. In particular, we are interested in the design of an efficient hidden surface removal algorithm for a scene comprised of iso-oriented rectangles. We propose an algorithm where given a set of [Formula: see text] iso-oriented rectangles we report all visible surfaces in [Formula: see text] time and linear space, where [Formula: see text] is the number of surfaces reported. The previous best result by Bern [Journal of Computer and System Sciences 40 (1990) 49–69], has the same time complexity but uses [Formula: see text] space.

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

scholarly journals Evaluation of Hidden Surface Removal Methods Using Open GL

2021 ◽  
Vol 26 (2) ◽  
pp. 300-308
Author(s):  
Lubna Saeed ◽  
Fakhrulddin Ali
Keyword(s):  
Hidden Surface Removal ◽  
Open Gl ◽  
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