Papers by Victor Milenkovic

Peer Reviewed Articles and Exhibitions:

• V. J. Milenkovic and E. Sacks. An approximate arrangement algorithm for semi-algebraic curves. International Journal of Computational Geometry and Applications. In press.
• H. Schmidl and V. J. Milenkovic. A Fast Impulsive Contact Suite for Rigid Body Simulation. IEEE Transactions on Visualization and Computer Graphics, 10(2):189-197, March-April 2004.
• V. J. Milenkovic Densest translational lattice packing of non-convex polygons Computational Geometry, 22:205-222, 2002.
• V. J. Milenkovic and Harald Schmidl. Optimization Based Animation. SIGGRAPH 2001 . Here is the movie.
• V. J. Milenkovic. Shortest Path Geometric Rounding. Algorithmica 27(1):57-86, 2000.
• V. J. Milenkovic and K. Daniels. Translational Polygon Containment and Minimal Enclosure using Mathematical Programming. Transactions in Operational Research, 6:525-554, 1999.
• V. J. Milenkovic Rotational polygon containment and minimum enclosure using only robust 2D constructions Computational Geometry, 13(1):3-19, 1999.
• V. J. Milenkovic Rotational polygon overlap minimization and compaction Computational Geometry, 10(4):305-318, 1998.
• K. M. Daniels and V. J. Milenkovic. Multiple Translational Containment. Part I: An Approximation Algorithm. Algorithmica 19:148-182, special issue on Computational Geometry in Manufacturing, 1997.
• V. J. Milenkovic. Multiple Translational Containment, Part II: Exact Algorithms. Algorithmica 19:183-218, special issue on Computational Geometry in Manufacturing, 1997.
• K. M. Daniels, V. J. Milenkovic, D. Roth. Finding the Maximum Area Axis-Parallel Rectangle in a Simple Polygon. Computational Geometry: Theory and Applications 7:125-148, 1997.
• V. J. Milenkovic and V. Milenkovic. Rational Orthogonal Approximations to Orthogonal Matrices. Computational Geometry: Theory and Applications 7:25-35, 1997.
• V. J. Milenkovic. Position-Based Physics: Simulating the Motion of Many Highly Interacting Spheres and Polyhedra. Proceedings of SIGGRAPH '96, Computer Graphics Proceedings, Annual Conference Series, August 1996, pp. 129-136.
• Z. Li and V. J. Milenkovic. Compaction and Separation Algorithms for Nonconvex Polygons and Their Applications. European Journal of Operations Research, 84:539-561, 1995.
• V. J. Milenkovic. Robust Polygon Modeling. Special Issue of Computer-Aided Design on Uncertainties in Geometric Computations, vol. 25, no. 9, September, 1993, pp. 546-566. Voted best paper of 1993 by editors.
• V. J. Milenkovic and L. R. Nackman. Finding Compact Coordinate Representations for Polygons and Polyhedra. IBM Journal of Research and Development, vol. 34, no. 35, September 1990, pp. 753-769.
• Z. Li and V. J. Milenkovic. Constructing Strongly Convex Hulls Using Exact or Rounded Arithmetic. Algorithmica, vol. 8 (1992), pp. 345-364.
• V. J. Milenkovic. Verifiable Implementations of Geometric Algorithms Using Finite Precision Arithmetic. Artificial Intelligence , vol. 37 (1988), pp. 377-401.

Refereed Conference Proceedings:

