All Stories

  1. Radial basis function and multi-level 2D vector field approximation
  2. Why Is the Least Square Error Method Dangerous?
  3. Efficient Taylor expansion computation of multidimensional vector functions on GPU
  4. Optimized line and line segment clipping in E2 and Geometric Algebra
  5. Construction of new cubic Bézier-like triangular patches with application in scattered data interpolation
  6. Behavioral Study of Various Radial Basis Functions for Approximation and Interpolation Purposes
  7. Conditionality Analysis of the Radial Basis Function Matrix
  8. Conditionality of Linear Systems of Equation and Matrices Using Projective Geometric Algebra
  9. Diameter and Convex Hull of Points Using Space Subdivision in E2 and E3
  10. Efficient Speed-Up of Radial Basis Functions Approximation and Interpolation Formula Evaluation
  11. Finding Points of Importance for Radial Basis Function Approximation of Large Scattered Data
  12. Fuzzy Regression Model to Predict Daily Global Solar Radiation
  13. Radial Basis Function Approximation Optimal Shape Parameters Estimation
  14. Algorithm for placement of reference points and choice of an appropriate variable shape parameter for the RBF approximation
  15. Modified Radial Basis Functions Approximation Respecting Data Local Features
  16. Novel RBF Approximation Method Based on Geometrical Properties for Signal Processing with a New RBF Function: Experimental Comparison
  17. Reconstruction of Corrupted Vector Fields using Radial Basis Functions
  18. Visualizing the Energy of Scattered Data by Using Cubic Timmer Triangular Patches
  19. Efficient Visualization of Scattered Energy Distribution Data by Using Cubic Timmer Triangular Patches
  20. NEW CUBIC TIMMER TRIANGULAR PATCHES WITH C¹ AND G¹ CONTINUITY
  21. A New Simple, Fast and Robust Total Least Square Error Computation in E2: Experimental Comparison
  22. A New Strategy for Scattered Data Approximation Using Radial Basis Functions Respecting Points of Inflection
  23. Efficient Simple Large Scattered 3D Vector Fields Radial Basis Functions Approximation Using Space Subdivision
  24. Incremental Meshfree Approximation of Real Geographic Data
  25. Range-Restricted Surface Interpolation Using Rational Bi-Cubic Spline Functions With 12 Parameters
  26. Simple and Fast Oexp(N) Algorithm for Finding an Exact Maximum Distance in E2 Instead of O(N^2) or O(N lgN)
  27. Geometric Product for Multidimensional Dynamical Systems - Laplace Transform and Geometric Algebra
  28. Vector field radial basis function approximation
  29. Determination of Stationary Points and Their Bindings in Dataset Using RBF Methods
  30. A New Formulation of Plücker Coordinates Using Projective Representation
  31. A New Approach to Vector Field Interpolation, Classification and Robust Critical Points Detection Using Radial Basis Functions
  32. Large scattered data interpolation with radial basis functions and space subdivision
  33. Big geo data surface approximation using radial basis functions: A comparative study
  34. Radial basis function approximations: comparison and applications
  35. Least Square Method Robustness of Computations: What is not usually considered and taught
  36. Geometric Algebra, Extended Cross-Product and Laplace Transform for Multidimensional Dynamical Systems
  37. RBF Approximation of Big Data Sets with Large Span of Data
  38. Classification of Critical Points Using a Second Order Derivative
  39. High Dimensional and Large Span Data Least Square Error: Numerical Stability and Conditionality
  40. Projective geometry, duality and Plücker coordinates for geometric computations with determinants on GPUs
  41. RBF Interpolation with CSRBF of Large Data Sets
  42. Spherical RBF vector field interpolation: Experimental study
  43. Vector Field Second Order Derivative Approximation and Geometrical Characteristics
  44. Reducing the Number of Points on the Convex Hull Calculation Using the Polar Space Subdivision in E2
  45. Plücker Coordinates and Extended Cross Product for Robust and Fast Intersection Computation
  46. Total Least Square Error Computation in E2
  47. “Extended Cross-Product” and Solution of a Linear System of Equations
  48. A Comparative Study of LOWESS and RBF Approximations for Visualization
  49. A new formulation for total least square error method in d-dimensional space with mapping to a parametric line
  50. Point-in-convex polygon and point-in-convex polyhedron algorithms with O(1) complexity using space subdivision
  51. Space subdivision to speed-up convex hull construction in E3
  52. A new robust algorithm for computation of a triangle circumscribed sphere in E3 and a hypersphere simplex
  53. A new approach to line – sphere and line – quadrics intersection detection and computation
  54. A Point in Non-convex Polygon Location Problem Using the Polar Space Subdivision in E2
  55. Fast Algorithm for Finding Maximum Distance with Space Subdivision in E2
  56. Highly Parallel Algorithm for Large Data In–Core and Out–Core Triangulation in E 2 and E 3
  57. A new approach to hash function construction for textual data: A comparison
  58. GPU fast and robust computation for barycentric coordinates and intersection of planes using projective representation
  59. Fast Parallel Triangulation Algorithm of Large Data Sets in E2 and E3 for In-Core and Out-Core Memory Processing
  60. Geometric Transformations and Duality for Virtual Reality and Haptic Systems
  61. In-core and out-core memory fast parallel triangulation algorithm for large data sets in E2and E3
  62. Making 3D Replicas Using a Flatbed Scanner and a 3D Printer
  63. Simple 3D surface reconstruction using flatbed scanner and 3D print
  64. Fast reconstruction of corrupted images and videos by radial basis functions
  65. Normal Map Acquisition of Nearly Flat Objects Using a Flatbed Scanner
  66. Globally optimal rotation alignment of spherical surfaces with associated scalar values
  67. Fast Oexpected(N) algorithm for finding exact maximum distance in E2 instead of O(N2) or O(N lgN)
  68. Modified Gaussian elimination without division operations
  69. New geometric continuity solution of parametric surfaces
  70. Projective geometry and duality for graphics, games and visualization
  71. S-clip E 2
  72. Continuous global optimization in surface reconstruction from an oriented point cloud
  73. Surface reconstruction with higher-order smoothness
  74. A Perception Correlated Comparison Method for Dynamic Meshes
  75. A two-level approach to implicit surface modeling with compactly supported radial basis functions
  76. Geometry‐Driven Local Neighbourhood Based Predictors for Dynamic Mesh Compression
  77. Influence of essential parameters on the RBF based image reconstruction
  78. Progressive RBF interpolation
  79. COBRA: Compression of the Basis for PCA Represented Animations
  80. Detail-driven digital hologram generation
  81. Combined compression and simplification of dynamic 3D meshes
  82. Cross-talk measurement for 3D dispalays
  83. RBF-based image restoration utilising auxiliary points
  84. Space and time efficient isosurface extraction
  85. INTERSECTION COMPUTATION IN PROJECTIVE SPACE USING HOMOGENEOUS COORDINATES
  86. Barycentric coordinates computation in homogeneous coordinates
  87. Implicit Surface Modeling Suitable for Inside/Outside Tests with Radial Basis Functions
  88. CODDYAC: Connectivity Driven Dynamic Mesh Compression
  89. Full-Parallax Hologram Synthesis of Triangular Meshes using a Graphical Processing Unit
  90. HPO Hologram Synthesis for Full-Parallax Reconstruction Setup
  91. Iso-contouring in time-varying meshes
  92. Polygonisation of disjoint implicit surfaces by the adaptive edge spinning algorithm of implicit objects
  93. LENGTH, AREA AND VOLUME COMPUTATION IN HOMOGENEOUS COORDINATES
  94. A Spatio-temporal Metric for Dynamic Mesh Comparison
  95. Mesh simplification with respect to a model appearance
  96. Scanline rendering of digital HPO holograms and hologram numerical reconstruction
  97. A new approach to line and line segment clipping in homogeneous coordinates
  98. Polygonization of implicit surfaces with sharp features by edge-spinning
  99. Edge spinning algorithm for implicit surfaces
  100. Combinatories and Triangulations
  101. Curvature Dependent Polygonization by the Edge Spinning
  102. Surface Curvature Estimation for Edge Spinning Algorithm
  103. Hash functions and triangular mesh reconstruction
  104. Hash function use for triangular mesh reconstruction
  105. Editorial to the Special Issue on WSCG’01
  106. Fast Algorithm for Triangular Mesh Simplification Based on Vertex Decimation
  107. Extension of the Nicholls-Lee-Nichols algorithm to three dimensions
  108. Fast algorithms for clipping lines and line segments in E 2
  109. A fast algorithm for line clipping by convex polyhedron in E3
  110. Line clipping in E2 with O(1) processing complexity
  111. An Efficient Algorithm for Line Clipping by Convex and Non-convex Polyhedra in E3
  112. O(lgN) line clipping algorithm in E2
  113. An efficient algorithm for line clipping by convex polygon
  114. Algorithms for Clipping Quadratic Arcs
  115. An Intersecting Modification to the Bresenham Algorithm
  116. 3D Shape Recovery and Tracking from Multi-Camera Video Sequences via Surface Deformation
  117. RADIAL BASIS FUNCTION USE FOR THE RESTORATION OF DAMAGED IMAGES
  118. A new line clipping algorithm with hardware acceleration
  119. Adaptive edge spinning algorithm for polygonization of implicit surfaces
  120. Parallel triangular mesh decimation without sorting
  121. The hash function and the principle of duality