[9] |
GARCIA V, DEBREUVE E, BARLAUD M. Fast k nearest neighbor search using GPU [C]//2008 IEEEComputer Society Conference on Computer Vision andPattern Recognition Workshops. Anchorage, Alaska,USA: IEEE, 2008: 1-6.
|
[1] |
MOORE J, CUTRIGHT S, VIKEN J K. Structural design exploration of an electric powered multi-propulsor wing configuration [C]//58th AIAA/ASCE/AHS/ASC Structures, Structural Dynamics, and Materials Conference.Grapevine, Texas, USA: AIAA, 2017: 1-16.
|
[2] |
ARA′UJO D C, CASTRO L C E, SHZU M A M, etal. Modal identification of a wind turbine [J]. ProcediaEngineering, 2017, 199: 2250-2255.
|
[10] |
BENTLEY J L. Multidimensional binary search trees used for associative searching [J]. Communications ofthe ACM, 1975, 18(9): 509-517.
|
[11] |
RAJANI N, MCARDLE R, DHILLON I S. Parallel k nearest neighbor graph construction using tree-baseddata structures [C]//High Performance Graph Mining.Sydney, Australia: 1st HPGM Workshop, 2015: 1-8.
|
[3] |
PASTOR M, BINDA M, HARˇCARIK T, et al. Modalassurance criterion [J]. Procedia Engineering, 2012, 48:543-548.
|
[12] |
MULCHRONE K F. Application of Delaunay triangulationto the nearest neighbour method of strain analysis[J]. Journal of Structural Geology, 2003, 25(5):689-702.
|
[4] |
ALLEMANG R J. The modal assurance criterion:Twenty years of use and abuse [J]. Sound and Vibration,2003, 37(8): 14-23.
|
[13] |
BROWN R A. Building a balanced k-d tree in O(kn log n) time [J]. Journal of Computer Graphics Techniques,2015, 4(1): 50-68.
|
[5] |
KIM T S, KIM Y Y. MAC-based mode-tracking instructural topology optimization [J]. Computers andStructures, 2000, 74(3): 375-383.
|
[14] |
LEE D T, SCHACHTER B J. Two algorithms for constructinga Delaunay triangulation [J]. InternationalJournal of Computer and Information Sciences, 1980,9(3): 219-242.
|
[6] |
BREHM M, ZABEL V, BUCHER C. An automaticmode pairing strategy using an enhanced modal assurancecriterion based on modal strain energies [J].Journal of Sound and Vibration, 2010, 329(25): 5375-5392.
|
[15] |
LUDICK D J, JAKOBUS U, VOGEL M. A tracking algorithm for the eigenvectors calculated with characteristicmode analysis [C]//8th European Conferenceon Antennas and Propagation (EuCAP 2014 ). TheHague, the Netherlands: IEEE, 2014: 569-572.
|
[7] |
LUDICK D J, TONDER J V, JAKOBUS U. A hybrid tracking algorithm for characteristic mode analysis[C]//2014 International Conference on Electromagneticsin Advanced Applications (ICEAA). Palm Beach, Netherlands, Antilles: IEEE, 2014: 455-458.
|
[8] |
ESCHENAUER H A, OLHOFF N. Topology optimizationof continuum structures: A review [J]. AppliedMechanics Reviews, 2001, 54(4): 331-390.
|
[9] |
GARCIA V, DEBREUVE E, BARLAUD M. Fast k nearest neighbor search using GPU [C]//2008 IEEEComputer Society Conference on Computer Vision andPattern Recognition Workshops. Anchorage, Alaska,USA: IEEE, 2008: 1-6.
|
[10] |
BENTLEY J L. Multidimensional binary search trees used for associative searching [J]. Communications ofthe ACM, 1975, 18(9): 509-517.
|
[11] |
RAJANI N, MCARDLE R, DHILLON I S. Parallel k nearest neighbor graph construction using tree-baseddata structures [C]//High Performance Graph Mining.Sydney, Australia: 1st HPGM Workshop, 2015: 1-8.
|
[12] |
MULCHRONE K F. Application of Delaunay triangulationto the nearest neighbour method of strain analysis[J]. Journal of Structural Geology, 2003, 25(5):689-702.
|
[13] |
BROWN R A. Building a balanced k-d tree in O(kn log n) time [J]. Journal of Computer Graphics Techniques,2015, 4(1): 50-68.
|
[14] |
LEE D T, SCHACHTER B J. Two algorithms for constructinga Delaunay triangulation [J]. InternationalJournal of Computer and Information Sciences, 1980,9(3): 219-242.
|
[15] |
LUDICK D J, JAKOBUS U, VOGEL M. A tracking algorithm for the eigenvectors calculated with characteristicmode analysis [C]//8th European Conferenceon Antennas and Propagation (EuCAP 2014 ). TheHague, the Netherlands: IEEE, 2014: 569-572.
|