메뉴 건너뛰기




Volumn 16, Issue 1-2, 2010, Pages 151-171

Filling holes in triangular meshes using digital images by curve unfolding

Author keywords

Hole Filling; Multi view Stereo; Space Curve Unfolding

Indexed keywords

A-PLANE; CONSTRAINED DELAUNAY TRIANGULATION; CURVED BOUNDARY; DIGITAL IMAGE; ENERGY FUNCTIONS; ENERGY MINIMIZATION; FILL HOLES; FILLING HOLES; HOLE BOUNDARY; HOLE FILLING; MINIMUM ENERGY; MISSING DATA; MULTI-VIEW STEREO; MULTI-VIEWS; RUNNING TIME; SPACE CURVE UNFOLDING; TRIANGULAR MESHES;

EID: 79955595522     PISSN: 02186543     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218654310001328     Document Type: Article
Times cited : (3)

References (44)
  • 2
    • 33845453340 scopus 로고    scopus 로고
    • ReMESH: An interactive environment to edit and repair triangle meshes
    • DOI 10.1109/SMI.2006.29, 1631218, Proceedings - Thirteenth International Symposium on Temporal Representation and Reasoning, TIME 2006
    • Marco Attene and Bianca Falcidieno. Remesh: An interactive environment to edit and repair triangle meshes. In SMI '06: Proceedings of the IEEE International Conference on Shape Modeling and Applications 2006, page 41, 2006. (Pubitemid 44889066)
    • (2006) Proceedings - IEEE International Conference on Shape Modeling and Applications 2006, SMI 2006 , vol.2006 , pp. 41
    • Attene, M.1    Falcidieno, B.2
  • 4
    • 0029274970 scopus 로고
    • Filling gaps in the boundary of a polyhedron
    • Gill Barequet and Micha Sharir. Filling gaps in the boundary of a polyhedron. Computer Aided Geometric Design, 12(2):207-229, 1995.
    • (1995) Computer Aided Geometric Design , vol.12 , Issue.2 , pp. 207-229
    • Barequet, G.1    Sharir, M.2
  • 9
    • 0004174607 scopus 로고
    • Guaranteed-quality triangular meshes
    • Computer Science Department, Cornell University
    • L. Paul Chew. Guaranteed-quality triangular meshes. Technical Report TR 89-983, Computer Science Department, Cornell University, 1989.
    • (1989) Technical Report TR 89-983
    • Chew, L.P.1
  • 13
    • 35048882624 scopus 로고    scopus 로고
    • Shape reconstruction from 3D and 2D data using PDE-based deformable surfaces
    • Ye Duan, Liu Yang, Hong Qin, and Dimitris Samaras. Shape reconstruction from 3D and 2D data using PDE-based deformable surfaces. In ECCV (3), pages 238-251, 2004.
    • (2004) ECCV , Issue.3 , pp. 238-251
    • Duan, Y.1    Yang, L.2    Qin, H.3    Samaras, D.4
  • 16
    • 0032028276 scopus 로고    scopus 로고
    • Variational principles, surface evolution, PDE's, level set methods, and the stereo problem
    • PII S1057714998017485
    • Olivier Faugeras and Renaud Keriven. Variational principles, surface evolution, PDE's, level set methods and the stereo problem. IEEE Transactions on Image Processing, 7(3):336-344, 1998. (Pubitemid 128745351)
    • (1998) IEEE Transactions on Image Processing , vol.7 , Issue.3 , pp. 336-344
    • Faugeras, O.1    Keriven, R.2
  • 18
    • 0038310144 scopus 로고    scopus 로고
    • The size of spanning disks for polygonal curves
    • DOI 10.1007/s00454-002-2707-6
    • Joel Hass, Jack Snoeyink, and William P. Thurston. The size of spanning disks for polygonal curves. Discrete and Computational Geometry, 29(1):1-17, 2003. (Pubitemid 36820367)
    • (2003) Discrete and Computational Geometry , vol.29 , Issue.1 , pp. 1-17
    • Hass, J.1    Snoeyink, J.2    Thurston, W.P.3
  • 20
    • 4644236313 scopus 로고    scopus 로고
    • Anisotropic filtering of non-linear surface features
    • Klaus Hildebrandt and Konrad Polthier. Anisotropic filtering of non-linear surface features. Computer Graphics Forum, 23:391-400, 2004.
    • (2004) Computer Graphics Forum , vol.23 , pp. 391-400
    • Hildebrandt, K.1    Polthier, K.2
  • 21
    • 12844288852 scopus 로고    scopus 로고
    • Robust repair of polygonal models
    • New York, NY, USA. ACM
    • Tao Ju. Robust repair of polygonal models. In ACM Transactions on Graphics (SIGGRAPH'04), pages 888-895, New York, NY, USA, 2004. ACM.
    • (2004) ACM Transactions on Graphics (SIGGRAPH'04) , pp. 888-895
    • Ju, T.1
  • 22
    • 4544354319 scopus 로고    scopus 로고
    • A piecewise hole filling algorithm in reverse engineering
    • Yongtae Jun. A piecewise hole filling algorithm in reverse engineering. Computer-aided Design, 37(2):263-270, 2005.
    • (2005) Computer-aided Design , vol.37 , Issue.2 , pp. 263-270
    • Jun, Y.1
  • 23
    • 26444479778 scopus 로고
    • Optimization by simulated annealing
    • Scott Kirpatrick, Dan Gelatt, and Mario Vecchi. Optimization by simulated annealing. Science, 220(4598):671-680, 1983.
    • (1983) Science , vol.220 , Issue.4598 , pp. 671-680
    • Kirpatrick, S.1    Gelatt, D.2    Vecchi, M.3
  • 27
    • 42649127407 scopus 로고    scopus 로고
    • An algorithm for filling complex holes in reverse engineering
    • DOI 10.1007/s00366-007-0075-9
    • Gen Li, Xiu-Zi Ye, and San-Yuan Zhang. An algorithm for filling complex holes in reverse engineering. Engineering with Computers, 24(2):119-125, 2008. (Pubitemid 351597360)
    • (2008) Engineering with Computers , vol.24 , Issue.2 , pp. 119-125
    • Li, G.1    Ye, X.-Z.2    Zhang, S.-Y.3
  • 29
    • 33646887390 scopus 로고
    • On the limited memory BFGS method for large scale optimization
    • Dong C. Liu and Jorge Nocedal. On the limited memory method for large scale optimization. Mathematical Programming, 45:503-528, 1989. (Pubitemid 20660315)
    • (1989) Mathematical Programming, Series B , vol.45 , Issue.3 , pp. 503-528
    • Liu Dong, C.1    Nocedal Jorge2
  • 31
    • 35148858703 scopus 로고    scopus 로고
    • Repairing triangle meshes built from scanned point cloud
    • Jean-Philippe Pernot, George-Florin Moraru, and Philippe V́eron. Repairing triangle meshes built from scanned point cloud. Journal of Engineering Design, 18(5):459-473, 2007.
    • (2007) Journal of Engineering Design , vol.18 , Issue.5 , pp. 459-473
    • Pernot, J.-P.1    Moraru, G.2    V́eron, P.3
  • 33
    • 79955632527 scopus 로고    scopus 로고
    • Modelling Non-Rigid Dynamic Scenes from Multi-view Image Sequences
    • N. Paragios, Y. Chen and O. Faugeras, Eds
    • Jean-Philippe Pons, Renaud Keriven, and Olivier Faugeras. Modelling Non-Rigid Dynamic Scenes from Multi-view Image Sequences, in Handbook of Mathematical Models in Computer Vision, N. Paragios, Y. Chen and O. Faugeras, Eds, 2006.
    • (2006) Handbook of Mathematical Models in Computer Vision
    • Pons, J.-P.1    Keriven, R.2    Faugeras, O.3
  • 37
    • 0002804341 scopus 로고    scopus 로고
    • Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator
    • Jonathan R. Shewchuk. Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator. In First Workshop on Applied Computational Geometry, pages 124-133, 1996.
    • (1996) First Workshop on Applied Computational Geometry , pp. 124-133
    • Shewchuk, J.R.1
  • 40
    • 33645248161 scopus 로고    scopus 로고
    • Hole-filling algorithm for triangular meshes
    • School of Computing, University of Utah
    • Lavanya Sita Tekumalla and Elaine Cohen. Hole-filling algorithm for triangular meshes. Technical Report UUCS-04-019, School of Computing, University of Utah, 2004.
    • (2004) Technical Report UUCS-04-019
    • Tekumalla, L.S.1    Cohen, E.2
  • 41
    • 84977776020 scopus 로고
    • Zippered polygon meshes from range images
    • Greg Turk and Marc Levoy. Zippered polygon meshes from range images. In Proceedings of SIGGRAPH'94, pages 311-318, 1994.
    • (1994) Proceedings of SIGGRAPH'94 , pp. 311-318
    • Turk, G.1    Levoy, M.2
  • 43
    • 36549072547 scopus 로고    scopus 로고
    • A robust hole-filling algorithm for triangular mesh
    • DOI 10.1007/s00371-007-0167-y
    • Wei Zhao, Shuming Gao, and Hongwei Lin. A robust hole-filling algorithm for triangular mesh. The Visual Computer, 23(12):987-997, 2007. (Pubitemid 350178421)
    • (2007) Visual Computer , vol.23 , Issue.12 , pp. 987-997
    • Zhao, W.1    Gao, S.2    Lin, H.3
  • 44
    • 0031345518 scopus 로고    scopus 로고
    • Algorithm 778: L-BFGS-B: Fortran Subroutines for Large-Scale Bound-Constrained Optimization
    • Ciyou Zhu, Richard H. Byrd, Peihuaung Lu, and Jorge Nocedal. Algorithm 778: L-bFGS-b, Fortran subroutines for large-Scale bound constrained optimization. ACM Trans. Mathematical Software, 23(4):550-560, 1997. (Pubitemid 127447768)
    • (1997) ACM Transactions on Mathematical Software , vol.23 , Issue.4 , pp. 550-560
    • Zhu, C.1    Byrd, R.H.2    Lu, P.3    Nocedal, J.4


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