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...
The problem to reconstruct a surface given a finite set of boundary points is of growing interest, e.g. in the context of laser range images. While a lot of heuristic methods hav...
We propose a general method that parameterizes general surfaces with complex (possible branching) topology using Riemann surface structure. Rather than evolve the surface geometry...
Yalin Wang, Xianfeng Gu, Kiralee M. Hayashi, Tony ...
A method to compute a linear medial representation of a complex surface in the 3D discrete space is presented. The method involves voxel classification, surface labeling, anchor p...
Carlo Arcelli, Gabriella Sanniti di Baja, Luca Ser...