A carving framework for topology simplification of polygonal meshes

Nate Hagbi, Jihad El-Sana

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

The topology of polygonal meshes has a large impact on the performance of various geometric processing algorithms, such as rendering and collision detection algorithms. Several approaches for simplifying topology have been discussed in the literature. These methods operate locally on models, which makes their effect on topology hard to predict and analyze. Most existing methods also tend to exhibit various disturbing artifacts, such as shrinking of the input and splitting of its components. We propose a novel top-down method for topology simplification that avoids the problems common in existing methods. The method starts with a simple, genus-zero mesh that bounds the input and gradually introduces topological features by a series of carving operations. Through this process a multiresolution stream of meshes is created with increasing topologic level of detail. Following the proposed approach, we present a practical carving algorithm that is based on the Constrained Delaunay Tetrahedralization (CDT). The algorithm pretetrahedralizes the complement of the input with respect to its convex hull and then eliminates tetrahedra in a prioritized manner. We present quality results for two families of meshes that are difficult to simplify by all existing methods known to us - topologically complex and highly clustered meshes.

Original languageEnglish
Title of host publicationAdvances in Geometric Modeling and Processing - 5th International Conference, GMP 2008, Proceedings
PublisherSpringer Verlag
Pages47-61
Number of pages15
ISBN (Print)3540792457, 9783540792451
DOIs
StatePublished - 1 Jan 2008
Event5th International Conference on Geometric Modeling and Processing, GMP 2008 - Hangzhou, China
Duration: 23 Apr 200825 Apr 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4975 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th International Conference on Geometric Modeling and Processing, GMP 2008
Country/TerritoryChina
CityHangzhou
Period23/04/0825/04/08

Keywords

  • Level-of-detail generation
  • Model simplification
  • Shape approximation and geometric modeling
  • Topology simplification

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'A carving framework for topology simplification of polygonal meshes'. Together they form a unique fingerprint.

Cite this