Search


Current filters:

Start a new search
Add filters:

Use filters to refine the search results.

 | 
Results 1-10 of 12 (Search time: 0.008 seconds).
Item hits:
Issue DateTitleAuthor(s)
1994O(lg N) Line Clipping Algorithm in E2Skala, Václav
1994Point in Polygon Algorithm with O(1) ComplexitySkala, Václav
1994An Algorithm for Line Clipping by Convex Polyhedron in E3 with O(N1/2) ComplexitySkala, Václav
1994O(lg N) Line Clipping Algorithm in E2Skala, Václav
1993Memory Saving Technique for Space Subdivision TechniqueSkala, Václav
1995Algoritmy se strukturální složitostí menší než optimální aneb K čemu je programováníSkala, Václav
1997A Fast Algorithm for Line Clipping by Convex Polyhedron in E3Skala, Václav
1996Trading Time for Space: an O(1) Average time Algorithm for Point-in-Polygon Location Problem. Theoretical Fiction or Practical Usage?Skala, Václav
1996Line Clipping in E2 with O(1) Processing ComplexitySkala, Václav
1996A Comparison of O(1) and Cyrus-Beck Line Clipping Algorithms in E2 and E3Skala, Václav; Lederbuch, Pavel; Sup, Bohumír
search
navigation
  1. DSpace at University of West Bohemia
browse