Some adventures in mesh generation and triangulation
garrettmills
71d6b629ab
- Fix Triangle.getAngles - Fix Triangle.getMinAngle - Fix optimal bisector triangle computations - Fix trapezoid computations Triangulation is (mostly) working now. Still need to handle the edge case where the base of a trapezoid corresponds to multiple upper bound vectors. |
||
|---|---|---|
| src | ||
| .gitignore | ||
| Makefile | ||
| package.json | ||
| pnpm-lock.yaml | ||
| README.md | ||
| tsconfig.json | ||
Sources
I plan to clean these up and reference them better, but for now:
- https://stackoverflow.com/a/39673693
- https://tildesites.bowdoin.edu/~ltoma/teaching/cs3250-CompGeom/spring17/Lectures/notes-delaunay.pdf
- https://pdf.sciencedirectassets.com/271418/1-s2.0-S0965997800X00130/1-s2.0-096599789600004X/main.pdf?X-Amz-Security-Token=IQoJb3JpZ2luX2VjENP%2F%2F%2F%2F%2F%2F%2F%2F%2F%2FwEaCXVzLWVhc3QtMSJGMEQCIBn%2FJ1FM7n91ec%2BaV1Dahb8mdx9GHJXb4v2YhelKamrUAiBfqKxllIbhkxSE4NUockz%2BAxJr2NuSmOoXvJzSWAmq8yr6Awg7EAQaDDA1OTAwMzU0Njg2NSIMVbvQGivtHogYWheaKtcD9NbnvzHbem%2Bzt1esJciOMi69eYEcKvx3WJ6VdMrR49G1FLy5UiysB6dRoROtL0YTV%2FWKsSBnLACmPv0wcJ3jBWIiCoJmTxbvGP1Rz8W8xSTlLpjXbk7Ae17Ze9XLqkUSpyU4f3n5z26Mjv1NAeTtjGGqE7rA14paa8mKK8gdQEszb02%2BKhIAlIM0fQPMPCpACowNMfb4RzFM499CcHUDBDHgQy9eSWPjLdUAM8WlkKSpuMnFIg5cdhzm%2F2femE2lot%2Fy2F5pCzjZ71ZL21uMGDFbaArAHuwTQ3hSFIA%2Fn2z9YfIe6%2BqJiWVBkcJyGGCDGxN%2BUE9zWuaHZVEDOz3ie0qqt3ykvpLzLlyFPfDfVuabdRPL%2BiKTcGdvzErNWSAP4p4tJLEFYjzeTTB8JnaVXEu9hmCe7Timzge76tMJ9DVWRAn0U1PWXXjk3bpufgo%2FW2mxE3g9HfQF00iDIqz%2FXiLr3Oc70dhl1ncwv%2FUuZ52kJRnHrerpka4stClCt1JfR%2BGZhy2lz1eA2TQA52%2F2PxQsLd95j9obXt1M2OMMM%2BbqEcgQifi78yUbaDhKtQ5L2pd4CCx6Nw5D1CE9U1jmXbUu3SNrvUf5bBsa%2BJtCQlfGXOrUAdoiMPjotIoGOqYBwsugKWfGs2qE0uoqz8jLec%2BrF81Es6QW3pbGI8WQeDcIf2cUMrzxDwL2qa1gO0Y0yr08S%2FkuhdhULi6U4U4BZbICTnka5XGhtegJlup0NEuR2iQpGYYF0FnRUCzcBN0exkXC8LkXHbgOMWLl%2FUpviW%2B8p%2BgWwM5beNs6Ll6mPXAGgxXi1Mma9nXUyeo0DLUe42mDJf0mAmOs9V8CZnUar1%2Fcy4g7Ig%3D%3D&X-Amz-Algorithm=AWS4-HMAC-SHA256&X-Amz-Date=20210924T034818Z&X-Amz-SignedHeaders=host&X-Amz-Expires=300&X-Amz-Credential=ASIAQ3PHCVTYRIE3TWX2%2F20210924%2Fus-east-1%2Fs3%2Faws4_request&X-Amz-Signature=4fa42b93346587f040f3114af54a624aa1ce5bcbd48f88a5703f0212c5bcbdf8&hash=840c061ec5b5a32e5ed645e6c23e7162e9100e7d9a176d19e2e0bf269be74ab0&host=68042c943591013ac2b2430a89b270f6af2c76d8dfd086a07176afe7c76c2c61&pii=096599789600004X&tid=spdf-5f722a9c-22cb-4363-a974-b5baa2afdec2&sid=e24de7e3779a9646f05b0ee12c94feb71407gxrqa&type=client
- An algorithm for automatic Delaunay triangulation of arbitrary planar domains by Chongjiang Du
- https://stackoverflow.com/questions/1560492/how-to-tell-whether-a-point-is-to-the-right-or-left-side-of-a-line
- https://stackoverflow.com/questions/44474864/compute-determinant-of-a-matrix
- https://sites.cs.ucsb.edu/~suri/cs235/Delaunay.pdf
- https://www.cs.princeton.edu/courses/archive/fall05/cos528/handouts/A%20Simple%20and%20fast.pdf