| 查看: 1591 | 回复: 14 | |||
| 当前只显示满足指定条件的回帖，点击这里查看本话题的所有回帖 | |||
蜜雪兰瑭铜虫 (初入文坛)
|
[求助]
凹形的平面散乱点作出delaunay网格，怎样把外部多余的delaunay边去掉？急！
|
||
这是T形得平面散乱点，作出delaunay三角形后发现原本凹的地方出现了多余的三角形，用什么方法可以去掉？请给出算法，给出相关文献也行！各位大侠帮帮忙！  |
回复此楼» 猜你喜欢
求个博导看看
已经有17人回复
-
青基代表作，AAAI之类的A会的special track在国内认可度高吗？还是归为workshop之流？
已经有3人回复
-
上海工程技术大学【激光智能制造】课题组招收硕士
已经有6人回复
-
带资进组求博导收留
已经有11人回复
-
自荐读博
已经有5人回复
-
上海工程技术大学张培磊教授团队招收博士生
已经有4人回复
-
求助院士们，这个如何合成呀
已经有4人回复
-
临港实验室与上科大联培博士招生1名
已经有9人回复
-
写了一篇“相变储能技术在冷库中应用”的论文，论文内容以实验为主，投什么期刊合适？
已经有6人回复
-
最近几年招的学生写论文不引自己组发的文章
已经有11人回复
【答案】应助回帖
|
I think there are some boundary estimate or support estimate algorithm for data clouds in computer graphics, that might help to properly solve this problem. For example, Rolling-Ball Method For Estimating The Boundary Of The Support Of A Point-Process Intensity (1998) http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.3512 But I won't have time to read it through, if you find something simpler, please let us know. |
13楼2012-05-15 23:22:15
2楼2012-05-14 19:15:44
蜜雪兰瑭
铜虫 (初入文坛)
- 应助: 2 (幼儿园)
- 金币: 214.9
- 散金: 5
- 帖子: 34
- 在线: 2.8小时
- 虫号: 1602871
- 注册: 2012-02-06
- 性别: MM
- 专业: 计算数学与科学工程计算
3楼2012-05-14 23:26:28
★ ★
小雨萌萌: 金币+2, 3Q~ 2012-05-16 18:58:43
小雨萌萌: 金币+2, 3Q~ 2012-05-16 18:58:43
|
I assume you know how to judge whether or not certain point is inside the T-shape polygon. I believe there are algorithm to make sure that all the boundary segments are edges of triangles, for example, Matlab DelaunayTri has such options. Then, if these requirements are satisfied, you can just compute the midpoint of edges, if it is outside the T-shaped polygon, then remove the edge, also the corresponding triangle. |
4楼2012-05-14 23:37:56