- Finding intersection of line segments and point in a triangle (optimized using orientation function).
- Convex Hull - Quick-Hull, Onlion Layers (using Quick hull).
- Line-Sweep algorithm.
- KD Trees and 2D range query.
- Circle-criterion for Vornoi Diagrams and DCEL to accelerate the circle criterion.
-
Notifications
You must be signed in to change notification settings - Fork 0
sagarsimha/Computational-Geometry
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Algorithms in Computational Geometry
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published