The ball-pivoting algorithm for surface reconstruction

Fausto Bernardini, Joshua Mittleman, Holly Rushmeier, Claudio Silva, Gabriel Taubin

Research output: Contribution to journalArticle

Abstract

The Ball-Pivoting Algorithm (BPA) computes a triangle mesh interpolating a given point cloud. Typically, the points are surface samples acquired with multiple range scans of an object, The principle of (he BPA is very simple: Three points form a triangle if a ball of a user-specified radius p touches them without containing any other point. Starting with a seed triangle, the ball pivots around an edge (i.e., it revolves around the edge while keeping in contact with the edge's endpoints) until it touches another point, forming another triangle, The process continues until all reachable edges have been tried, and then starts from another seed triangle, until all points have been considered. The process can then be repeated with a ball of larger radius to handle uneven sampling densities. We applied the BPA to datasets of millions of points representing actual scans of complex 3D objects. The relatively small amount of memory required by the BPA, its time efficiency, and the quality of the results obtained compare favorably with existing techniques.

Original languageEnglish (US)
Pages (from-to)349-359
Number of pages11
JournalIEEE Transactions on Visualization and Computer Graphics
Volume5
Issue number4
DOIs
StatePublished - 1999

Fingerprint

Surface reconstruction
Seed
Sampling
Data storage equipment

Keywords

  • 3d scanning
  • Point cloud
  • Range image
  • Shape reconstruction

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software

Cite this

The ball-pivoting algorithm for surface reconstruction. / Bernardini, Fausto; Mittleman, Joshua; Rushmeier, Holly; Silva, Claudio; Taubin, Gabriel.

In: IEEE Transactions on Visualization and Computer Graphics, Vol. 5, No. 4, 1999, p. 349-359.

Research output: Contribution to journalArticle

Bernardini, Fausto ; Mittleman, Joshua ; Rushmeier, Holly ; Silva, Claudio ; Taubin, Gabriel. / The ball-pivoting algorithm for surface reconstruction. In: IEEE Transactions on Visualization and Computer Graphics. 1999 ; Vol. 5, No. 4. pp. 349-359.
@article{c818d499a5df4dad9ac67030f31512ae,
title = "The ball-pivoting algorithm for surface reconstruction",
abstract = "The Ball-Pivoting Algorithm (BPA) computes a triangle mesh interpolating a given point cloud. Typically, the points are surface samples acquired with multiple range scans of an object, The principle of (he BPA is very simple: Three points form a triangle if a ball of a user-specified radius p touches them without containing any other point. Starting with a seed triangle, the ball pivots around an edge (i.e., it revolves around the edge while keeping in contact with the edge's endpoints) until it touches another point, forming another triangle, The process continues until all reachable edges have been tried, and then starts from another seed triangle, until all points have been considered. The process can then be repeated with a ball of larger radius to handle uneven sampling densities. We applied the BPA to datasets of millions of points representing actual scans of complex 3D objects. The relatively small amount of memory required by the BPA, its time efficiency, and the quality of the results obtained compare favorably with existing techniques.",
keywords = "3d scanning, Point cloud, Range image, Shape reconstruction",
author = "Fausto Bernardini and Joshua Mittleman and Holly Rushmeier and Claudio Silva and Gabriel Taubin",
year = "1999",
doi = "10.1109/2945.817351",
language = "English (US)",
volume = "5",
pages = "349--359",
journal = "IEEE Transactions on Visualization and Computer Graphics",
issn = "1077-2626",
publisher = "IEEE Computer Society",
number = "4",

}

TY - JOUR

T1 - The ball-pivoting algorithm for surface reconstruction

AU - Bernardini, Fausto

AU - Mittleman, Joshua

AU - Rushmeier, Holly

AU - Silva, Claudio

AU - Taubin, Gabriel

PY - 1999

Y1 - 1999

N2 - The Ball-Pivoting Algorithm (BPA) computes a triangle mesh interpolating a given point cloud. Typically, the points are surface samples acquired with multiple range scans of an object, The principle of (he BPA is very simple: Three points form a triangle if a ball of a user-specified radius p touches them without containing any other point. Starting with a seed triangle, the ball pivots around an edge (i.e., it revolves around the edge while keeping in contact with the edge's endpoints) until it touches another point, forming another triangle, The process continues until all reachable edges have been tried, and then starts from another seed triangle, until all points have been considered. The process can then be repeated with a ball of larger radius to handle uneven sampling densities. We applied the BPA to datasets of millions of points representing actual scans of complex 3D objects. The relatively small amount of memory required by the BPA, its time efficiency, and the quality of the results obtained compare favorably with existing techniques.

AB - The Ball-Pivoting Algorithm (BPA) computes a triangle mesh interpolating a given point cloud. Typically, the points are surface samples acquired with multiple range scans of an object, The principle of (he BPA is very simple: Three points form a triangle if a ball of a user-specified radius p touches them without containing any other point. Starting with a seed triangle, the ball pivots around an edge (i.e., it revolves around the edge while keeping in contact with the edge's endpoints) until it touches another point, forming another triangle, The process continues until all reachable edges have been tried, and then starts from another seed triangle, until all points have been considered. The process can then be repeated with a ball of larger radius to handle uneven sampling densities. We applied the BPA to datasets of millions of points representing actual scans of complex 3D objects. The relatively small amount of memory required by the BPA, its time efficiency, and the quality of the results obtained compare favorably with existing techniques.

KW - 3d scanning

KW - Point cloud

KW - Range image

KW - Shape reconstruction

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

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

U2 - 10.1109/2945.817351

DO - 10.1109/2945.817351

M3 - Article

VL - 5

SP - 349

EP - 359

JO - IEEE Transactions on Visualization and Computer Graphics

JF - IEEE Transactions on Visualization and Computer Graphics

SN - 1077-2626

IS - 4

ER -