메뉴 건너뛰기




Volumn 32, Issue 3, 2013, Pages

Screened poisson surface reconstruction

Author keywords

Adaptiveoctree; Finite elements; Screened Poisson equation; Surface fitting

Indexed keywords

ADAPTIVEOCTREE; FINITE-ELEMENT DISCRETIZATION; GEOMETRY PROCESSING; INTERPOLATION CONSTRAINTS; MATHEMATICAL FRAMEWORKS; SCREENED POISSON EQUATIONS; SPARSITY STRUCTURE; SURFACE FITTING;

EID: 84879498472     PISSN: 07300301     EISSN: 15577368     Source Type: Journal    
DOI: 10.1145/2487228.2487237     Document Type: Article
Times cited : (1941)

References (31)
  • 4
    • 84868219661 scopus 로고    scopus 로고
    • An end-to-end framework for evaluating surface reconstruction
    • SCI Institute, University of Utah
    • BERGER, M., LEVINE, J., NONATO, L., TAUBIN, G., AND SILVA, C. 2011. An end-to-end framework for evaluating surface reconstruction. Tech. rep. UUSCI-2011-001, SCI Institute, University of Utah.
    • (2011) Tech. rep. UUSCI-2011-001
    • Berger, M.1    Levine, J.2    Nonato, L.3    Taubin, G.4    Silva, C.5
  • 6
    • 24944582018 scopus 로고    scopus 로고
    • Provably good sampling and meshing of surfaces
    • BOISSONNAT, J. AND OUDOT, S. 2005. Provably good sampling and meshing of surfaces. Graph. Models 67, 5, 405-451.
    • (2005) Graph. Models , vol.67 , Issue.5 , pp. 405-451
    • Boissonnat, J.1    Oudot, S.2
  • 8
    • 84870507904 scopus 로고    scopus 로고
    • Parallel poisson surface reconstruction
    • 5To see that this is the case, we observe that if {B1 , . . . , BN } is the basis for the dual space, with Bi (Bj ) = dij then the mass matrixM[0,1]3 (respectively M(w,P)) is the matrix expression for the map I[0,1]3 (respectively I(w,P)) with respect to the bases {B1, . . . , BN} and {B1 , . . . , BN }
    • BOLITHO, M., KAZHDAN, M., BURNS, R., AND HOPPE, H. 2009. Parallel Poisson surface reconstruction. In Proceedings of the International Symposium on Visual Computing. 5To see that this is the case, we observe that if {B1 , . . . , BN } is the basis for the dual space, with Bi (Bj ) = dij then the mass matrixM[0,1]3 (respectively M(w,P)) is the matrix expression for the map I[0,1]3 (respectively I(w,P)) with respect to the bases {B1, . . . , BN} and {B1 , . . . , BN }.
    • (2009) Proceedings of the International Symposium on Visual Computing
    • Bolitho, M.1    Kazhdan, M.2    Burns, R.3    Hoppe, H.4
  • 9
    • 84907212887 scopus 로고    scopus 로고
    • Ssd: Smooth signed distance surface reconstruction
    • CALAKLI, F. AND TAUBIN, G. 2011. SSD: Smooth signed distance surface reconstruction. Comput. Graph. Forum 30, 7.
    • (2011) Comput. Graph. Forum , vol.30 , pp. 7
    • Calakli, F.1    Taubin, G.2
  • 12
    • 80051886341 scopus 로고    scopus 로고
    • Interactive and anisotropic geometry processing using the screened poisson equation
    • CHUANG, M. AND KAZHDAN, M. 2011. Interactive and anisotropic geometry processing using the screened Poisson equation. ACMTrans.Graph. 30, 4.
    • (2011) ACMTrans.Graph , vol.30 , pp. 4
    • Chuang, M.1    Kazhdan, M.2
  • 13
    • 0001452452 scopus 로고    scopus 로고
    • Metro: Measuring error on simplified surfaces
    • CIGNONI, P. AND SCOPIGNO, R. 1998. Metro: Measuring error on simplified surfaces. Comput. Graph. Forum 17, 2.
    • (1998) Comput. Graph. Forum , vol.17 , pp. 2
    • Cignoni, P.1    Scopigno, R.2
  • 15
    • 84880114472 scopus 로고    scopus 로고
    • Farman institute 3D point sets-high precision 3D data sets
    • DIGNE, J., AUDFRAY, N., LARTIGUE, C., MEHDI-SOUZANI, C., AND MOREL, J.-M. 2011a. Farman institute 3D point sets-high precision 3D data sets. http://www.ipol.im/pub/art/2011/dalmm ps/
    • (2011)
    • Digne, J.1    Audfray, N.2    Lartigue, C.3    Mehdi-Souzani, C.4    Morel, J.-M.5
  • 19
    • 85035936106 scopus 로고    scopus 로고
    • Robust reconstruction ofwatertight 3d models from non-uniformly sampled point clouds without normal information
    • HORNUNG, A. ANDKOBBELT, L. 2006. Robust reconstruction ofwatertight 3D models from non-uniformly sampled point clouds without normal information. In Proceedings of the Symposium on Geometry Processing. 41-50.
    • (2006) Proceedings of the Symposium on Geometry Processing. , pp. 41-50
    • Hornung, A.1    Andkobbelt, L.2
  • 22
    • 70450212936 scopus 로고    scopus 로고
    • Robust and efficient surface reconstruction from range data
    • LABATUT, P., PONS, J.-P., AND KERIVEN, R. 2009. Robust and efficient surface reconstruction from range data. Comput. Graph. Forum 28, 8, 2275-2290.
    • (2009) Comput. Graph. Forum , vol.28 , Issue.8 , pp. 2275-2290
    • Labatut, P.1    Pons, J.-P.2    Keriven, R.3
  • 26
    • 70049095839 scopus 로고    scopus 로고
    • Smoothing of partition of unity implicit surfaces for noise robust surface reconstruction
    • NAGAI, Y., OHTAKE, Y., AND SUZUKI, H. 2009. Smoothing of partition of unity implicit surfaces for noise robust surface reconstruction. Comput. Graph. Forum 28, 5, 1339-1348.
    • (2009) Comput. Graph. Forum , vol.28 , Issue.5 , pp. 1339-1348
    • Nagai, Y.1    Ohtake, Y.2    Suzuki, H.3
  • 27
    • 33646057740 scopus 로고    scopus 로고
    • Efficiently combining positions and normals for precise 3d geometry
    • NEHAB, D., RUSINKIEWICZ, S., DAVIS, J., AND RAMAMOORTHI, R. 2005. Efficiently combining positions and normals for precise 3D geometry. ACM Trans. Graph. 24, 3, 536-543.
    • (2005) ACM Trans. Graph , vol.24 , Issue.3 , pp. 536-543
    • Nehab, D.1    Rusinkiewicz, S.2    Davis, J.3    Ramamoorthi, R.4
  • 28
    • 85122612318 scopus 로고    scopus 로고
    • Sparse low-degree implicits with applications to high quality rendering, feature extraction, and smoothing
    • OHTAKE, Y., BELYAEV, A., AND ALEXA, M. 2005. Sparse low-degree implicits with applications to high quality rendering, feature extraction, and smoothing. In Proceedings of the Symposium on Geometry Processing. 149-158.
    • (2005) Proceedings of the Symposium on Geometry Processing. , pp. 149-158
    • Ohtake, Y.1    Belyaev, A.2    Alexa, M.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.