Estimating the efficiency of a uniform-grid two-dimensional hashing algorithm for hidden line and surface removal in computer graphics
A uniform-grid two-dimensional hashing algorithm is described and applied to hidden line and surface removal and some theoretical bounds on its efficiency are derived under the following assumptions: there exist constants \(d>0\), \(c\geq 1\) such that for any surface \(\Gamma\) there are circles \(B_{d/c}\) and \(B_{dc}\) in the plane of the surface (of radii d/c and dc, respectively) such that \[ B_{d/c}\subset \Gamma \subset B_{dc} \] (these assumptions are true for finite element models). The upper bounds of the efficiency of the derived algorithm are given for separate directions and averaged over all directions, and its optimality is proved. Practical details of using the algorithm are also discussed.
- scientific article; zbMATH DE number 177849
- An efficient output-size sensitive parallel algorithm for hidden-surface removal for terrains
- scientific article; zbMATH DE number 645771
- A space-optimal hidden surface removal algorithm for iso-oriented rectangles
- scientific article; zbMATH DE number 1322703
- Efficient hidden surface removal for objects with small union size
- Output-sensitive methods for rectilinear hidden surface removal
- Efficient binary space partitions for hidden-surface removal and solid modeling
- An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains
This page was built for publication: Estimating the efficiency of a uniform-grid two-dimensional hashing algorithm for hidden line and surface removal in computer graphics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1107336)
