All Stories

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