All Stories

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