Integration of gauss map, osculating toroidal patches, loop detection and C2 judgement to figure out the singular or loop intersection.

You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

Tree: 2636525d3c

master

Branches Tags

${ item.name }

Create tag ${ searchTerm }

Create branch ${ searchTerm }

from '2636525d3c'

${ noResults }

SingularityJudger/intersectTest

History

Dtouch 2636525d3c closest point		1 year ago
..
case1	fine tune, mark old version functions	2 years ago
case2	优化&测试	2 years ago
case3	优化&测试	2 years ago
case4	优化&测试	2 years ago
case6	优化&测试	2 years ago
case8	优化&测试	2 years ago
case10	优化&测试	2 years ago
case12	优化&测试	2 years ago
case14	优化&测试	2 years ago
case17	优化&测试	2 years ago
case20	优化&测试	2 years ago
case22	优化&测试	2 years ago
casea1	优化&测试	2 years ago
casea2	优化&测试	2 years ago
casea3	优化&测试	2 years ago
casea4	优化&测试	2 years ago
casea5	优化&测试	2 years ago
caseb5	fine tune, mark old version functions	2 years ago
singularCase	closest point	1 year ago
singularCase2	closest point	1 year ago
singularCase3	closest point	1 year ago