Nonmanifold subdivision

L. Ying, Denis Zorin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Commonly-used subdivision schemes require manifold control meshes and produce manifold surfaces. However, it is often necessary to model nonmanifold surfaces, such as several surface patches meeting at a common boundary. In this paper, we describe a subdivision algorithm that makes it possible to model nonmanifold surfaces. Any triangle mesh, subject only to the restriction that no two vertices of any triangle coincide, can serve as an input to the algorithm. Resulting surfaces consist of collections of manifold patches joined along nonmanifold curves and vertices. If desired, constraints may be imposed on the tangent planes of manifold patches sharing a curve or a vertex. The algorithm is an extension of a well-known Loop subdivision scheme, and uses techniques developed for piecewise smooth surfaces.

Original languageEnglish (US)
Title of host publicationProceedings of the IEEE Visualization Conference
EditorsT. Ertl, K. Joy, A. Varshney
Pages325-331
Number of pages7
StatePublished - 2001
EventVisualization 2001 - San Diego, CA, United States
Duration: Oct 21 2001Oct 26 2001

Other

OtherVisualization 2001
CountryUnited States
CitySan Diego, CA
Period10/21/0110/26/01

Keywords

  • Geometric modeling
  • Nonmanifold surfaces
  • Subdivision surfaces

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)

Cite this

Ying, L., & Zorin, D. (2001). Nonmanifold subdivision. In T. Ertl, K. Joy, & A. Varshney (Eds.), Proceedings of the IEEE Visualization Conference (pp. 325-331)

Nonmanifold subdivision. / Ying, L.; Zorin, Denis.

Proceedings of the IEEE Visualization Conference. ed. / T. Ertl; K. Joy; A. Varshney. 2001. p. 325-331.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ying, L & Zorin, D 2001, Nonmanifold subdivision. in T Ertl, K Joy & A Varshney (eds), Proceedings of the IEEE Visualization Conference. pp. 325-331, Visualization 2001, San Diego, CA, United States, 10/21/01.
Ying L, Zorin D. Nonmanifold subdivision. In Ertl T, Joy K, Varshney A, editors, Proceedings of the IEEE Visualization Conference. 2001. p. 325-331
Ying, L. ; Zorin, Denis. / Nonmanifold subdivision. Proceedings of the IEEE Visualization Conference. editor / T. Ertl ; K. Joy ; A. Varshney. 2001. pp. 325-331
@inproceedings{12f386adb73e430c833fb8d45772a669,
title = "Nonmanifold subdivision",
abstract = "Commonly-used subdivision schemes require manifold control meshes and produce manifold surfaces. However, it is often necessary to model nonmanifold surfaces, such as several surface patches meeting at a common boundary. In this paper, we describe a subdivision algorithm that makes it possible to model nonmanifold surfaces. Any triangle mesh, subject only to the restriction that no two vertices of any triangle coincide, can serve as an input to the algorithm. Resulting surfaces consist of collections of manifold patches joined along nonmanifold curves and vertices. If desired, constraints may be imposed on the tangent planes of manifold patches sharing a curve or a vertex. The algorithm is an extension of a well-known Loop subdivision scheme, and uses techniques developed for piecewise smooth surfaces.",
keywords = "Geometric modeling, Nonmanifold surfaces, Subdivision surfaces",
author = "L. Ying and Denis Zorin",
year = "2001",
language = "English (US)",
pages = "325--331",
editor = "T. Ertl and K. Joy and A. Varshney",
booktitle = "Proceedings of the IEEE Visualization Conference",

}

TY - GEN

T1 - Nonmanifold subdivision

AU - Ying, L.

AU - Zorin, Denis

PY - 2001

Y1 - 2001

N2 - Commonly-used subdivision schemes require manifold control meshes and produce manifold surfaces. However, it is often necessary to model nonmanifold surfaces, such as several surface patches meeting at a common boundary. In this paper, we describe a subdivision algorithm that makes it possible to model nonmanifold surfaces. Any triangle mesh, subject only to the restriction that no two vertices of any triangle coincide, can serve as an input to the algorithm. Resulting surfaces consist of collections of manifold patches joined along nonmanifold curves and vertices. If desired, constraints may be imposed on the tangent planes of manifold patches sharing a curve or a vertex. The algorithm is an extension of a well-known Loop subdivision scheme, and uses techniques developed for piecewise smooth surfaces.

AB - Commonly-used subdivision schemes require manifold control meshes and produce manifold surfaces. However, it is often necessary to model nonmanifold surfaces, such as several surface patches meeting at a common boundary. In this paper, we describe a subdivision algorithm that makes it possible to model nonmanifold surfaces. Any triangle mesh, subject only to the restriction that no two vertices of any triangle coincide, can serve as an input to the algorithm. Resulting surfaces consist of collections of manifold patches joined along nonmanifold curves and vertices. If desired, constraints may be imposed on the tangent planes of manifold patches sharing a curve or a vertex. The algorithm is an extension of a well-known Loop subdivision scheme, and uses techniques developed for piecewise smooth surfaces.

KW - Geometric modeling

KW - Nonmanifold surfaces

KW - Subdivision surfaces

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

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

M3 - Conference contribution

AN - SCOPUS:0035168108

SP - 325

EP - 331

BT - Proceedings of the IEEE Visualization Conference

A2 - Ertl, T.

A2 - Joy, K.

A2 - Varshney, A.

ER -