fast method to check point

Dear all,
in 3D I used the convex hull to check the points, but it cost time. I want to find fast method to check the points for D>=4, thanks for everyone,
regards

 Respuesta aceptada

Matt J
Matt J el 13 de Nov. de 2014

0 votos

You could obtain the inequalities A*x<=b representing the hyperrectangle using VERT2LCON ( Download ). Then you can just verify whether the inequalities are satisfied. There is also
I don't know which approach would be faster.

Más respuestas (0)

Categorías

Más información sobre Computational Geometry en Centro de ayuda y File Exchange.

Etiquetas

Preguntada:

el 13 de Nov. de 2014

Editada:

el 17 de Feb. de 2015

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by