We present a data structure for answering approximate shortest path queries in a planar subdivision from a fixed source. Let 1 be a real number. Distances in each face of this sub...
Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Ya...
Based on radial basis functions approximation, we develop in this paper a new computational algorithm for numerical diļ¬erentiation. Under an a priori and an a posteriori choice r...
Fat arcs form bounding boxes for planar curves. An example on approximation by fat arcs, provided by Qun and Rokne, is corrected. The third derivative of the given curve segment u...
This paper presents a method for estimating curvature values of a surface, which is given only approximatively, e.g., by measured data. The presented method requires estimates of ...
We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive we...