We present a method to measure reflectance and texture of surfaces in a one step process. For later use in digital image synthesis it is mandatory to separate the gathered intensi...
The signed distance field for a polygonal model is a useful representation that facilitates efficient computation in many visualization and geometric processing tasks. Often it is...
We present an algorithm for meshing surfaces that is a simple adaptation of a greedy “farthest point” technique proposed by Chew. Given a surface S, it progressively adds poin...
We consider the problem of discovering a smooth unknown surface S bounding an object O in R3 . The discovery process consists of moving a point probing device in the free space ar...
Jean-Daniel Boissonnat, Leonidas J. Guibas, Steve ...
In this article we improve the butterfly and Loop's algorithm. As a result we obtain subdivision algorithms for triangular nets which can be used to generate G1- and G2surfac...