TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Repulsive Curves

329 点作者 lnyan大约 3 年前

15 条评论

keenancrane大约 3 年前
If you liked repulsive curves, you may also enjoy repulsive surfaces:<p><a href="https:&#x2F;&#x2F;www.cs.cmu.edu&#x2F;~kmcrane&#x2F;Projects&#x2F;RepulsiveSurfaces&#x2F;index.html" rel="nofollow">https:&#x2F;&#x2F;www.cs.cmu.edu&#x2F;~kmcrane&#x2F;Projects&#x2F;RepulsiveSurfaces&#x2F;i...</a><p>Deep dive into repulsive geometry here: <a href="https:&#x2F;&#x2F;youtu.be&#x2F;dtYGiCpzzbA" rel="nofollow">https:&#x2F;&#x2F;youtu.be&#x2F;dtYGiCpzzbA</a>
评论 #31134438 未加载
评论 #31139881 未加载
评论 #31136763 未加载
评论 #31134670 未加载
评论 #31134179 未加载
评论 #31139658 未加载
cs702大约 3 年前
This is immediately useful for a <i>huge</i> number of practical real-world applications.<p>Make sure to watch the short explanatory video (and turn the sound <i>on</i>) -- here&#x27;s the direct link:<p><a href="https:&#x2F;&#x2F;www.youtube.com&#x2F;watch?v=-uXFYpVumh4" rel="nofollow">https:&#x2F;&#x2F;www.youtube.com&#x2F;watch?v=-uXFYpVumh4</a><p>The short video is great. The paper looks great (based on a very quick skim; this is an area in which the authors have far more expertise than me). The high-level explanations are great. The web page is great -- informative and to-the-point. Really impressive work!<p>--<p>EDIT: The senior author is here at <a href="https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=31134139" rel="nofollow">https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=31134139</a> -- his comment should probably be above mine. Please upvote it.
评论 #31135791 未加载
iandanforth大约 3 年前
The video has some really interesting &#x2F; creative examples. Using this for path planning by treating paths as curves through space-time was particularly impressive.
ur-whale大约 3 年前
Keenan Crane&#x27;s [1] lab has been putting out some top notch research in recent years.<p>In particular, their work on discrete differential geometry [2] is really worth diving into (and Mr Crane is a <i>really</i> good pedagogue).<p>[1] <a href="https:&#x2F;&#x2F;www.cs.cmu.edu&#x2F;~kmcrane&#x2F;" rel="nofollow">https:&#x2F;&#x2F;www.cs.cmu.edu&#x2F;~kmcrane&#x2F;</a><p>[2] <a href="https:&#x2F;&#x2F;www.youtube.com&#x2F;watch?v=mas-PUA3OvA&amp;list=PL9_jI1bdZmz0hIrNCMQW1YmZysAiIYSSS" rel="nofollow">https:&#x2F;&#x2F;www.youtube.com&#x2F;watch?v=mas-PUA3OvA&amp;list=PL9_jI1bdZm...</a>
rland大约 3 年前
I can think immediately of applications:<p>- bio engineering -- predicting (?) or designing (?) molecules that are large chains to perform some particular function<p>- coverage path planning -- sort of a &quot;roomba&quot; problem -- find a continuous path, through a space, that covers the space<p>- 3-D printing -- find the extrusion path that maximally covers some area or areas with high strength with a minimum amount of material
评论 #31138084 未加载
ThouYS大约 3 年前
Keenan Crane simply makes the most beautiful papers out there
评论 #31134687 未加载
评论 #31149148 未加载
nateburke大约 3 年前
FWIW, Nathan Dunfield&#x27;s hand drawings are typically very difficult to improve upon.<p>This is an impressive paper. Thank you for sharing!
评论 #31135286 未加载
lewiso1大约 3 年前
One of the insights here is using the “tangent point energy” as part of the repulsion loss function. If anyone’s used, or knows of, a python implementation of this TPE function then please lmk!
bwestergard大约 3 年前
The graph layout example is really compelling.
yowlingcat大约 3 年前
Wow, imagine this could be very useful for a variety of logistics&#x2F;routing applications (IE train routing, assembly line optimization, self-driving cars). Perhaps this kind of stuff is in play there already and this just helps make it easier to visualize?<p>Lovely visualizations as well. Really makes it tangible.
zokier大约 3 年前
This could work well for PCB trace routing optimization too? Handling multiple layers might be bit difficult, but maybe not insurmountable?
arc-in-space大约 3 年前
Hold on, wasn&#x27;t there a similar paper last year wrt non-intersecting shape&#x2F;mesh optimization? (edit: I think it was a topology paper actually)<p>I found this: <a href="https:&#x2F;&#x2F;arxiv.org&#x2F;pdf&#x2F;2201.06256.pdf" rel="nofollow">https:&#x2F;&#x2F;arxiv.org&#x2F;pdf&#x2F;2201.06256.pdf</a> but I don&#x27;t think it&#x27;s what I&#x27;m thinking of.
评论 #31134168 未加载
评论 #31134142 未加载
lordleft大约 3 年前
Beautiful &amp; compelling presentation
shadowgovt大约 3 年前
The applications in particular are the piece I find most enjoyable about this publication. The robot path distance maximization, space-filling, and auto-earbud-untangler are pretty neat.
dieselgate大约 3 年前
The mobile experience is unfortunately quite repulsive so I didn’t read the article :( But wanted to..