메뉴 건너뛰기




Volumn 28, Issue 5, 2009, Pages 1327-1337

Reconstruction of multi-label domains from partial planar cross-sections

Author keywords

[No Author keywords available]

Indexed keywords


EID: 77958049487     PISSN: 17278384     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (5)

References (36)
  • 1
    • 84948972138 scopus 로고    scopus 로고
    • Straight skeletons for general polygonal figures in the plane
    • Hong Kong, Lecture Notes in Computer Science, 1090 Springer-Verlag
    • O. AICHHOLZER, AND F. AURENHAMMER, Straight skeletons for general polygonal figures in the plane, Proc. 2nd Ann. Int. Computing and Combinatorics Conf., Hong Kong, Lecture Notes in Computer Science, 1090, Springer-Verlag, 117-126, 1996.
    • (1996) Proc. 2nd Ann Computing and Combinatorics Conf. , pp. 117-126
    • Aichholzer, O.1    Aurenhammer, F.2
  • 2
    • 0030283854 scopus 로고    scopus 로고
    • Arbitrary topology shape reconstruction from planar cross sections
    • C.L. BAJAJ, E.J. COYLE, AND K.N. LIN, Arbitrary topology shape reconstruction from planar cross sections, Graphical Models and Image Processing, 58 (1996), 524-543.
    • (1996) Graphical Models and Image Processing , vol.58 , pp. 524-543
    • Bajaj, C.L.1    Coyle, E.J.2    Lin, K.N.3
  • 3
    • 57749188194 scopus 로고    scopus 로고
    • Straight skeletons of three-dimensional poly-hedra
    • Karlsruhe, Germany, Lecture Notes in Computer Science, Springer-Verlag
    • G. BAREQUET, D. EPPSTEIN, M.T. GOODRICH, AND A. VAXMAN, Straight skeletons of three-dimensional poly-hedra, Proc. 16th Ann. European Symp. on Algorithms, Karlsruhe, Germany, Lecture Notes in Computer Science, 5193, Springer-Verlag, 148-160, 2008.
    • (2008) Proc. 16th Ann. European Symp. on Algorithms , vol.5193 , pp. 148-160
    • Barequet, G.1    Eppstein, D.2    Goodrich, M.T.3    Vaxman, A.4
  • 8
    • 42949144367 scopus 로고    scopus 로고
    • Shape Reconstruction from unorganized cross-sections
    • Barcelona, Spain
    • J.-D. BOISSONNAT AND P. MEMARI, Shape Reconstruction from unorganized cross-sections, Proc. Symp. on Geometry Processing, Barcelona, Spain, 89-98, 2007.
    • (2007) Proc. Symp. on Geometry Processing , pp. 89-98
    • Boissonnat, J.-D.1    Memari, P.2
  • 13
    • 0000673235 scopus 로고
    • A heuristic triangulation algorithm for multiple planar contours using an extended double branching procedure
    • Y.K. CHOI AND K.H. PARK, A heuristic triangulation algorithm for multiple planar contours using an extended double branching procedure, The Visual Computer, 10 (1994), 372-387.
    • (1994) The Visual Computer , vol.10 , pp. 372-387
    • Choi, Y.K.1    Park, K.H.2
  • 14
    • 0018106568 scopus 로고
    • Conversion of complex contour line definitions into polygonal element mosaics
    • H.N. CHRISTIANSEN AND T.W. SEDERBERG, Conversion of complex contour line definitions into polygonal element mosaics, Computer Graphics, 13 (1978), 187-192.
    • (1978) Computer Graphics , vol.13 , pp. 187-192
    • Christiansen, H.N.1    Sederberg, T.W.2
  • 16
    • 0026134923 scopus 로고
    • A tri-angulation algorithm from arbitrary shaped multiple planar contours
    • A.B. EKOULE, F.C. PEYRIN, AND C.L. ODET, A tri-angulation algorithm from arbitrary shaped multiple planar contours, ACM Transactions on Graphics, 10 (1991), 182-199.
    • (1991) ACM Transactions on Graphics , vol.10 , pp. 182-199
    • Ekoule, A.B.1    Peyrin, F.C.2    Odet, C.L.3
  • 17
    • 0037845524 scopus 로고    scopus 로고
    • Improvement of Oliva's algorithm for surface reconstruction from contours
    • (J. Zara, ed.), Budmerice, Slovakia
    • P. FELKEL AND Š;. OBDRŽÁLEK, Improvement of Oliva's algorithm for surface reconstruction from contours, Spring Conf. on Computer Graphics (J. Zara, ed.), Budmerice, Slovakia, 254-263, 1999.
    • (1999) Spring Conf. on Computer Graphics , pp. 254-263
    • Felkel, P.1    Obdržálek, Š.2
  • 18
    • 0031632431 scopus 로고    scopus 로고
    • Multiresolution banded refinement to accelerate surface reconstruction from polygons
    • Minneapolis, MN
    • J.D. FIX AND R.E. LADNER, Multiresolution banded refinement to accelerate surface reconstruction from polygons, Proc. 14th Ann. ACM Symp. on Computational Geometry, Minneapolis, MN, 240-248, 1998.
    • (1998) Proc. 14th Ann. ACM Symp. on Computational Geometry , pp. 240-248
    • Fix, J.D.1    Ladner, R.E.2
  • 19
    • 0017547615 scopus 로고
    • Optimal surface reconstruction from planar contours
    • H. FUCHS, Z.M. KEDEM, AND S.P. USELTON, Optimal surface reconstruction from planar contours, Comm. of the ACM, 20 (1977), 693-702.
    • (1977) Comm. of the ACM , vol.20 , pp. 693-702
    • Fuchs, H.1    Kedem, Z.M.2    Uselton, S.P.3
  • 20
    • 0020152635 scopus 로고
    • A new general tri-angulation method for planar contours
    • S. GANAPATHY AND T.G. DENNEHY, A new general tri-angulation method for planar contours, ACM Trans. on Computer Graphics, 16 (1982), 69-75.
    • (1982) ACM Trans on Computer Graphics , vol.16 , pp. 69-75
    • Ganapathy, S.1    Dennehy, T.G.2
  • 25
    • 3342932244 scopus 로고
    • Approximating complex surfaces by triangulation of contour lines
    • E. KEPPEL, Approximating complex surfaces by triangulation of contour lines, IBM J. of Research and Development, 19 (1975), 2-11.
    • (1975) IBM J of Research and Development , vol.19 , pp. 2-11
    • Keppel, E.1
  • 26
    • 84900017845 scopus 로고    scopus 로고
    • Interactive Multi-Resolution Modeling on Arbitrary Meshes
    • Orlando, FA, 105-114, USA, July
    • L. KOBBELT, S. CAMPAGNA, J. VORSATZ, H. P. SEIDEL, Interactive Multi-Resolution Modeling on Arbitrary Meshes, SIGGRAPH Orlando, FA, 105-114, USA, July 1998,
    • (1998) SIGGRAPH
    • Kobbelt, L.1    Campagna, S.2    Vorsatz, J.3    Seidel, H.P.4
  • 27
    • 12844259850 scopus 로고    scopus 로고
    • Filling Holes in Meshes, Proc
    • Aachen, Germany, July 2003
    • P. LIEPA, Filling Holes in Meshes, Proc. Symp. on Geometry Processing 2003, Aachen, Germany, 200-205, July 2003
    • (2003) Symp. on Geometry Processing , pp. 200-205
    • Liepa, P.1
  • 28
    • 42949113490 scopus 로고    scopus 로고
    • Surface reconstruction from non-parallel curve networks
    • L. LIU, C. BAJAJ, J. DEASY, D.A. LOW, AND T. JU, Surface reconstruction from non-parallel curve networks, Computer Graphics Forum, 27 (2008), 155-163.
    • (2008) Computer Graphics Forum , vol.27 , pp. 155-163
    • Liu, L.1    Bajaj, C.2    Deasy, J.3    Low, D.A.4    Ju, T.5
  • 29
    • 0026890184 scopus 로고
    • Surfaces from contours: The correspondence and branching problems
    • D. MEYERS, S. SKINNER, AND K. SLOAN, Surfaces from contours: The correspondence and branching problems, ACM Trans. on Graphics, 11 (1992), 228-258
    • (1992) ACM Trans on Graphics , vol.11 , pp. 228-258
    • Meyers, D.1    Skinner, S.2    Sloan, K.3
  • 30
    • 0030244740 scopus 로고    scopus 로고
    • 3D reconstruction of complex polyhedral shapes from contours using a simplified generalized Voronoi diagram
    • J.-M. OLIVA, M. PERRIN, AND S. COQUILLART, 3D reconstruction of complex polyhedral shapes from contours using a simplified generalized Voronoi diagram, Computer Graphics Forum, 15 (1996), C397-408.
    • (1996) Computer Graphics Forum , vol.15
    • Oliva, J.-M.1    Perrin, M.2    Coquillart, S.3
  • 32
    • 0019584728 scopus 로고
    • Surface definition for branching contour-defined objects
    • M. SHANTZ, Surface definition for branching contour-defined objects, Computer Graphics, 15 (1981), 242-270.
    • (1981) Computer Graphics , vol.15 , pp. 242-270
    • Shantz, M.1
  • 34
    • 0022562669 scopus 로고
    • Surface reconstruction and representation of 3-D scenes
    • Y.F. WANG AND J.K. AGGARWAL, Surface reconstruction and representation of 3-D scenes, Pattern Recognition, 19 (1986), 197-207.
    • (1986) Pattern Recognition , vol.19 , pp. 197-207
    • Wang, Y.F.1    Aggarwal, J.K.2
  • 35
    • 0038521932 scopus 로고
    • Surface reconstruction between simple polygons via angle criteria
    • E. WELZL AND B. WOLFERS, Surface reconstruction between simple polygons via angle criteria, J. of Symbolic Computation, 17 (1994), 351-369.
    • (1994) J. of Symbolic Computation , vol.17 , pp. 351-369
    • Welzl, E.1    Wolfers, B.2


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