Completion and Reconstruction with Primitive Shapes

In: Computer Graphics Forum (Proc. of Eurographics) (März 2009), 28:2(503-512)
 

Abstract

We consider the problem of reconstruction from incomplete point-clouds. To find a closed mesh the reconstruction is guided by a set of primitive shapes which has been detected on the input point-cloud (e.g. planes, cylinders etc.). With this guidance we not only continue the surrounding structure into the holes but also synthesize plausible edges and corners from the primitives' intersections. To this end we give a surface energy functional that incorporates the primitive shapes in a guiding vector field. The discretized functional can be minimized with an efficient graph-cut algorithm. A novel greedy optimization strategy is proposed to minimize the functional under the constraint that surface parts corresponding to a given primitive must be connected. From the primitive shapes our method can also reconstruct an idealized model that is suitable for use in a CAD system.

The definitive version is available at diglib.eg.org and www.blackwell-synergy.com.

Bilder

Paper herunterladen

Paper herunterladen

Zusätzliches Material

Bibtex

@ARTICLE{schnabel-2009-completion,
    author = {Schnabel, Ruwen and Degener, Patrick and Klein, Reinhard},
     pages = {503--512},
     title = {Completion and Reconstruction with Primitive Shapes},
   journal = {Computer Graphics Forum (Proc. of Eurographics)},
    volume = {28},
    number = {2},
      year = {2009},
     month = mar,
  abstract = {We consider the problem of reconstruction from incomplete point-clouds. To find a closed mesh the
              reconstruction is guided by a set of primitive shapes which has been detected on the input
              point-cloud (e.g. planes, cylinders etc.). With this guidance we not only continue the surrounding
              structure into the holes but also synthesize plausible edges and corners from the primitives'
              intersections. To this end we give a surface energy functional that incorporates the primitive
              shapes in a guiding vector field. The discretized functional can be minimized with an efficient
              graph-cut algorithm. A novel greedy optimization strategy is proposed to minimize the functional
              under the constraint that surface parts corresponding to a given primitive must be connected. From
              the primitive shapes our method can also reconstruct an idealized model that is suitable for use in
              a CAD system.
              
              The definitive version is available at diglib.eg.org and www.blackwell-synergy.com.}
}