Finding minimal convex nested polygons

Optimal link path queries in a simple polygon

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms

Separation and approximation of polyhedral objects

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms

On the bit complexity of minimum link paths: superquadratic algorithms for problems solvable in linear time

Proceedings of the twelfth annual symposium on Computational geometry

Circular separability of polygon

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms

Sweeping simple polygons with a chain of guards

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms

Maintaining approximate extent measures of moving points

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms

Succinct approximate convex pareto curves

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms

Deconstructing approximate offsets

Proceedings of the twenty-seventh annual symposium on Computational geometry

Sparse and unique nonnegative matrix factorization through data preprocessing

The Journal of Machine Learning Research