Direct (Re)meshing for efficient surface processing

John Schreiner, Carlos E. Scheidegger, Shachar Fleishman, Cláudio T. Silva

Research output: Contribution to journalArticlepeer-review


We propose a novel surface remeshing algorithm. While many remeshing algorithms are based on global parametrization or local mesh optimization, our algorithm is closely related to surface reconstruction techniques and it requires no explicit parameterization. Our approach is based on the advancing-front paradigm, and it can be used to both incrementally remesh the complete surface, or simply to remesh a portion of it with a high-quality mesh. It is accurate, fast, robust, and suitable for use with interactive mesh processing applications that require local remeshing. We show a number of applications, including matching the resolution of meshes when doing Boolean operations such as unions and intersections. We also show how to adapt the algorithm to blend and merge mixed-mode objects - for example, to compute the union of a point-set surface and a triangle mesh.

Original languageEnglish (US)
Pages (from-to)527-536
Number of pages10
JournalComputer Graphics Forum
Issue number3
StatePublished - Sep 2006

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design


Dive into the research topics of 'Direct (Re)meshing for efficient surface processing'. Together they form a unique fingerprint.

Cite this