Philippe Lebel
Followers: 0 Following: 0
10 of your answers have been accepted
Awarded to Philippe Lebel on 15 Feb 2022
Contribute at least one answer each month for 3 consecutive months
Awarded to Philippe Lebel on 14 Feb 2020
Answer 1 question that was unanswered for more than 30 days
Awarded to Philippe Lebel on 20 Nov 2019
3 of your answers have been accepted
Awarded to Philippe Lebel on 18 Nov 2019
Your submissions were downloaded 10 or more times in a month
Awarded to Philippe Lebel on 01 Nov 2019
Publish your first review
Awarded to Philippe Lebel on 09 Oct 2019
Your submissions received 1 five star rating
Awarded to Philippe Lebel on 09 Oct 2019
Publish your first submission
Awarded to Philippe Lebel on 09 Oct 2019
Provide your first answer ever to someone else's question
Awarded to Philippe Lebel on 22 Aug 2018
Accept 1 answer given by other contributors
Awarded to Philippe Lebel on 29 May 2018
Solve a problem for the first time
Awarded to Philippe Lebel on 09 May 2018
Feeds
제출됨
GJK algorithm distance of closest points in 3D
Computes the coordinates where the minimum distance between two convex polyhedrons occure.
대략 7년 전 | 다운로드 수: 4 |
또한 다음 목록에서 웹사이트를 선택하실 수도 있습니다.
미주
- América Latina (Español)
- Canada (English)
- United States (English)
유럽
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom(English)
아시아 태평양
- Australia (English)
- India (English)
- New Zealand (English)
- 中国
- 日本Japanese (日本語)
- 한국Korean (한국어)