194 citations · 543 across the 38 of their papers we have counts for
6 papers · 2 filters
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…
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…
Line Clipping in E3 with Expected Complexity O(1)
Vaclav Skala
A new line clipping algorithm against convex polyhedron in E3 with an expected complexity O(1) is presented. The suggested approach is based on two orthogonal projections to E2 co-…
Two New Algorithms for Line Clipping in E2 and Their Comparison
Vaclav Skala, Duc Huy Bui
Many algorithms for clipping a line by a rectangular area or a convex polygon in E2 or by a non-convex or convex polyhedron in E3 have been published. The line segment clipping by…
A New Algorithm for Pyramidal Clipping of Line Segments in E3
Vaclav Skala, Duc Huy Bui
A new algorithm for clipping a line segment against a pyramid in E3 is presented. This algorithm avoids computation of intersection points which are not end-points of the output li…