Filling Gaps in the Boundary of a Polyhedron (1993)
| Venue: | Computer Aided Geometric Design |
| Citations: | 30 - 4 self |
BibTeX
@ARTICLE{Barequet93fillinggaps,
author = {Gill Barequet and Micha Sharir},
title = {Filling Gaps in the Boundary of a Polyhedron},
journal = {Computer Aided Geometric Design},
year = {1993},
volume = {12},
pages = {207--229}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper we present an algorithm for detecting and repairing defects in the boundary of a polyhedron. These defects, usually caused by problems in CAD software, consist of small gaps bounded by edges that are incident to only one polyhedron face. The algorithm uses a partial curve matching technique for matching parts of the defects, and an optimal triangulation of 3-D polygons for resolving the unmatched parts. It is also shown that finding a consistent set of partial curve matches with maximum score, a subproblem which is related to our repairing process, is NP-Hard. Experimental results on several polyhedra are presented. Keywords: CAD, polyhedra, gap filling, curve matching, geometric hashing, triangulation. 1 Introduction The problem studied in this paper is the detection and repair of "gaps" in the boundary of a polyhedron. This problem usually appears in polyhedral approximations of CAD objects, whose boundaries are described using curved entities of higher leve...
