기관회원 [로그인]
소속기관에서 받은 아이디, 비밀번호를 입력해 주세요.
개인회원 [로그인]

비회원 구매시 입력하신 핸드폰번호를 입력해 주세요.
본인 인증 후 구매내역을 확인하실 수 있습니다.

회원가입
서지반출
Delaunay Triangulation의 폴리건 검색속도 개선을 위한 T-Search와 Dynamic-Window 개념의 결합
[STEP1]서지반출 형식 선택
파일형식
@
서지도구
SNS
기타
[STEP2]서지반출 정보 선택
  • 제목
  • URL
돌아가기
확인
취소
  • 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. A
권/호정보
2003년|27권 5호|pp.681-687 (7 pages)
발행정보
대한기계학회
파일정보
정기간행물|
PDF텍스트
주제분야
기타
이 논문은 한국과학기술정보연구원과 논문 연계를 통해 무료로 제공되는 원문입니다.
서지반출

기타언어초록

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.