35 citations · 93 across the 7 of their papers we have counts for
8 papers
O(lgN) Line Clipping Algorithm in E2
Vaclav Skala
A new O(lg N) line clipping algorithm in E2 against a convex window is presented. The main advantage of the presented algorithm is the principal acceleration of the line clipping p…
A Fast Algorithm for Line Clipping by Convex Polyhedron in E3
Vaclav Skala
A new algorithm for line clipping against convex polyhedron is given. The suggested algorithm is faster for higher number of facets of the given polyhedron than the traditional Cyr…
A Comparative Study of LOWESS and RBF Approximations for Visualization
Michal Smolik, Vaclav Skala, Ondrej Nedved
Approximation methods are widely used in many fields and many techniques have been published already. This comparative study presents a comparison of LOWESS (Locally weighted scatt…
Space Subdivision to Speed-up Convex Hull Construction in E3
Vaclav Skala, Zuzana Majdisova, Michal Smolik
Convex hulls are fundamental geometric tools used in a number of algorithms. This paper presents a fast, simple to implement and robust Smart Convex Hull (S-CH) algorithm for compu…
Fast Algorithm for Finding Maximum Distance with Space Subdivision in E2
Vaclav Skala, Zuzana Majdisova
Finding an exact maximum distance of two points in the given set is a fundamental computational problem which is solved in many applications. This paper presents a fast, simple to…
A two-level approach to implicit surface modeling with compactly supported radial basis functions
Rongjiang Pan, Vaclav Skala
We describe a two-level method for computing a function whose zero-level set is the surface reconstructed from given points scattered over the surface and associated with surface n…