Filling gaps in the boundary of a polyhedron

DOI10.1016/0167-8396(94)00011-GzbMath0875.68921MaRDI QIDQ673983

Gill Barequet, Micha Sharir

Publication date: 28 February 1997

Published in: Computer Aided Geometric Design (Search for Journal in Brave)

zbMATH Keywords

CADTriangulationCurve matchingGap fillingGeometric hashingPolyhedra

Mathematics Subject Classification ID

Computer science aspects of computer-aided design (68U07)

Related Items (11)

A novel hole patching algorithm for discrete geometry using non-uniform rational B-spline ⋮ REPAIRING NON-MANIFOLD TRIANGLE MESHES USING SIMULATED ANNEALING ⋮ Analysis of STL files ⋮ On triangulating three-dimensional polygons ⋮ CAD and mesh repair with radial basis functions ⋮ 3D Euler spirals for 3D curve completion ⋮ Robust intersection of structured hexahedral meshes and degenerate triangle meshes with volume fraction applications ⋮ A comparison of hole-filling methods in 3D ⋮ Robust and efficient CAD topology generation using adaptive tolerances ⋮ Fast grid-free surface tracking ⋮ Recovery of sharp features in mesh models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite element mesh generation methods: A review and classification
• Triangulation of trimmed surfaces in parametric space
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• Minimal Triangulations of Polygonal Domains
• A Functional Approach to Data Structures and Its Use in Multidimensional Searching
• Piecewise-Linear Interpolation between Polygonal Slices
• An improved equivalence algorithm

This page was built for publication: Filling gaps in the boundary of a polyhedron