Globfit: Consistently fitting primitives by discovering global relations

Yangyan Li, Xiaokun Wu, Yiorgos Chrysathou, Andrei Sharf Sharf, Daniel Cohen-Or, Niloy J. Mitra

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

214 Scopus citations


Given a noisy and incomplete point set, we introduce a method that simultaneously recovers a set of locally fitted primitives along with their global mutual relations. We operate under the assumption that the data corresponds to a man-made engineering object consisting of basic primitives, possibly repeated and globally aligned under common relations. We introduce an algorithm to directly couple the local and global aspects of the problem. The local fit of the model is determined by how well the inferred model agrees to the observed data, while the global relations are iteratively learned and enforced through a constrained optimization. Starting with a set of initial RANSAC based locally fitted primitives, relations across the primitives such as orientation, placement, and equality are progressively learned and conformed to. In each stage, a set of feasible relations are extracted among the candidate relations, and then aligned to, while best fitting to the input data. The global coupling corrects the primitives obtained in the local RANSAC stage, and brings them to precise global alignment. We test the robustness of our algorithm on a range of synthesized and scanned data, with varying amounts of noise, outliers, and non-uniform sampling, and validate the results against ground truth, where available. © 2011 ACM.
Original languageEnglish (US)
Title of host publicationACM SIGGRAPH 2011 papers on - SIGGRAPH '11
PublisherAssociation for Computing Machinery (ACM)
ISBN (Print)9781450309431
StatePublished - Jul 26 2011

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design


Dive into the research topics of 'Globfit: Consistently fitting primitives by discovering global relations'. Together they form a unique fingerprint.

Cite this