Statistics
RANK
N/A
of 289.675
REPUTATION
N/A
CONTRIBUTIONS
0 Questions
0 Answers
ANSWER ACCEPTANCE
0.00%
VOTES RECEIVED
0
RANK
9.964 of 19.575
REPUTATION
59
AVERAGE RATING
5.00
CONTRIBUTIONS
1 File
DOWNLOADS
2
ALL TIME DOWNLOADS
305
CONTRIBUTIONS
0 Posts
CONTRIBUTIONS
1 Public Channel
AVERAGE RATING
50
CONTRIBUTIONS
0 Highlights
AVERAGE NO. OF LIKES
Your submissions received 3 five star ratings
Awarded to Mattia on 05 Jul 2023
Your submissions were downloaded 10 or more times in a month
Awarded to Mattia on 01 Nov 2019
Publish your first review
Awarded to Mattia on 09 Oct 2019
Have 1 submission connected to GitHub
Awarded to Mattia on 09 Oct 2019
Publish your first submission
Awarded to Mattia on 09 Oct 2019
Solve a problem for the first time
Awarded to Mattia on 16 Jul 2014
Feeds
Submitted
openGJK: compute minimum distance between 3D polyhedra
Fast and reliable implementation of the Gilbert-Johnson-Keerthi (GJK) algorithm. University of Oxford.
bijna 3 jaar ago | 2 downloads |
Solved
Generate a vector like 1,2,2,3,3,3,4,4,4,4
Generate a vector like 1,2,2,3,3,3,4,4,4,4 So if n = 3, then return [1 2 2 3 3 3] And if n = 5, then return [1 2 2...
bijna 10 jaar ago
You can also select a web site from the following list
Americas
- América Latina (Español)
- Canada (English)
- United States (English)
Europe
- 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)
Asia Pacific
- Australia (English)
- India (English)
- New Zealand (English)
- 中国
- 日本Japanese (日本語)
- 한국Korean (한국어)