output
20042026
most citedSciPy 1.0--Fundamental Algorithms for Scientific Computing in Python

40.2k citations

Showing cs.GRShow all

10 papers · 1 filter

cs.GR2023★ 8 cited

A Comparison of Fundamental Methods for Iso-surface Extraction

Jan Patera, Vaclav Skala

In this paper four fundamental methods for an iso-surface extraction are compared, based on cell decomposition to tetrahedra. The methods are compared both on mathematically genera…

cs.GR2022★ 2 cited

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…

cs.GR2022★ 3 cited

A New Approach to Line-Sphere and Line-Quadrics Intersection Detection and Computation

Vaclav Skala

Line intersection with convex and un-convex polygons or polyhedron algorithms are well known as line clipping algorithms and very often used in computer graphics. Rendering of geom…

cs.GR2022★ 10 cited

Point-in-Convex Polygon and Point-in-Convex Polyhedron Algorithms with O(1) Complexity using Space Subdivision

Vaclav Skala

There are many space subdivision and space partitioning techniques used in many algorithms to speed up computations. They mostly rely on orthogonal space subdivision, resp. using h…

cs.GR2018★ 7 cited

A New Radial Basis Function Approximation with Reproduction

Zuzana Majdisova, Vaclav Skala

Approximation of scattered geometric data is often a task in many engineering problems. The Radial Basis Function (RBF) approximation is appropriate for large scattered (unordered)…

cs.GR2018★ 51 cited

Least Square Error Method Robustness of Computation: What is not usually considered and taught

Vaclav Skala

There are many practical applications based on the Least Square Error (LSE) approximation. It is based on a square error minimization 'on a vertical' axis. The LSE method is simple…

cs.GR2018★ 35 cited

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…

cs.GR2018★ 14 cited

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…

cs.GR2017

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…

cs.GR2017★ 27 cited

Continuous Global Optimization in Surface Reconstruction from an Oriented Point Cloud

Rongjiang Pan, Vaclav Skala

We introduce a continuous global optimization method to the field of surface reconstruction from discrete noisy cloud of points with weak information on orientation. The proposed m…