• V. J. Milenkovic and E. Sacks. An approximate arrangement algorithm for semi-algebraic curves. Proceedings of the 22th Annual Symposium on Computational Geometry, ACM, June 2006.
• V. J. Milenkovic. Densest Translational Lattice Packing of Non-Convex Polygons. Proceedings of the 16th Annual Symposium on Computational Geometry, ACM, June 2000.
• V. J. Milenkovic. Rotational Polygon Containment and Minimum Enclosure. Proceedings of the 14th Annual Symposium on Computational Geometry, ACM, June 1998.
• V. J. Milenkovic. Rotational Polygon Overlap Minimization. Proceedings of the 13th Annual Symposium on Computational Geometry, ACM, Nice, France, June 4-6, 1997.
• V. J. Milenkovic. Translational Polygon Containment and Minimal Enclosure using Linear Programming Based Restriction. Proceedings of the 1996 ACM Symposium on the Theory of Computing (STOC), May 22-24, 1996, pp. 109-118.
• K. Daniels and V. J. Milenkovic. Column-Based Strip Packing using Ordered and Compliant Containment. Proceedings of the First ACM Workshop on Applied Computational Geometry (WACG), edited by Ming C. Lin and Dinesh Manocha, May 27-28, 1996, pp. 33-38. (31 papers submitted, 12 accepted.) Proceedings to appear as Lecture Notes in Computer Science, Springer-Verlag.
• K. M. Daniels and V. J. Milenkovic. Multiple Translational Containment: Approximate and Exact Algorithms. Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), January 22-24, 1995, pp. 205-214.
• Z. Li and V. J. Milenkovic. A Compaction Algorithm for Non-Convex Polygons and Its Application. Proceedings of the Ninth Annual Symposium on Computational Geometry, ACM, San Diego, CA, May 19-21, 1993, pp. 153-162.
• S. Fortune and V. J. Milenkovic. Numerical Stability of Algorithms for Line Arrangements. Seventh Annual ACM Symposium on Computational Geometry, North Conway, N.H., June 10-12, 1991, pp. 334-341.
• C. Kaklamanis, A. R. Karlin, F. T. Leighton, V. J. Milenkovic, P. Raghavan, S. Rao, C. Thomborson, and A. Tsantilas. Asymptotically Tight Bounds for Computing with Faulty Arrays of Processors. 31st Annual Symposium on the Foundations of Computer Science (FOCS), IEEE, October 1990, pp. 285-296.
• V. Milenkovic, V. J. Milenkovic, and P. H. Milenkovic. Inverse Kinematics of Not Fully Serial Robot Linkages with Non-Singular Wrists. Proceedings of the Robot Kinematics Workshop, S. Stifter and J. Lenarcic, editors. Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria, September 1990, pp. 335-342.
• Z. Li and V. J. Milenkovic. Constructing Strongly Convex Hulls Using Exact or Rounded Arithmetic. Proceedings of the Sixth Annual Symposium on Computational Geometry (SCG), Berkeley, California. ACM Press, June 6-8, 1989, pp. 235-243.
• V. J. Milenkovic and L. R. Nackman. Finding Compact Coordinate Representations for Polygons and Polyhedra. Proceedings of the Sixth Annual Symposium on Computational Geometry (SCG), Berkeley, California. ACM Press, June 6-8, 1989, pp. 244-252.
• V. J. Milenkovic. Double Precision Geometry: A General Technique for Calculating Line and Segment Intersections Using Rounded Arithmetic. 30th Annual Symposium on the Foundations of Computer Science (FOCS), IEEE, October 1989, pp. 500-506.
• V. J. Milenkovic. Calculating Approximate Curve Arrangements Using Rounded Arithmetic. Proceedings of the Fifth ACM Symposium on Computational Geometry, Saarbrucken, West Germany, June 5-7, 1989, pp. 197-207.
• V. J. Milenkovic. Robust Geometric Computations for Vision and Robotics. Proceedings of the DARPA Image Understanding Workshop, May, 1989, pp. 764-773.
• V. J. Milenkovic and T. Kanade. Trinocular Vision Using Photometric and Edge Orientation Constraints. Proceedings of the DARPA Image Understanding Workshop, edited by Lee S. Baumann, December 1985, pp. 163-175.

Book Chapters:

• V. J. Milenkovic. Extending the Hough Transform to Higher Dimensional Objects. Techniques for 3-D Machine Perception, edited by Azriel Rosenfeld and Laveen Kanal, published by North-Holland, 1986. pp. 231-254.

Ph.D. Theses of Graduate Students

• K. M. Daniels. Containment Algorithms for Nonconvex Polygons with Applications to Layout. Technical Report TR-12-95, Center for Research in Computing Technology, Division of Applied Sciences, Harvard University, May, 1995.
• Z. Li. Compaction Algorithms for Non-Convex Polygons and Their Applications. Technical Report TR-15-94, Center for Research in Computing Technology, Division of Applied Sciences, Harvard University, May, 1994.

Technical Reports:

