Direct (Re)meshing for efficient surface processing

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

Research output: Contribution to journalArticle

Abstract

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
Volume25
Issue number3
DOIs
StatePublished - Sep 2006

Fingerprint

Processing
Surface reconstruction
Parameterization

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software
  • Computer Networks and Communications

Cite this

Direct (Re)meshing for efficient surface processing. / Schreiner, John; Scheidegger, Carlos E.; Fleishman, Shachar; Silva, Cláudio T.

In: Computer Graphics Forum, Vol. 25, No. 3, 09.2006, p. 527-536.

Research output: Contribution to journalArticle

Schreiner, John ; Scheidegger, Carlos E. ; Fleishman, Shachar ; Silva, Cláudio T. / Direct (Re)meshing for efficient surface processing. In: Computer Graphics Forum. 2006 ; Vol. 25, No. 3. pp. 527-536.
@article{cca5d96c9edd4b35b1e47901fe1e3ad2,
title = "Direct (Re)meshing for efficient surface processing",
abstract = "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.",
author = "John Schreiner and Scheidegger, {Carlos E.} and Shachar Fleishman and Silva, {Cl{\'a}udio T.}",
year = "2006",
month = "9",
doi = "10.1111/j.1467-8659.2006.00972.x",
language = "English (US)",
volume = "25",
pages = "527--536",
journal = "Computer Graphics Forum",
issn = "0167-7055",
publisher = "Wiley-Blackwell",
number = "3",

}

TY - JOUR

T1 - Direct (Re)meshing for efficient surface processing

AU - Schreiner, John

AU - Scheidegger, Carlos E.

AU - Fleishman, Shachar

AU - Silva, Cláudio T.

PY - 2006/9

Y1 - 2006/9

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33845419016&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33845419016&partnerID=8YFLogxK

U2 - 10.1111/j.1467-8659.2006.00972.x

DO - 10.1111/j.1467-8659.2006.00972.x

M3 - Article

VL - 25

SP - 527

EP - 536

JO - Computer Graphics Forum

JF - Computer Graphics Forum

SN - 0167-7055

IS - 3

ER -