Victor Milenkovic and Elisha Sacks
Robust Geometry: Papers and Software
This page contains links to papers and software by Victor Milenkovic
and Elisha Sacks.
If you do not have access to the published papers, please contact the
authors for a preprint.
An approximate arrangement algorithm for semi-algebraic curves.
International Journal of Computational Geometry and Applications.
17(2):175-198, April 2007.
A monotonic convolution for Minkowski sums.
International Journal of Computational Geometry and Applications.
17(4):383-396, August 2007.
Two approximate Minkowski sum algorithms.
International Journal of Computational Geometry and Applications.
20(4):485-509, August 2010.
With Steven Trac.
Planar shape manipulation using approximate geometric primitives.
http://arxiv.org/abs/1210.0607, 2012.
Submitted to
International Journal of Computational Geometry and Applications.
@inproceedings{sacks-milenkovic11a,
author="Sacks, Elisha and Milenkovic, Victor",
title="Robust approximate assembly partitioning",
booktitle="Proceedings of the Canadian Conference on Computational Geometry",
organization="Canadian Conference on Computational Geometry",
year=2011}
Robust approximate assembly partitioning.
Proceedings of the Canadian Conference on Computational Geometry,
2011.
With Min-Ho Kyung.
Robust minkowski sums of polyhedra via controlled linear perturbation.
Proceedings of the 14th ACM Symposium on Solid and Physical Modeling, pp. 23-30. 2010.
With Min-Ho Kyung.
Controlled linear perturbation.
Computer-Aided Design, 43(10):1250--1257, 2011.
With Steven Trac.
Robust Complete Path Planning in the Plane.
Proceedings of the Workshop on the Algorithmic Foundations of
Robotics (WAFR), 2012. Invited version to appear in IEEE T-ASE.
HIPAIR Mechanical System
including users manual.
Two Strategies for Approximate Computational Geometry
slides for a talk at Tel Aviv University.
ROBUST Euclidean, Boolean, and Minkowski operations on planar regions.
Source code for
Robust Complete Path Planning in the Plane.
Latest version of ACP library.