• Title/Summary/Keyword: 디로네이 삼각형

Search Result 1, Processing Time 0.014 seconds

Integration of T-Search and Dynamic-Window Concept for Accelerated Searching Speed in Delaunay Triangulation (Delaunay Triangulation의 폴리건 검색속도 개선을 위한 T-Search와 Dynamic-Window 개념의 결합)

  • Kang, Hyun-Joo;Yoon, Sug-Joon;Kong, Ji-Young;Kim, Kang-Soo
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.27 no.5
    • /
    • pp.681-687
    • /
    • 2003
  • Terrain surfaces have to be modeled in very detail and wheel-surface contacting geometry must be well defined in order to obtain proper ground-reaction and friction forces fur realistic simulation of off-road vehicles. Delaunay triangulation is one of the most widely used methods in modeling 3-dimensional terrain surfaces, and the T-search is a relevant algorithm for searching resulting triangular polygons. The T-search method searches polygons in a successive order and may not allow real-time computation of off-road vehicle dynamics if the terrain is modeled with many polygons, depending on the computer performance used in the simulation. The dynamic T-search, which is proposed in this paper, combines conventional T-search and the concept of the dynmaic-window search which uses reduced searching windows or sets of triangular surface polygons at each frame by taking advantage of the information regarding dynamic charactereistics of a simulated vehicle. Numerical tests show improvement of searching speeds by about 5% for randomly distributed triangles. For continuous search following a vehicle path, which occurs in actual vehicle simulation, the searching speed becomes 4 times faster.