메뉴 건너뛰기




Volumn 27, Issue 4, 2010, Pages 295-300

A spectral characterization of the Delaunay triangulation

Author keywords

Delaunay triangulation; Dirichlet energy; Laplacian; Spectrum

Indexed keywords

DELAUNAY TRIANGULATION; DIRICHLET ENERGY; EDGE FLIPS; LAPLACIAN SPECTRA; LAPLACIANS; PIECEWISE-LINEAR; PLANAR POINT SETS; SCALAR FUNCTION; SIMPLE ALGORITHM; SPECTRAL CHARACTERIZATION;

EID: 77949916297     PISSN: 01678396     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cagd.2010.02.002     Document Type: Article
Times cited : (19)

References (17)
  • 1
    • 84976826673 scopus 로고
    • Voronoi diagrams - a survey of a fundamental geometric data structure
    • Aurenhammer F. Voronoi diagrams - a survey of a fundamental geometric data structure. ACM Comput. Surv. 23 3 (1991) 345-405
    • (1991) ACM Comput. Surv. , vol.23 , Issue.3 , pp. 345-405
    • Aurenhammer, F.1
  • 3
    • 36549070221 scopus 로고    scopus 로고
    • A discrete Laplace-Beltrami operator for simplicial surfaces
    • Bobenko A.I., and Springborn B.A. A discrete Laplace-Beltrami operator for simplicial surfaces. Discrete Comput. Geom. 38 4 (2007) 740-756
    • (2007) Discrete Comput. Geom. , vol.38 , Issue.4 , pp. 740-756
    • Bobenko, A.I.1    Springborn, B.A.2
  • 6
    • 0000827674 scopus 로고
    • A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory
    • Fiedler M. A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czechoslovak Math. J. 25 (1975) 619-633
    • (1975) Czechoslovak Math. J. , vol.25 , pp. 619-633
    • Fiedler, M.1
  • 7
    • 37249009184 scopus 로고    scopus 로고
    • A monotonicity property for weighted Delaunay triangulations
    • Glickenstein D. A monotonicity property for weighted Delaunay triangulations. Discrete Comput. Geom. 38 4 (2007) 651-664
    • (2007) Discrete Comput. Geom. , vol.38 , Issue.4 , pp. 651-664
    • Glickenstein, D.1
  • 8
    • 0014869120 scopus 로고
    • An r-dimensional quadratic placement algorithm
    • Hall K.M. An r-dimensional quadratic placement algorithm. Management Sci. 17 (1970) 219-229
    • (1970) Management Sci. , vol.17 , pp. 219-229
    • Hall, K.M.1
  • 9
    • 21144484097 scopus 로고
    • Resistance distance
    • Klein D., and Randic M. Resistance distance. J. Math. Chem. 12 (1993) 81-85
    • (1993) J. Math. Chem. , vol.12 , pp. 81-85
    • Klein, D.1    Randic, M.2
  • 11
    • 0000172086 scopus 로고
    • Transforming triangulations
    • Lawson C.L. Transforming triangulations. Discrete Math. 3 (1972) 365-372
    • (1972) Discrete Math. , vol.3 , pp. 365-372
    • Lawson, C.L.1
  • 12
    • 0030685580 scopus 로고    scopus 로고
    • Properties of the Delaunay triangulation
    • SoCG, pp
    • Musin, O., 1997. Properties of the Delaunay triangulation. In: Proc. 13th Symp. on Comp. Geom. (SoCG), pp. 424-426
    • (1997) Proc. 13th Symp. on Comp. Geom , pp. 424-426
    • Musin, O.1
  • 14
    • 84950826016 scopus 로고
    • Computing discrete minimal surfaces and their conjugates
    • Pinkall U., and Polthier K. Computing discrete minimal surfaces and their conjugates. Experim. Math. 2 (1993) 15-36
    • (1993) Experim. Math. , vol.2 , pp. 15-36
    • Pinkall, U.1    Polthier, K.2
  • 15
    • 38249010766 scopus 로고
    • Minimal roughness property of the Delaunay triangulation: a shorter approach
    • Powar P. Minimal roughness property of the Delaunay triangulation: a shorter approach. Comput. Aided Geom. Design 9 (1992) 491-494
    • (1992) Comput. Aided Geom. Design , vol.9 , pp. 491-494
    • Powar, P.1
  • 16
    • 0025519222 scopus 로고
    • Minimal roughness property of the Delaunay triangulation
    • Rippa S. Minimal roughness property of the Delaunay triangulation. Comput. Aided Geom. Design 7 (1990) 489-497
    • (1990) Comput. Aided Geom. Design , vol.7 , pp. 489-497
    • Rippa, S.1


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