• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

C (2004) Multi-scale reconstruction of implicit surfaces with attributes from large unorganized point sets (0)

by I Tobor, P Reuter, Schlick
Venue:In: Proceedings of SMI
Add To MetaCart

Tools

Sorted by:
Results 1 - 3 of 3

Implicit Surface Reconstruction from Scattered Point Data with Noise

by Jun Yang, Zhengning Wang, Changqian Zhu, Qiang Peng
"... Abstract. This paper addresses the problem of reconstructing implicit function from point clouds with noise and outliers acquired with 3D scanners. We introduce a filtering operator based on mean shift scheme, which shift each point to local maximum of kernel density function, resulting in suppressi ..."
Abstract - Add to MetaCart
Abstract. This paper addresses the problem of reconstructing implicit function from point clouds with noise and outliers acquired with 3D scanners. We introduce a filtering operator based on mean shift scheme, which shift each point to local maximum of kernel density function, resulting in suppression of noise with different amplitudes and removal of outliers. The “clean ” data points are then divided into subdomains using an adaptive octree subdivision method, and a local radial basis function is constructed at each octree leaf cell. Finally, we blend these local shape functions together with partition of unity to approximate the entire global domain. Numerical experiments demonstrate robust and high quality performance of the proposed method in processing a great variety of 3D reconstruction from point clouds containing noise and outliers.

Building Binary Orientation Trees from Unorganized Point Clouds through Visibility Checks 陳 奕 麟

by unknown authors
"... Given a complete unoriented point set, we propose a binary orientation tree (BOT) for volume and surface representation, which roughly splits the space into the interior and exterior regions with respect to the input point set. The BOTs are constructed by performing a traditional octree subdivision ..."
Abstract - Add to MetaCart
Given a complete unoriented point set, we propose a binary orientation tree (BOT) for volume and surface representation, which roughly splits the space into the interior and exterior regions with respect to the input point set. The BOTs are constructed by performing a traditional octree subdivision technique while the corners of each cell are associated with a tag indicating the in/out relationship with respect to the input point set. Starting from the root cell, a growing stage is performed to efficiently assign tags to the connected empty sub-cells. The unresolved tags of the remaining cell corners are determined by examining their visibility via the hidden point removal operator. We show that the outliers accompanying the input point set can be effectively detected during the construction of the BOTs. After removing the outliers and resolving the in/out tags, the BOTs are ready to support any volume or surface representation techniques. To represent the surfaces, we also present a modified MPU implicits algorithm enabled to reconstruct surfaces from the input unoriented point clouds by taking advantage of the BOTs. 1.

Engineering with Computers DOI 10.1007/s00366-010-0199-1 ORIGINAL ARTICLE

by Rongjiang Pan, Vaclav Skala, R. Pan, V. Skala , 2009
"... A two-level approach to implicit surface modeling with compactly supported radial basis functions ..."
Abstract - Add to MetaCart
A two-level approach to implicit surface modeling with compactly supported radial basis functions
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University