A method for lossy compression of genus-0 surfaces is presented. Geometry, texture and other surface attributes are incorporated in a unified manner. The input surfaces are represented by surfels (surface elements), i.e., by a set of disks with attributes. Each surfel, with its attribute vector, is optimally mapped onto a sphere in the sense of geodesic distance preservation. The resulting sphe...

Over the past few years, symmetric positive definite matrices (SPD) have been receiving considerable attention from computer vision community. Though various distance measures have been proposed in the past for comparing SPD matrices, the two most widely-used measures are affine-invariant distance and log-Euclidean distance. This is because these two measures are true geodesic distances induced...

In this paper we exploit redundant information in geodesic distance fields for a quick approximation of all-pair distances. Starting with geodesic distance fields of equally distributed landmarks we analyze the lower and upper bound resulting from the triangle inequality and show that both bounds converge reasonably fast to the original distance field. The lower bound has itself a bounded relat...

An algorithm is presented for computing geodesic furthest neighbors for all the vertices of a simple polygon, where geodesic denotes the fact that distance between two points of the polygon is defined as the length of an Euclidean shortest path connecting them within the polygon. The algorithm runs in O(n log n) time and uses O(n) space; n being the number of vertices of the polygon. As a corol...

The distance between two objects is an important problem in CAGD, CAD and CG etc. It will be presented in this paper that a simple and quick method to estimate the distance between a point and a Bezier curve on a Bezier surface. Keywords—Geodesic-like curve, distance, projection, Bezier.

In this paper we consider positively 1-homogeneous supremal functionals of the type F (u) := supΩ f(x,∇u(x)). We prove that the relaxation F̄ is a difference quotient, that is F̄ (u) = RF (u) := sup x,y∈Ω, x6=y u(x)− u(y) dF (x, y) for every u ∈ W (Ω), where dF is a geodesic distance associated to F . Moreover we prove that the closure of the class of 1-homogeneous supremal functionals with respe...

Let X be a phase in a specimen. Given two arbitrary points x and y of X, let us define the number dx(x, y) as follows: dx(x, y) is the greatest lower bound of the lengths of the arcs in X ending at points x and y, if such arcs exist, and + CIJ if not. The function dX is a distance function, called 'geodesic distance'. Note that if x and y belong to two disjoint connected components of X, dx(x, ...