• Publications
  • Influence
A Perception Correlated Comparison Method for Dynamic Meshes
  • L. Vása, V. Skala
  • Computer Science, Medicine
  • IEEE Transactions on Visualization and Computer…
  • 1 February 2011
TLDR
This paper presents results of the subjective testing that has been performed, and a new measure called Spatiotemporal edge difference (STED) is derived which is shown to provide much better correlation with subjective opinions on mesh distortion. Expand
CODDYAC: Connectivity Driven Dynamic Mesh Compression
TLDR
An improved approach based on known techniques, such as principal component analysis (PCA) and EdgeBreaker, which allows efficient encoding of highly detailed dynamic meshes, exploiting both spatial and temporal coherence is presented. Expand
COBRA: Compression of the Basis for PCA Represented Animations
TLDR
This paper presents an extension of dynamic mesh compression techniques based on PCA, which allows very compact representation of moving 3D surfaces and since the data can be encoded very efficiently, the size of the basis cannot be neglected when considering the overall performance of a compression algorithm. Expand
A new approach to line and line segment clipping in homogeneous coordinates
  • V. Skala
  • Computer Science
  • The Visual Computer
  • 14 September 2005
TLDR
A new robust approach to intersection computations applied to line and line segment clipping using a rectangular window is presented and leads to algorithms that are simpler, robust, and easy to implement. Expand
Radial Basis Function Use for the restoration of Damaged Images
TLDR
Comparisons with standard method for image inpainting and experimental results are included and demonstrate the feasibility of the use of the RBF method forimage processing applications. Expand
An efficient algorithm for line clipping by convex polygon
  • V. Skala
  • Mathematics, Computer Science
  • Comput. Graph.
  • 1 July 1993
TLDR
The main advantage of the presented algorithm is the substantial acceleration of the line clipping problem solution and that edges can be oriented clockwise or anti-clockwise. Expand
O(lg N) line clipping algorithm in E2
  • V. Skala
  • Computer Science
  • Comput. Graph.
  • 1 January 2018
TLDR
A new O(lg N) line clipping algorithm in E2 against a convex window is presented and a comparison of the proposed algorithm with others shows a significant improvement in run-time. Expand
AN EFFICIENT ALGORITHM FOR LINE CLIPPING
TLDR
A new line clipping algorithm against convex window based on a new approach for intersection detection is presented and it is shown that edges can be oriented clockwise or anti-clockwise and the main advantage is the substantial acceleration of the line clipping problem solution. Expand
Surface Reconstruction From Problem Point Clouds
We present an algorithm for creating a CAD model of an existing physical object from a scanned point cloud containing badly scanned regions. The algorithm has a linear complexity and can be appliedExpand
RBF Interpolation with CSRBF of Large Data Sets
  • V. Skala
  • Computer Science, Mathematics
  • ICCS
  • 28 July 2017
TLDR
Property of the RBF interpolation for large data sets and large span of geometric coordinates of the given data sets with regard to expectable numerical stability of computation are explored. Expand
...
1
2
3
4
5
...