Timeline for Need curvature for triangulation of a 2D area (or a good algorithm)
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 22, 2024 at 22:04 | comment | added | Yves Daoust | Without a clear explanation, I cannot help. Bye. | |
| Nov 22, 2024 at 18:08 | comment | added | U. Windl | The corners of A_2 (2,3,4) have known properties as described, because they are on the border. | |
| Nov 22, 2024 at 10:17 | comment | added | Yves Daoust | This does not answer my request for precision. How will you interpolate in the areas that are not reachable from C? | |
| Nov 21, 2024 at 20:58 | comment | added | U. Windl | @YvesDaoust I specified "...*there is some special point C that is not outside of the bounded area* ...". In many cases C is more or less near the center (thus the name), but it could get very close to the boundary. The interpolation is the next thing: In one case linear interpolation is fine, and actually the reason for the algorithm is that I want to substitute the linear interpolation from C to the border with a "stepwise linear" interpolation where I would compute the value from the point's coordinates. Actually I want to do it in PostScript. | |
| Nov 21, 2024 at 13:17 | comment | added | Yves Daoust | What you are asking is unclear. What is the relevance of the point C? In the case of the contour with a "fold", what interpolation result do you expect? | |
| Nov 21, 2024 at 13:14 | comment | added | Yves Daoust | So you mean that you have a polygon, rather than a curve? | |
| Nov 7, 2024 at 9:55 | answer | added | Simon F | timeline score: 2 | |
| S Nov 5, 2024 at 21:19 | review | First questions | |||
| Nov 8, 2024 at 9:20 | |||||
| S Nov 5, 2024 at 21:19 | history | asked | U. Windl | CC BY-SA 4.0 |