CAD From Scratch [17] | Constrained Delaunay Triangulations

  Рет қаралды 5,996

xmdi

xmdi

2 жыл бұрын

[For the impatient, go to 26:30 to see the results.] 17th video in a series on programming CAD utilities from scratch in C. In this video, we implemented an algorithm to adapt constraint edge requirements to our old Delaunay triangulations.
Comments, questions, and suggestions gladly appreciated.
Code on Github: github.com/xmdi/CAD-from-Scratch
If you found this content interesting, consider donating to Feeding America: www.feedingamerica.org/

Пікірлер: 18
@fnax
@fnax 2 жыл бұрын
Love this videos. Really inspiring project.
@legoh911
@legoh911 2 жыл бұрын
love this series!
@celinejost2745
@celinejost2745 Жыл бұрын
Awesome tutorial, thank you very much for sharing! I wonder (I assume no constraints for simplicity), what would happen if the next point I place, P, is exactely on the edge where 2 already created (anticlockwise) triangles ABC and DEF meet? So AB and ED are the same edge and P is on that edge somewhere in between. If I consider P to be inside ABC, then I can only make two 'real' triangles out of ABC, not three: PCA and PBC. "Triangle" PAB is 'degenerate' since P, A and B are on a line. I would think that I must in addition treat P to be contained in DEF, and so I would make 2 'real' triangles here too: PEF and PFD (and here again, PED is 'degenerate' since P, E and D are on a line. So in total I would end up with a total triangle count of +2 after placing my point P, which is similar as in the 'normal' case where I slice one triangle into 3 when my point is not on an edge but nicely inside the triangle.) - Would this be the correct approach? - Or would I really just pick either ABC or DEF to contain P? And if so, then how do I deal with the degenerate third triangle? Since the radius of the 'Delaunay circle' of that thing would be infinite... - Does the code do the right thing in this case? Thank you for any insights!!
@daveyhu
@daveyhu Жыл бұрын
Very well presented, easy to understand and having the source code makes it the best tutorial on triangulation I'd come across. Will you be making an episode 18?
@inginx747
@inginx747 13 сағат бұрын
Noticed the draft on 2.a says the non-convex edge is skipped instead of being added back. You did that in the code though
@johann2518
@johann2518 3 ай бұрын
Excellent explanation! It really helped me in implementing the triangulation. However, I think the routine for identifying all edge intersections on a given constraint isn't always correct. There's the possibility that two edges of a triangle have the constraint's endpoints on the right side.
@LangDat5989
@LangDat5989 2 жыл бұрын
hey how can i check time program run in win7
@notsoren665
@notsoren665 Жыл бұрын
When does the next episode come out?
@fred7981
@fred7981 8 ай бұрын
Is there a videoe for 3D?
@dallamine7470
@dallamine7470 Жыл бұрын
How can I contact you
@lennutrajektoor
@lennutrajektoor 2 жыл бұрын
I bet no one noticed it was presented in Paint!
@computerscience5803
@computerscience5803 2 жыл бұрын
we learned what CAD stands for, but what does your username mean?
@ssss-sk2sl
@ssss-sk2sl 2 жыл бұрын
Test 3 : s-i-m-p
@ssss-sk2sl
@ssss-sk2sl 2 жыл бұрын
Test 4 : y-o-u-'-l-l n-e-v-e-r b-e -a r-e-a-l w-o-m-a-n
@ssss-sk2sl
@ssss-sk2sl 2 жыл бұрын
Test 6 , same with black people, but in respond to this message
@ssss-sk2sl
@ssss-sk2sl 2 жыл бұрын
My comments are censored, all I can say is I really like trans people, but read it like it's the opposite, try it yourself, you are only allowed to like trans people by the AI
@covidsmr8860
@covidsmr8860 Жыл бұрын
Ah yes, scientific method.
Planar Delaunay Triangulations | CAD From Scratch [16]
29:06
HAPPY BIRTHDAY @mozabrick 🎉 #cat #funny
00:36
SOFIADELMONSTRO
Рет қаралды 17 МЛН
The BEST Way to Find a Random Point in a Circle | #SoME1 #3b1b
18:35
I built my own 16-Bit CPU in Excel
16:28
Inkbox
Рет қаралды 1,4 МЛН
How are memories stored in neural networks? | The Hopfield Network #SoME2
15:14
Using AI to Create the Perfect Keyboard
12:05
adumb
Рет қаралды 1,4 МЛН
GEO1015 -- Triangulations & Voronoi diagram
17:23
Hugo Ledoux
Рет қаралды 30 М.
Polygon Triangulation [1] - Overview of Ear Clipping
14:10
Two-Bit Coding
Рет қаралды 21 М.
Сколько реально стоит ПК Величайшего?
0:37
Kumanda İle Bilgisayarı Yönetmek #shorts
0:29
Osman Kabadayı
Рет қаралды 964 М.
Смартфон УЛУЧШАЕТ ЗРЕНИЕ!?
0:41
ÉЖИ АКСЁНОВ
Рет қаралды 1,2 МЛН
Xiaomi SU-7 Max 2024 - Самый быстрый мобильник
32:11
Клубный сервис
Рет қаралды 356 М.
Это - iPhone 16 и вот что надо знать...
17:20
Overtake lab
Рет қаралды 119 М.