The following pages link to (Q4775467):
Displaying 24 items.
- An improved immersed boundary method for curvilinear grids (Q435414) (← links)
- Managing cohort movement of mobile sensors via GPS-free and compass-free node localization (Q666167) (← links)
- The lazy z-buffer (Q672396) (← links)
- Visibility of surfaces via differential geometry (Q758089) (← links)
- Merging visibility maps (Q808306) (← links)
- The upper envelope of piecewise linear functions: Algorithms and applications (Q919830) (← links)
- Reconstructing visible regions from visible segments (Q1090463) (← links)
- Box sort, a multidimensional binary sorting method for rectangular boxes, used for quick range searching (Q1100911) (← links)
- Linear-time border-tracing algorithms for quadtrees (Q1188115) (← links)
- Hidden surface removal for \(c\)-oriented polyhedra (Q1194308) (← links)
- Efficient hidden surface removal for objects with small union size (Q1208434) (← links)
- An improved technique for output-sensitive hidden surface removal (Q1322562) (← links)
- Visibility with a moving point of view (Q1322569) (← links)
- Speed-up of the volumetric method of moments for the approximate RCS of large arbitrary-shaped dielectric targets (Q1738890) (← links)
- Cost-driven octree construction schemes: An experimental study (Q1775782) (← links)
- An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains (Q1804963) (← links)
- Numerical simulation of the blast impact problem using the Direct Simulation Monte Carlo (DSMC) method (Q1885792) (← links)
- Sweep methods for parallel computational geometry (Q1907233) (← links)
- On-line construction of the upper envelope of triangles and surface patches in three dimensions (Q1917040) (← links)
- A fast algorithm for polygon operations (Q2277883) (← links)
- Cost prediction for ray shooting in octrees (Q2495947) (← links)
- A fast planar partition algorithm. I (Q2638830) (← links)
- (Q4140329) (← links)
- Repetitive hidden-surface-removal for polyhedral scenes (Q5060145) (← links)
