Minimally covering a horizontally convex orthogonal polygon
SCG '86 Proceedings of the second annual symposium on Computational geometry
On the difficulty of tetrahedralizing 3-dimensional non-convex polyhedra
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
On the Reflexivity of Point Sets
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Using simplicial partitions to determine a closest point to a query line
Pattern Recognition Letters
Convex decompositions of polyhedra
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
A proximity metric for continuum path planning
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
The art gallery theorem for simple polygons in terms of the number of reflex and convex vertices
Information Processing Letters
| Hi-index | 0.00 |