10 citations · 43 across the 11 of their papers we have counts for
11 papers
Line-Torus Intersection for Ray Tracing: Alternative Formulations
Vaclav Skala
Intersection algorithms are very important in computation of geometrical problems. Algorithms for a line intersection with linear or quadratic surfaces are quite efficient. However…
Algorithm for Finding an Exact Maximum Distance in E2 with Oexp(N) Complexity: Analysis and Experimental Results
Vaclav Skala
This paper describes a novel and fast, simple and robust algorithm with O(N) expected complexity which enables to decrease run time needed to find the maximum distance of two point…
Polar, Spherical and Orthogonal Space Subdivisions for an Algorithm Acceleration: O(1) Point-in-Polygon/Polyhedron Test
Vaclav Skala
Acceleration of algorithms is becoming a crucial problem, if larger data sets are to be processed. Evaluation of algorithms is mostly done by using computational geometry approach…
A New Formulation for Total Least Square Error Method in d-dimensional Space with Mapping to a Parametric Line
Vaclav Skala
There are many practical applications based on the Least Square Error (LSE) or Total Least Square Error (TLSE) methods. Usually the standard least square error is used due to its s…
Fast O_{expected}(N) Algorithm for Finding Exact Maximum Distance in E^2 Instead of O(N^2) or O(N lg N)
Vaclav Skala
This paper describes novel and fast, simple and robust algorithm with O(N) expected complexity which enables to decrease run-time needed to find an exact maximum distance of two po…
New Geometric Continuity Solution of Parametric Surfaces
Vaclav Skala
This paper presents a new approach to computation of geometric continuity for parametric bi-cubic patches, based on a simple mathematical reformulation which leads to simple additi…