• Victor Milenkovic and Elisha Sacks. An inconsistency sensitive arrangement algorithm for algebraic curves. Technical Report CSD-TR 04-017, Purdue University, June, 2004.
• V. J. Milenkovic and K. M. Daniels. Translational Polygon Containment and Minimal Enclosure using Geometric Algorithms and Mathematical Programming. Technical Report TR-25-95, Center for Research in Computing Technology, Division of Applied Sciences, Harvard University, November, 1995.
• K. M. Daniels, V. J. Milenkovic, and D. Roth. Finding the Largest Rectangle in Several Classes of Polygons. Technical Report TR-22-95, Center for Research in Computing Technology, Division of Applied Sciences, Harvard University, September, 1995.
• V. J. Milenkovic, K. M. Daniels, and Z. Li. Multiple Containment Methods. Technical Report TR-12-94, Center for Research in Computing Technology, Division of Applied Sciences, Harvard University, May, 1994.
• V. J. Milenkovic. Verifiable Implementations of Geometric Algorithms Using Finite Precision Arithmetic. Technical Report CMU-CS-88-168, Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA, July 1988.

Conference Proceedings:

• K. M. Daniels and V. J. Milenkovic. Distance-Based Subdivision for Translational LP Containment. Proceedings of the Eighth Canadian Conference on Computational Geometry, edited by Frank Fiala, Evangelos Kranakis, and Jorg-Rudiger Sack, Carleton University, Ottawa, Ontario, Canada, August 12-15, 1996, p. 196-201.
• V. J. Milenkovic. Practical Methods for Set Operations on Polygons using Exact Arithmetic. Proceedings of the Seventh Canadian Conference on Computational Geometry, Laval University, Quebec, August, 1995, pp. 55-60.
• V. J. Milenkovic. Position-Based Physics: Animating and Packing Spheres inside Polyhedra. Proceedings of the Seventh Canadian Conference on Computational Geometry, Laval University, Quebec, August, 1995, pp. 79-84.
• K. M. Daniels and V. J. Milenkovic. Limited Gaps. Proceedings of the Sixth Canadian Conference on Computational Geometry, Mark Keil, Ed., University of Saskatchewan, Saskatoon, Saskatchewan, Canada, August 2-6, 1994, pp. 225-230.
• K. M. Daniels, V. J. Milenkovic, and D. Roth. Finding the Largest Rectangle in Several Classes of Polygons. Proceedings of the Fifth Canadian Conference on Computational Geometry, A. Lubiw and J. Urrutia Eds., University of Waterloo, Ontario, Canada, August 5-9, 1993, pp. 322-327.
• V. J. Milenkovic. Robust Construction of the Voronoi Diagram of a Polyhedron. Proceedings of the Fifth Canadian Conference on Computational Geometry, A. Lubiw and J. Urrutia Eds., University of Waterloo, Ontario, Canada, August 5-9, 1993, pp. 473-478.
• J. Chang and V. J. Milenkovic. An Experiment Using LN for Exact Geometric Computations. Proceedings of the Fifth Canadian Conference on Computational Geometry, A. Lubiw and J. Urrutia Eds., University of Waterloo, Ontario, Canada, August 5-9, 1993, pp. 67-72.
• V. J. Milenkovic and V. Milenkovic. Rational Orthogonal Approximations to Orthogonal Matrices. Proceedings of the Fifth Canadian Conference on Computational Geometry, A. Lubiw and J. Urrutia Eds., University of Waterloo, Ontario, Canada, August 5-9, 1993, pp. 485-491.
• Z. Li and V. J. Milenkovic. The Complexity of the Compaction Problem. Proceedings of the Fifth Canadian Conference on Computational Geometry, A. Lubiw and J. Urrutia Eds., University of Waterloo, Ontario, Canada, August 5-9, 1993, pp. 7-11.
• V. J. Milenkovic, K. M. Daniels, and Z. Li. Placement and Compaction of Non-Convex Polygons for Clothing Manufacture. Proceedings of the Fourth Canadian Conference on Computational Geometry, C. A. Wang, Ed., Memorial University of Newfoundland, St. John's, Newfoundland, Canada, August 10-14, 1992, pp. 236-243.
• V. J. Milenkovic, K. M. Daniels, and Z. Li. Automatic Marker Making. Proceedings of the Third Canadian Conference on Computational Geometry, T. Shermer, Ed., Simon Fraser University, Vancouver, B.C., August 6-10, 1991, pp. 243-246.
• V. J. Milenkovic. Rounding Face Lattices in d Dimensions. Proceedings of the Second Canadian Conference on Computational Geometry, Jorge Urrutia, Ed., University of Ottawa, Ontario, August 6-10, 1990, pp. 40-45.
• V. J. Milenkovic. Rounding Face Lattices in the Plane. First Canadian Conference on Computational Geometry, Montreal, Quebec, Canada, August 21-25, 1989.